Talks and Poster Presentations (with Proceedings-Entry):
St. Szeider:
"The Parameterized Complexity of Constraint Satisfaction and Reasoning";
Keynote Lecture: International Conference on Applications of Declarative Programming and Knowledge Management,
Vienna, Austria (invited);
2011-09-28
- 2011-09-30; in: "19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011)",
H. Tompits (ed.);
Springer / LNCS,
7773
(2013),
27
- 37.
English abstract:
Parameterized Complexity is a new and increasingly popular theoretical framework for the rigorous analysis of NP-hard problems and the development of algorithms for their solution. The framework provides adequate concepts for taking structural aspects of problem instances into account. We outline the basic concepts of Parameterized Complexity and survey some recent parameterized complexity results on problems arising in Constraint Satisfaction and Reasoning.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-642-41524-1
Related Projects:
Project Head Stefan Szeider:
The Parameterized Complexity of Reasoning Problems
Created from the Publication Database of the Vienna University of Technology.