Talks and Poster Presentations (without Proceedings-Entry):
"A Survey on Parameterized Complexity and SAT";
Talk: Dagstuhl Seminar,
Schloss Dagstuhl, Deutschland (invited);
In this talk I will discuss basic concepts of parameterized complexity
(such as fixed-parameter tractability, reductions, hardness, and
kernelization) and survey parameterized complexity results related to
satisfiability (SAT). The focus will be on laying out what kind of
questions can be asked and not on technical details.
Created from the Publication Database of the Vienna University of Technology.