Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma. Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica, 81(7):2795-2828, 2019. [doi]
@article{GolovachHKLP19,
title = {Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2},
author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Paloma T. Lima and Daniël Paulusma},
year = {2019},
doi = {10.1007/s00453-019-00555-y},
url = {https://doi.org/10.1007/s00453-019-00555-y},
researchr = {https://researchr.org/publication/GolovachHKLP19},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2795-2828},
}