@InProceedings{golovach_et_al:LIPIcs.STACS.2021.37,
author = {Golovach, Petr A. and Komusiewicz, Christian and Kratsch, Dieter and Le, Van Bang},
title = {{Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {37:1--37:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.37},
URN = {urn:nbn:de:0030-drops-136823},
doi = {10.4230/LIPIcs.STACS.2021.37},
annote = {Keywords: enumeration problems, polynomial delay, output-sensitive algorithms, kernelization, structural parameterizations, matching cuts}
}