Michael R. Fellows, Bart M. P. Jansen. FPT Is Characterized by Useful Obstruction Sets. In Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk, editors, Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. Volume 8165 of Lecture Notes in Computer Science, pages 261-273, Springer, 2013. [doi]
@inproceedings{FellowsJ13,
title = {FPT Is Characterized by Useful Obstruction Sets},
author = {Michael R. Fellows and Bart M. P. Jansen},
year = {2013},
doi = {10.1007/978-3-642-45043-3_23},
url = {http://dx.doi.org/10.1007/978-3-642-45043-3_23},
researchr = {https://researchr.org/publication/FellowsJ13},
cites = {0},
citedby = {0},
pages = {261-273},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers},
editor = {Andreas Brandstädt and Klaus Jansen and Rüdiger Reischuk},
volume = {8165},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-45042-6},
}