@InProceedings{bhore_et_al:LIPIcs.ISAAC.2021.19,
author = {Bhore, Sujoy and Li, Guangping and N\"{o}llenburg, Martin and Rutter, Ignaz and Wu, Hsiang-Yun},
title = {{Untangling Circular Drawings: Algorithms and Complexity}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {19:1--19:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.19},
URN = {urn:nbn:de:0030-drops-154528},
doi = {10.4230/LIPIcs.ISAAC.2021.19},
annote = {Keywords: graph drawing, straight-line drawing, outerplanarity, NP-hardness, untangling}
}