F. [. Biedl and . Brandenburg, Drawing planar bipartite graphs with small area, Canadian Conference on Computational Geometry (CCCG '05), pp.105-108, 2005.

. Bcd-+-94-]-p, R. F. Bertolazzi, G. Cohen, R. Di-battista, I. G. Tamassia et al., How to draw a series-parallel digraph, International Journal of Computational Geometry & Applications, vol.4, issue.4, pp.385-402, 1994.

T. C. Biedl, T. M. Chan, and A. López-ortiz, Drawing K2,n: A lower bound, Canadian Conference on Computational Geometry (CCCG '02), pp.146-148, 2002.
DOI : 10.1016/S0020-0190(02)00433-7

T. [. Biedl, A. Chan, and . López-ortiz, Drawing K2,n: A lower bound, Information Processing Letters, vol.85, issue.6, pp.303-305, 2003.
DOI : 10.1016/S0020-0190(02)00433-7

]. T. Bie02 and . Biedl, Drawing outer-planar graphs in O(n log n) area, Graph Drawing (GD '02), volume 2528 of LNCS, pp.54-65, 2002.

]. T. Bie05 and . Biedl, Small poly-line drawings of series-parallel graphs, Canada, 2005.

]. T. Bie10 and . Biedl, On small drawings of series-parallel graphs and other subclasses of planar graphs, Graph Drawing (GD '09), pp.280-291, 2010.

]. A. Bro60 and . Brocot, Calcul des rouages par approximation, nouvelle methode, Revue Chronometrique, vol.6, pp.186-194, 1860.

G. [. Crescenzi, A. Battista, and . Piperno, A note on optimal area algorithms for upward drawings of binary trees, Computational Geometry, vol.2, issue.4, pp.187-200, 1992.
DOI : 10.1016/0925-7721(92)90021-J

S. [. Chrobak and . Nakano, Minimum-width grid drawings of plane graphs, Computational Geometry, vol.11, issue.1, pp.29-54, 1998.
DOI : 10.1016/S0925-7721(98)00016-9

[. Giacomo, W. Didimo, G. Liotta, and S. K. Wismath, Book Embeddability of Series???Parallel Digraphs, Algorithmica, vol.45, issue.4, pp.531-547, 2006.
DOI : 10.1007/s00453-005-1185-7

[. Battista and F. Frati, Small Area Drawings of Outerplanar Graphs, Algorithmica, vol.30, issue.2, pp.25-53, 2009.
DOI : 10.1007/s00453-007-9117-3

E. and D. Giacomo, Drawing Series-Parallel Graphs on Restricted Integer 3D Grids, Graph Drawing (GD '03), pp.238-246, 2003.
DOI : 10.1007/978-3-540-24595-7_22

T. [. Dolev, H. Leighton, and . Trickey, Planar embeddings of planar graphs, Advances in Computing Research, pp.147-161, 1984.

]. H. De-fraysseix, J. Pach, and R. Pollack, How to draw a planar graph on a grid, Combinatorica, vol.13, issue.1, pp.41-51, 1990.
DOI : 10.1007/BF02122694

]. D. Epp92 and . Eppstein, Parallel recognition of series-parallel graphs, Information and Computation, vol.98, issue.1, pp.41-55, 1992.

G. [. Felsner, S. K. Liotta, and . Wismath, Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions, Journal of Graph Algorithms and Applications, vol.7, issue.4, pp.363-398, 2003.
DOI : 10.7155/jgaa.00075

]. F. Fra07 and . Frati, Straight-line drawings of outerplanar graphs in O(dn log n) area, Canadian Conference on Computational Geometry (CCCG '07), pp.225-228, 2007.

]. F. Fra08 and . Frati, A lower bound on the area requirements of series-parallel graphs, Graph Theoretic Concepts in Computer Science (WG '08), pp.159-170, 2008.

M. [. Garg, R. Goodrich, and . Tamassia, PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA, International Journal of Computational Geometry & Applications, vol.06, issue.03, pp.333-356, 1996.
DOI : 10.1142/S0218195996000228

A. [. Garg, V. Rusu, M. L. Kumar, C. J. Gavrilova, P. L. Tan et al., Straight-Line Drawings of General Trees with Linear Area and Arbitrary Aspect Ratio, International Conference on Computational Science and its Applications (ICCSA '03)He97] X. He. Grid embedding of 4-connected plane graphs. Discrete & Computational Geometry, pp.876-885339, 1997.
DOI : 10.1007/3-540-44842-X_89

]. K. Kur30 and . Kuratowski, Sur leprobì eme des courbes gauches en topologie, Fund. Math, vol.15, pp.271-283, 1930.

K. Miura, S. Nakano, and T. Nishizeki, Grid Drawings of 4-Connected Plane Graphs, Discrete & Computational Geometry, vol.26, issue.1, pp.73-87, 2001.
DOI : 10.1007/s00454-001-0004-4

]. M. Ste58 and . Stern, Ueber eine zahlentheoretische funktion, Journal fur die reine und angewandte Mathematik, pp.193-220, 1858.

]. M. Sud04 and . Suderman, Pathwidth and layered drawings of trees, International Journal of Computational Geometry & Applications, vol.14, issue.3, pp.203-225, 2004.

. J. Vtl82, R. E. Valdes, E. L. Tarjan, and . Lawler, The recognition of series parallel digraphs, SIAM Journal on Computing, vol.11, issue.2, pp.298-313, 1982.

]. K. Wag37 and . Wagner, Uber eine eigenschaft der ebenen komplexe, Mathematische Annalen, vol.114, pp.570-590, 1937.

T. [. Zhou, T. Hikino, and . Nishizeki, Small Grid Drawings of Planar Graphs with Balanced Bipartition, Algorithms and Computation (WALCOM '10), pp.47-57, 2010.
DOI : 10.1007/978-3-642-11440-3_5