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)
Peter Norvig (Google Inc.) will give the Vienna Gödel Lecture 2015.
March 26, 2015, 17:30
Vienna University of Technology, Lecture Hall 7
1040 Vienna, Gußhausstraße 27-29, ground floor
The lecture will be moderated by Stefan Szeider.
More information can be found here.
The event will take place in Vienna, June 4-6, 2015.
The aim of this symposium is to bring together researchers who work on knowledge compilation from various angles, including knowledge representation, constraints, theory of algorithms, complexity, machine learning, and databases. Lectures and discussions will put all these different approaches into context and will stimulate a fruitful exchange of ideas between researchers from different fields.
The event is organised by Pierre Marquis and Stefan Szeider.
More information can be found here.
There is an opening for a funded PhD position in Quantified Boolean Formula (QBF) solving.
More information can be found here.
