Riccardo Dondi, Florian Sikora. The Longest Run Subsequence Problem: Further Complexity Results. In Pawel Gawrychowski, Tatiana Starikovskaya, editors, 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland. Volume 191 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{DondiS21,
title = {The Longest Run Subsequence Problem: Further Complexity Results},
author = {Riccardo Dondi and Florian Sikora},
year = {2021},
doi = {10.4230/LIPIcs.CPM.2021.14},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.14},
researchr = {https://researchr.org/publication/DondiS21},
cites = {0},
citedby = {0},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland},
editor = {Pawel Gawrychowski and Tatiana Starikovskaya},
volume = {191},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-186-3},
}