In: 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018 Leibniz International Proceedings in Informatics, LIPIcs (101) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 191-1913. ISSN 1868-8969
The parameterized hardness of the k-center problem in transportation networks
In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 53:1-53:15.
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy
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. 16:1-16:14. ISSN 1868-8969