1. Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 12(6), 476–497 (1994)
2. Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132–169 (1998)
3. Lecture Notes in Computer Science;G Brückner,2019
4. Lecture Notes in Computer Science;H Chan,2004
5. Chaplick, S., Di Giacomo, E., Frati, F., Ganian, R., Raftopoulou, C.N., Simonov, K.: Parameterized algorithms for upward planarity. In: Goaoc, X., Kerber, M. (eds.) 38th International Symposium on Computational Geometry (SoCG 2022). LIPIcs, vol. 224, pp. 26:1–26:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)