Interval Vertex Deletion Admits a Polynomial Kernel

DOI10.1137/1.9781611975482.103zbMath1432.68185MaRDI QIDQ5236287

Meirav Zehavi, Saket Saurabh, Pranabendu Misra, Akanksha Agrawal

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975482.103

Mathematics Subject Classification ID

05C85: Graph algorithms (graph-theoretic aspects)

05C62: Graph representations (geometric and intersection representations, etc.)

68Q27: Parameterized complexity, tractability and kernelization