@InProceedings{wahlstrom:LIPIcs.STACS.2013.341,
author = {Wahlstr\"{o}m, Magnus},
title = {{Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem}},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
pages = {341--352},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-50-7},
ISSN = {1868-8969},
year = {2013},
volume = {20},
editor = {Portier, Natacha and Wilke, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.341},
URN = {urn:nbn:de:0030-drops-39465},
doi = {10.4230/LIPIcs.STACS.2013.341},
annote = {Keywords: Parameterized complexity, graph theory, kernelization, algebraic algorithms}
}