@InProceedings{ramanujan_et_al:LIPIcs.MFCS.2022.78,
author = {Ramanujan, M. S. and Sahu, Abhishek and Saurabh, Saket and Verma, Shaily},
title = {{An Exact Algorithm for Knot-Free Vertex Deletion}},
booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
pages = {78:1--78:15},
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.78},
URN = {urn:nbn:de:0030-drops-168769},
doi = {10.4230/LIPIcs.MFCS.2022.78},
annote = {Keywords: exact algorithm, knot-free graphs, branching algorithm}
}