by Stefan Szeider
Reference:
The Parameterized Complexity of Constraint Satisfaction and ReasoningStefan SzeiderApplications 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, Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Masanobu Umeda, Armin Wolf, eds.), volume 7773 of Lecture Notes in Computer Science, pages 27-37, 2013, Springer Verlag.
Bibtex Entry:
@string{springer="Springer Verlag"}
@string{lncs="Lecture Notes in Computer Science"}
@inproceedings{Szeider13,
author = {Stefan Szeider},
title = {The Parameterized Complexity of Constraint Satisfaction
and Reasoning},
pages = {27-37},
editor = {Hans Tompits and
Salvador Abreu and
Johannes Oetsch and
J{\"o}rg P{\"u}hrer and
Dietmar Seipel and
Masanobu Umeda and
Armin Wolf},
booktitle = {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},
publisher = Springer,
series = LNCS,
volume = {7773},
year = {2013},
doi = {10.1007/978-3-642-41524-1 2},
}