In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016 Leibniz International Proceedings in Informatics (LIPIcs) (58) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 34:1-34:14. ISSN 1868-8969
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) Leibniz International Proceedings in Informatics (LIPIcs) (55) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 28:1-28:15. ISSN 1868-8969
Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth.
In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (8845) Society for Industrial and Applied Mathematics (SIAM), Philadelphia, pp. 616-629.
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
In: Algorithms - ESA 2015. 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings Lecture Notes in Computer Science (9294) Springer, Berlin, pp. 865-877.
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams