C. Auer, C. Bachmaier, F. J. Brandenburg, and A. Gleiner, Classification of Planar Upward Embedding, Proc. 19th International Symposium on Graph Drawing, pp.415-426, 2011.
DOI : 10.1007/BF00353654

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleiner, and K. Hanauer, The Duals of Upward Planar Graphs on Cylinders, Proc. 38th Workshop on Graph-Theoretic Concepts in Computer Science, WG 2012, pp.103-113, 2012.
DOI : 10.1007/978-3-642-34611-8_13

C. Auer, C. Bachmaier, F. J. Brandenburg, and K. Hanauer, Rolling Upward Planarity Testing of Strongly Connected Graphs
DOI : 10.1007/978-3-642-45043-3_5
URL : http://www.infosun.fmi.uni-passau.de/~chris/down/RollingUpwardPlanarity.pdf

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleiner, and K. Hanauer, Upward planar graphs and their duals, Theoretical Computer Science, vol.571, pp.36-49, 2015.
DOI : 10.1016/j.tcs.2015.01.003

P. Bertolazzi, D. Battista, G. Liotta, G. Mannino, and C. , Upward drawings of triconnected digraphs, Algorithmica, vol.54, issue.no. 4, pp.476-497, 1994.
DOI : 10.1007/978-94-009-2639-4_1

P. Bertolazzi, D. Battista, G. Mannino, C. Tamassia, and R. , Optimal Upward Planarity Testing of Single-Source Digraphs, SIAM Journal on Computing, vol.27, issue.1, pp.132-169, 1998.
DOI : 10.1137/S0097539794279626

D. Battista, G. Tamassia, and R. , Algorithms for plane representations of acyclic digraphs, Theoretical Computer Science, vol.61, issue.2-3, pp.175-198, 1988.
DOI : 10.1016/0304-3975(88)90123-5

A. Dolati, Digraph embedding on T h, Proc. Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, pp.11-14, 2008.

A. Dolati, Linear Sphericity Testing of 3-Connected Single Source Digraphs, Bulletin of the Iranian Mathematical Society, vol.37, issue.3, pp.291-304, 2011.

A. Dolati and S. M. Hashemi, On the sphericity testing of single source digraphs, Discrete Mathematics, vol.308, issue.11, pp.2175-2181, 2008.
DOI : 10.1016/j.disc.2006.09.053

A. Dolati, S. M. Hashemi, and M. Khosravani, On the Upward Embedding on the Torus, On the Upward Embedding on the Torus, pp.107-121, 2008.
DOI : 10.1216/RMJ-2008-38-1-107

I. S. Filotti, G. L. Miller, and R. J. , On determining the genus of a graph in O(v O(g) ) steps, Proceeding of the 11th Annual Symposium on Theory of Computing, pp.27-37, 1979.

A. Garg and R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, Graph Drawing '94, pp.286-297, 1994.
DOI : 10.1007/3-540-58950-3_384

A. Garg and R. Tamassia, Upward planarity testing, Order, vol.5, issue.4, pp.109-133, 1995.
DOI : 10.4153/CJM-1975-074-0
URL : http://www.cs.brown.edu/cgc/papers/gt-upt-95.ps.gz

S. M. Hashemi and I. Rival, Upward drawings to fit surfaces, Orders, Algorithms , and Applications Lecture Notes in Computer Science, pp.53-58, 1994.
DOI : 10.1007/BFb0019426

S. M. Hashemi, Rival I.: and Kisielewicz A.: The Complexity of Upward Drawings on Spheres, pp.327-363, 1998.

M. Hutton and A. Lubiw, Upward Planar Drawing of Single-Source Acyclic Digraphs, SIAM Journal on Computing, vol.25, issue.2, pp.291-311, 1996.
DOI : 10.1137/S0097539792235906

D. Kelly, Fundamentals of planar ordered sets, Discrete Mathematics, vol.63, issue.2-3, pp.197-216, 1987.
DOI : 10.1016/0012-365X(87)90008-2
URL : https://doi.org/10.1016/0012-365x(87)90008-2

A. Papakostas, Upward planarity testing of outerplanar dags (extended abstract), Graph Drawing '94, pp.298-306, 1994.
DOI : 10.1007/3-540-58950-3_385

C. Thomassen, Planar Acyclic Oriented Graphs. Order, pp.349-361, 1989.
DOI : 10.1007/bf00353654