In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018) Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, pp. 1:1-1:15.
Polylogarithmic approximation algorithms for weighted-F-Deletion problems
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