@InProceedings{otachi_et_al:LIPIcs.SWAT.2024.38,
author = {Otachi, Yota and Suzuki, Akira and Tamura, Yuma},
title = {{Finding Induced Subgraphs from Graphs with Small Mim-Width}},
booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)},
pages = {38:1--38:16},
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.38},
URN = {urn:nbn:de:0030-drops-200788},
doi = {10.4230/LIPIcs.SWAT.2024.38},
annote = {Keywords: mim-width, graph algorithm, NP-hardness, induced subgraph problem, cluster vertex deletion}
}