@techreport{ef62b39edbb442e4bdd375ac4485cfa6,
title = "Testing Upward Planarity of Partial 2-Trees",
abstract = " We present an \$O(n\textasciicircum{}2)\$-time algorithm to test whether an \$n\$-vertex directed partial \$2\$-tree is upward planar. This result improves upon the previously best known algorithm, which runs in \$O(n\textasciicircum{}4)\$ time. ",
keywords = "cs.DS, cs.CG",
author = "Steven Chaplick and Giacomo, \{Emilio Di\} and Fabrizio Frati and Robert Ganian and Raftopoulou, \{Chrysanthi N.\} and Kirill Simonov",
note = "Appears in the Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022)",
year = "2022",
month = aug,
day = "26",
doi = "10.48550/arXiv.2208.12548",
language = "English",
type = "WorkingPaper",
}