The Vienna March for Science on April 22, 2017, started with a Science Picnic. The Algorithms and Complexity Group performed a science demonstration with a human sorting network.

This demonstration introduced the participants to ideas of computational thinking. Volunteers from the public — adults and children — were invited  to sort numbers (and other items) by progressing through the sorting network and in doing so, getting an understanding of fundamental principles used in computers.

Contact: Stefan Szeider

Further pictures:

• Optics and Photonics News
• Science March Vienna Photos
• The Pacific Standard

The annual ALGO congress is the leading international gathering of researchers on Algorithms in Europe.

In 2017, ALGO will include the conferences ESA, IPEC, WAOA, ALGOCLOUD, ALGOSENSORS, and ATMOS, as well as a Summer School on Parameterised Complexity.

ALGO will be hosted at TU Wien, September 4-8, 2017.

More details can be found at the ALGO 2017 web site.

At ICDT 2017, the 20th International Conference on Database Theory, which will be held in Venice, Italy, March 21-24, 2017, our post-doc researcher Simone Bova will receive the best paper award for the paper:

Simone Bova and Hubie Chen.
How many variables are needed to express an existential positive query?

Congratulations!

Ronald de Haan successfully defended his PhD thesis “Parameterized Complexity in the Polynomial Hierarchy” on November 8th, 2016. Congratulations!

Ronald  was supervised by Stefan Szeider.

At SAT 2016, the 19th International Conference on Theory and Applications of Satisfiability Testing, which was held in Bordeaux, France, 5th-8th July, 2016, our PhD student Neha Lodha received the best student paper award for the paper: A SAT Approach to Branchwidth (with S. Ordyniak and S. Szeider). The paper appeared in the  SAT 2016 Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 179–195, 2016, Springer Verlag.

Congratulations!

Jeannette Wing (Microsoft Research) gives the Vienna Gödel Lecture 2016.

June 9, 2016, 17:30
TU Wien, Audimax
1060 Vienna, Getreidemarkt 9

The lecture is moderated by Stefan Szeider.

More information can be found here.

Foto copyright: Faculty of Informatics / Nadia Meister

Our colleague and friend Professor Helmut Veith passed away on March 12, 2016.
Our thoughts are with his family and friends.

Johannes Klaus Fichte successfully defended his PhD thesis “Backdoors to Tractability of Disjunctive Answer Set Programming” on October 6th, 2015. Congratulations!

Johannes was supervised by Stefan Szeider (TU Wien) and co-supervised by Torsten Schaub (Uni Potsdam).

By September 1st, 2015, Martin Nöllenburg joint the Algorithms and Complexity Group on a tenure track position. Previously he was head of a Young Investigator Group at Karlsruhe Institute of Technology, Germany.

Martin’s research interests include graph algorithms, in particular for graph drawing and network visualization, computational geometry, in particular algorithms for cartography and geovisualization, as well as algorithm engineering and combinatorial optimization.

Friedrich Slivovsky successfully defended his PhD thesis “Structure in #SAT and QBF” on May 5th, 2015. Congratulations!

Friedrich, who conducted his PhD studies under the advise of Stefan Szeider, is now working as a post-doc in the research project “Variable Dependencies of Quantified Boolean Formulas” (FWF P27721)