@InProceedings{jansen_et_al:LIPIcs.SWAT.2024.28,
author = {Jansen, Bart M. P. and Verhaegh, Ruben F. A.},
title = {{Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion}},
booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)},
pages = {28:1--28:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-318-8},
ISSN = {1868-8969},
year = {2024},
volume = {294},
editor = {Bodlaender, Hans L.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.28},
URN = {urn:nbn:de:0030-drops-200683},
doi = {10.4230/LIPIcs.SWAT.2024.28},
annote = {Keywords: fixed-parameter tractability, essential vertices, integrality gap}
}