Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos. A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. Discrete Applied Mathematics, 312:72-85, 2022. [doi]
@article{MescoffPT22,
title = {A polynomial time algorithm to compute the connected treewidth of a series-parallel graph},
author = {Guillaume Mescoff and Christophe Paul and Dimitrios M. Thilikos},
year = {2022},
doi = {10.1016/j.dam.2021.02.039},
url = {https://doi.org/10.1016/j.dam.2021.02.039},
researchr = {https://researchr.org/publication/MescoffPT22},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {312},
pages = {72-85},
}