The Algorithms and Complexity group was very successful at the Informatics Awards 2023:

André Schidler won the Best Dissertation Award for his thesis Scalability for SAT-based Combinatorial Problem Solving (supervised by Stefan Szeider).

Esra Ceylan won the Best Master Thesis Award for her thesis Optimal Seat Arrangement: Structure, Algorithms, and Complexity (supervised by Jiehua Chen).

Among the thirteen students who received a Bachelor of Honors award, five were supervised by professors of the Algorithms and Complexity group: Thomas Depian, Jakob Greilhuber, Michael Kiran Huber, Sophia Schober, and Florentina Voboril.

Congratulations to all awardees!

After her successful tenure evaluation, our colleague Jiehua Chen has been promoted to an Associate Professor.

Hua joined the Algorithms and Complexity group at TU Wien in 2019. Her research interests include the (parameterized) complexity of, and the design and analysis for, combinatorial problems arising in contexts such as optimization problems related to graphs and hypergraphs and Computational Social Choice (computational problems around voting, domain restrictions, and preference-based stable matching problems).

Congratulations!

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:

• QBF Proofs and Certificates (FWF ESP 197, PI: Leroy Chew)
• Overcoming Intractability in the Knowledge Compilation Map (FWF ESP 235, PI: Alexis de Colnet)

Congratulations to Leroy and Alexis for winning these competitively awarded project grants!

Effective as of today, Robert Ganian is promoted to a tenured Associate Professor at the Algorithms and Complexity group. Congratulations, Robert!

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

Congratulations to our former students Martin Riedler and Tomas Peitl for receiving this outstanding award of a Promotio Sub Auspiciis Praesidentis Rei Publica (Doctoral graduation under the auspices of the Federal President). Each year, only a handful  of doctoral students from Austria receive this special award, which requires excellent grades throughout secondary school, undergraduate and graduate studies.

We are specially proud that two students from our group receive this honour this year.

The ceremony took place with over year’s delay due to the Covid pandemic.

News post at TU Wien’s website.

By December 1st, 2020, our colleague Martin Nöllenburg has been promoted to Full Professor for Graph and Geometric Algorithms. 

See here 5 Questions with … Martin Nöllenburg from last year.