Two submissions of graph layouts from the Algorithms and Complexity Group were successful in the 26th Graph Drawing Contest, which was held in conjunction with the 27th International Symposium on Graph Drawing and Network Visualization (GD) in Průhonice near Prague in September 2019.

PhD students Guangping Li, Soeren Nickel and their advisor Martin Nöllenburg from the Algorithms and Complexity Group together with their colleagues Hsiang-Yun Wu and Ivan Viola from the Visualization Group of TU Wien won the First Prize in the category “Creative Topics: Meal Ingredients”. In this category the

Tomáš Peitl successfully defended his PhD thesis “Advanced Dependency Analysis for QBF” on October 14, 2019. Congratulations!

Tomáš was was supervised by Stefan Szeider and co-supervised by Friedrich Slivovsky.

In November, he will start with his FWF Erwin Schrödinger scholarship a postdoc position at the Friedrich Schiller Universität Jena.

Our solver htdSMT submitted by André Schidler and Stefan Szeider achieved the first place in the PACE’19 competition for the Track Hypertree Width/Exact.

PACE’19 is the 4th edition of the Parameterized Algorithms and Computational Experiments Challenge,  which was conceived in Fall 2015 to deepen the relationship between parameterized algorithms and practice. Implemented algorithms are submitted and ranked by their performance on a large set of benchmark problem instances.

PACE’19 had three tracks: Vertex Cover, Hypertree Width/Exact, and Hypertree Width/Heuristic. Our algorithm HtdSMT came first in the Hypertree Width/Exact track.

The award ceremony took

Neha Lodha successfully defended her PhD thesis “SAT Approach to Decomposition” on June 18,, 2019. Congratulations!

Neha was was supervised by Stefan Szeider.

Neha was one of the first students who joined the Doctoral Program Logical Methods in Computer Science (LogiCS) where she was a student representative.

The Algorithms and Complexity Group has currently three female PhD students:

Thekla Hamm works in the FWF funded research project “New Frontiers for Parameterized Complexity (FWF P31336)” under the advise of  Dr. Robert Ganian.
Guangping Li works in the FWF funded research project “Human-centered Algorithm Engineering: Graph and Map Visualization (FWF P31119)” under the advise of Prof. Martin Nöllenburg.
Neha Lodha works in the FWF funded Doctoral College “Logical Methods in Computer Science (FWF W1255)” under the advise of Prof. Stefan Szeider.

Thekla and Guanping joined just recently, Neha is close to completion of her PhD

This semester’s EPILOG event, at which the Faculty of Informatics presents and honors excellent students and their Master theses, was a successful one for two Master students who wrote their thesis in the Algorithms and Complexity group.

Raphael Löffler received one of the two Best Poster Awards for the poster on his thesis “An Interactive Optimization Framework for Point Feature Label Placement”, supervised by Martin Nöllenburg and Fabian Klute. Among a competition of over 100 posters, Raphael convinced the EPILOG jury with his poster design and the clarity of exposition.

Raphael

Eduard Eiben received the Award of Excellence  for his outstanding PhD thesis from the Ministry of Education, Science and Research (BMBWF) on December 5, 2018.

Congratulations!

Eduard carried out his PhD work in the Algorithms and Complexity group, his advisors where Stefan Szeider, Robert Ganian, and Georg Gottlob. His work was funded by the Austrian Science Funds (FWF) via the projects:

1. Exploiting New Types of Structure for Fixed Parameter Tractability (X-Tract, FWF P26696)
2. Doctoral College on Logical Methods in Computer Science (LogiCS, FWF W1255)

Two teams of TU Wien students from the Master’s course “Graph Drawing Algorithms” taught by Martin Nöllenburg and Fabian Klute received awards for their submissions to the 25th Graph Drawing Contest, which was held in conjunction with the International Symposium on Graph Drawing and Network Visualization (GD) in Barcelona in September 2018.

In the category “Creative Topics: Game of Thrones” the task was to create a layout of a network of 84 characters and their relations from the popular TV show “Game of Thrones”. From a strong competition of 18 submissions the

Members of the Algorithms and Complexity Group together with the Vienna Center for Logic and Algorithms, presented a game at the annual Austrian science festival “Lange Nacht der Forschung” on April 13, 2018.

This year, the festival attracted a record number of 228.000 visitors to 265 exhibition stations across Austria, allowing a direct communication between the public and the researchers in a playful format.

At the Station 8, Am Hof, in Vienna’s 1st District, visitors were invited to play the game Catch the Virus (Fang das Virus), which was based on the famous Cops

Eduard Eiben successfully defended his PhD thesis “Exploiting new types of structure for fixed-parameter tractability” on April 10, 2018. Congratulations!

Eduard, who is the first student to graduate from the Doctoral Program Logical Methods in Computer Science (LogiCS) was supervised by Stefan Szeider.