@InProceedings{le_et_al:LIPIcs.MFCS.2022.68,
author = {Le, Hoang-Oanh and Le, Van Bang},
title = {{Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs}},
booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
pages = {68:1--68:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-256-3},
ISSN = {1868-8969},
year = {2022},
volume = {241},
editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.68},
URN = {urn:nbn:de:0030-drops-168663},
doi = {10.4230/LIPIcs.MFCS.2022.68},
annote = {Keywords: Cluster vertex deletion, Vertex cover, Computational complexity, Complexity dichotomy}
}