In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics, Philadelphia (PA), pp. 1711-1730.
Interval Vertex Deletion Admits a Polynomial Kernel
In: 35th International Symposium on Computational Geometry, SoCG 2019 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl, pp. 27:1-27:16.
Almost tight lower bounds for hard cutting problems in embedded graphs