P. Bose, On embedding an outer-planar graph in a point set, Computational Geometry, vol.23, issue.3, pp.303-312, 2002.
DOI : 10.1016/S0925-7721(01)00069-4

M. Chrobak and H. Karloff, A lower bound on the size of universal sets for planar graphs, ACM SIGACT News, vol.20, issue.4, pp.83-86, 1989.
DOI : 10.1145/74074.74088

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

E. , D. Giacomo, W. Didimo, G. Liotta, and S. K. Wismath, Curve-constrained drawings of planar graphs, Computational Geometry, vol.30, pp.1-23, 2005.

H. Everett, S. Lazard, G. Liotta, and S. Wismath, Universal Sets of n Points for One-bend Drawings of??Planar Graphs with n Vertices, Discrete & Computational Geometry, vol.17, issue.2, pp.272-288, 2010.
DOI : 10.1007/s00454-009-9149-3

URL : https://hal.archives-ouvertes.fr/inria-00431769

P. Gritzmann, B. Mohar, J. Pach, and R. Pollack, E3341, The American Mathematical Monthly, vol.98, issue.2, pp.165-166, 1991.
DOI : 10.2307/2323956

M. Kaufmann and R. Wiese, Embedding Vertices at Points: Few Bends Suffice for Planar Graphs, Journal of Graph Algorithms and Applications, vol.6, issue.1, pp.115-129, 2002.
DOI : 10.7155/jgaa.00046

M. Kurowski, A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs, Information Processing Letters, vol.92, issue.2, pp.95-98, 2004.
DOI : 10.1016/j.ipl.2004.06.009

URL : https://hal.archives-ouvertes.fr/hal-00550171

W. Schnyder, Embedding planar graphs on the grid, Proc. 1st ACM-SIAM Sympos. Discrete Algorithms (SODA'90), pp.138-148, 1990.

J. Valdes, R. E. Tarjan, and E. Lawler, The Recognition of Series Parallel Digraphs, SIAM Journal on Computing, vol.11, issue.2, pp.298-313, 1982.
DOI : 10.1137/0211023