Abstract
Stefan Szeider. The Parameterized Complexity of Constraint Satisfaction and Reasoning. Applications of Declarative Programming and Knowledge Management - 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers (Hans Tompits and Salvador Abreu and Johannes Oetsch and Jörg Pührer and Dietmar Seipel and Masanobu Umeda and Armin Wolf), volume 7773 of Lecture Notes in Computer Science, pages 27-37, 2013, Springer Verlag.
Type
Stefan Szeider
Head of Research Unit
Stefan Szeider is a Professor at the Algorithms and Complexity Group.