@InProceedings{c.m.gomes_et_al:LIPIcs.IPEC.2019.19,
author = {C. M. Gomes, Guilherme and Sau, Ignasi},
title = {{Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {19:1--19:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.19},
URN = {urn:nbn:de:0030-drops-114809},
doi = {10.4230/LIPIcs.IPEC.2019.19},
annote = {Keywords: matching cut, bounded degree cut, parameterized complexity, FPT algorithm, polynomial kernel, distance to cluster}
}