@InProceedings{gruttemeier_et_al:LIPIcs.CPM.2020.17,
author = {Gr\"{u}ttemeier, Niels and Komusiewicz, Christian and Morawietz, Nils and Sommer, Frank},
title = {{String Factorizations Under Various Collision Constraints}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.17},
URN = {urn:nbn:de:0030-drops-121428},
doi = {10.4230/LIPIcs.CPM.2020.17},
annote = {Keywords: NP-hard problem, fixed-parameter algorithms, collision-aware string partitioning}
}