Congratulations to André Schidler, who successfully defended his PhD thesis “Scalability for SAT-based combinatorial problem solving” today.
Thanks to the evaluation committee: Armin Biere, Daniel Le Berre, João Marques-Silva, and Nysret Musliu.
Congratulations to Vaidyanathan P.R., who successfully defended his PhD thesis Scalable Bayesian Network Structure Learning using SAT-based Methods today.
Thanks to the evaluation committee (Christian Fermüller, Pekka Parviainen, Martina Seidl, and Sebastian Ordyniak).
Leroy Chew and Alexis de Colnet just joined the Algorithms and Complexity group as PIs of their own FWF ESPRIT Projects:
Congratulations to Leroy and Alexis for winning these competitively awarded project grants!
Alexander Dobler received the Best Student Paper Award at the 13th International Conference on the Theory and Application of Diagrams (DIAGRAMS 2022) in Rome in September 2022 for his paper “On Computing Optimal Linear Diagrams“, co-authored with his PhD advisor Martin Nöllenburg.
Effective as of today, Robert Ganian is promoted to a tenured Associate Professor at the Algorithms and Complexity group. Congratulations, Robert!
Jonas Mayerhofer, Markus Kirchweger, Marc Huber, and Günther Raidl received the best paper award for their work A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation at the 22nd European Conference on Evolutionary Computation in Combinatorial Optimization being held in Madrid, Spain, in April 2022.
Guangping Li successfully defended her PhD thesis “An Algorithmic Study of Practical Map Labeling” on May 13, 2022. Congratulations, Dr. Li!
Guangping was a PhD student in the FWF project “Human-centered Algorithm Engineering” and was supervised by Martin Nöllenburg. Her external thesis reviewers were Kevin Buchin and Christian Schulz. Guangping has already started a postdoc position at TU Dortmund, Germany.
The 28th Annual Graph Drawing Contest, a long running tradition of the graph drawing research community, was held in conjunction with the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021), hosted in Tübingen from the 14th to the 17th of September, 2021.
The contest is comprised of various categories. In the creative topics participants are provided with network data and tasked to design an informative but at the same time aesthetically pleasing layout of these networks.
In this category TU Wien was represented by two submissions, both of which
Congratulations to Jan Dreier for his LICS 2021 Distinguished Paper Award for his paper Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes.
Here is a link to the video of his presentation.
Stefan Szeider and Martin Kronegger gave a lecture on Algorithms and Programming to members of the Austrian Parliament.
The lecture consisted of three parts and concluded with a Q&A session with the MPs and ended with a live programming demonstration.
The Algorithms lecture took place on June 15th, 2021, in the same venue where usually the plenary discussions of the Austrian parliament take place, the “great Redoutensaal,” a beautiful hall located in Vienna’s Hofburg.
This lecture was part of the Faculty of Informatic’s initiative Digitale Kompetenzen (digital competence), consisting of several lectures on
