FPT Is Characterized by Useful Obstruction Sets

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]

Abstract

Abstract is missing.