  We present an $O(n^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^4)$ time.
