In: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) Leibniz International Proceedings in Informatics, LIPIcs (66) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 22:1-22:14. ISSN 1868-8969
Parameterized and approximation results for scheduling with a low rank processing time matrix
In: 24th Annual European Symposium on Algorithms (ESA 2016) Leibniz International Proceedings in Informatics (LIPIcs) (57) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 33:1-33:17. ISSN 1868-8969
Counting Matchings with k Unmatched Vertices in Planar Graphs
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: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016 Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 21:1-21:14. ISSN 1868-8969