VCLA celebrates its 10-year-anniversary!

The Vienna Center for Logic and Algorithms (VCLA) was founded in September 2011 and officially opened in January 2012. During the international symposium on Mathematical Foundations of Computer Science (MFCS) in August 2022, the center seized the opportunity to celebrate its 10-year-anniversary with the audience of the conference as well as VCLA board members.

The celebration started out with a presentation held by the center’s co-chairs, Agata Ciabattoni and Stefan Szeider, who looked back on the past years and highlighted the most important events and projects, such as project ADA – Algorithmen Denken Anders and the world record achieved with the world’s largest human sorting network. They also took the time to remember their colleague Helmut Veith, who had founded the VCLA together with Szeider, but passed away under tragic circumstances in 2016.

Robert Ganian, Thomas Eiter, Magdalena Ortiz, Agata Ciabattoni, Nadia Creignou, Fedor Fomin, and Stefan Szeider at the 10-year anniversary celebration.

Subsequently, the winners of the VCLA International Student Awards of 2021 presented their work to the audience (in 2021, this had not been possible due to COVID-19). In his paper “Finding Optimal Tree Decompositions”, Tuukka Korhonen (University of Helsinki, now a PhD student at the University of Bergen) addressed the question of how to efficiently decompose graphs and hypergraphs, while Jasper Slusallek (Saarland University) studied the problem of subgraph isomorphism when the treewidth of the subgraph is bounded in “Algorithms and Lower Bounds for Finding (Exact-Weight) Subgraphs of Bounded Treewidth”.

Following the award ceremony, the VCLA hosted a small gathering with drinks and pastries to toast the 10-year anniversary of the center.


Jasper Slusallek

Tuukka Korhonen


Comments are closed.