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.

Congratulations to Martin Kronegger who received a Best Teaching Award 2020 from TU Wien.

The Algorithms and Complexity group is very happy about Martin’s engagement in the Algorithms and Data Structures course, which received a nomination for the Best Distance Learning Award 2020 for its digitalisation of the course during the COVID-19 restrictions in Spring 2020.

On October 1, 2020, Dr. Manuel Sorge has joined the Algorithms and Complexity group with a prestigious Feodor Lynen postdoc fellowship from the Alexander von Humboldt Foundation.

Manuel has received his PhD in 2016 from TU Berlin and has worked as a postdoc researcher at Ben-Gurion University in Beer Sheva, Israel and at Warsaw University, Poland. In his two-year project at TU Wien he will investigate network analysis and visualization problems by exploiting knowledge about inherent structures of complex networks, such as their structural sparsity or properties of overlapping clusters. Together

The 27th annual Graph Drawing Contest, held (virtually) in conjunction with the 28th International Symposium on Graph Drawing and Network Visualization (GD) in Vancouver on September 15-18, 2020 was a big success for our TU Wien graph drawing students, winning the first prize in both creative categories, as well as one second prize and one third prize. Three out of these four layouts were created as part of the coursework for the lecture Graph Drawing Algorithms (taught by Martin Nöllenburg and Soeren Nickel).

The 2020 contest comprised two creative topics: the

Tomáš Peitl and Stefan Szeider won the Best Paper Award at the main track of CP’2020, the 26th International Conference on Principles and Practice of Constraint Programming, for their paper: “Finding the Hardest Formulas for Resolution”.

Congratulations!

In the paper, a  resolution-based method (CDCL SAT solver) is used to find the hardest formulas for resolution, which constitutes a self reference as greatly illustrated by MC Escher in his lithograph “Drawing Hands (1948).

Abstract: A CNF formula is harder than another CNF formula with the same number of clauses if it requires a longer resolution proof.

Robert Ganian who receives an FWF START Prize for his project Parameterized Analysis in Artificial Intelligence.

The FWF START prize is comparable in competitiveness and funding to an ERC starting grant.

Out of 111 applications over all scientific disciplines, 7 START prizes where awarded.

Congratulations!

Fabian Klute successfully defended his PhD thesis “Avoiding Crossings in Non-Planar Graph Layouts” on March 13, 2020. Congratulations!

Fabian was supervised by Martin Nöllenburg. His thesis reviewers were Fabrizio Frati and Stephen Kobourov. Fabian is now a postdoc at Utrecht University.

Benedikt Klocker successfully defended his PhD thesis “Combinatorial Optimization Approaches for Graph Construction Problems” on March 25, 2020. Congratulations!

Benedikt was supervised by Günther Raidl and co-supervised by Herbert Fleischner.

Soeren Nickel, who recently joined the Algorithms and Complexity Group as a PhD student, won the Distinguished Young Alumn Award at the 29th EPILOG event of the Faculty of Informatics. With this award the Faculty of Informatics honors Soeren’s outstanding Master thesis “Generating Stable Demers and Iso-Hexagon Cartograms” as well as his excellent EPILOG presentation.

Soeren’s thesis, supervised by Martin Nöllenburg, presents algorithms and complexity results for computing value-by-area square and hexagon cartograms to display spatiotemporal data as a highly abstract map. It has already been presented at the International Symposium

In October 2019, Jiehua Chen has joined the Algorithms and Complexity Group on a tenure track position. 

Jiehua’s research interests are the parameterized complexity of, and the design and analysis for, combinatorial problems arising in contexts such as optimization related to graphs and hypergraphs, computational social choice, and preference-based stable matchings.

Jiehua is the principal investigator of a Vienna Research Group in ICT project, which is funded by the Vienna Science and Technology Fund (WWTF), which is comparable both in competitiveness as well as funding volume with an ERC starting grant. The project’s