Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi. On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. In Lukasz Kowalik, Michal Pilipczuk, Pawel Rzazewski, editors, Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers. Volume 12911 of Lecture Notes in Computer Science, pages 52-79, Springer, 2021. [doi]
@inproceedings{MannensNSS21,
title = {On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem},
author = {Isja Mannens and Jesper Nederlof and Céline M. F. Swennenhuis and Krisztina Szilágyi},
year = {2021},
doi = {10.1007/978-3-030-86838-3_5},
url = {https://doi.org/10.1007/978-3-030-86838-3_5},
researchr = {https://researchr.org/publication/MannensNSS21},
cites = {0},
citedby = {0},
pages = {52-79},
booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers},
editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski},
volume = {12911},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-86838-3},
}