@InProceedings{lucke_et_al:LIPIcs.ISAAC.2022.22,
author = {Lucke, Felicia and Paulusma, Dani\"{e}l and Ries, Bernard},
title = {{Finding Matching Cuts in H-Free Graphs}},
booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)},
pages = {22:1--22:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-258-7},
ISSN = {1868-8969},
year = {2022},
volume = {248},
editor = {Bae, Sang Won and Park, Heejin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.22},
URN = {urn:nbn:de:0030-drops-173076},
doi = {10.4230/LIPIcs.ISAAC.2022.22},
annote = {Keywords: matching cut, perfect matching, H-free graph, computational complexity}
}