M. Kurowski, A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs, Inf. Process. Lett, vol.92, issue.2, pp.95-98, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00550171

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

H. De-fraysseix, J. Pach, and R. Pollack, Combinatorica, vol.10, pp.41-51, 1990.

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

P. Gritzmann, B. Mohar, J. Pach, and R. Pollack, Embedding a planar triangulation with vertices at specified points, Amer. Math. Monthly, vol.98, issue.2, pp.165-166, 1991.

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.

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 and Computational Geometry, vol.43, issue.2, pp.272-288, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00431769

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.

P. Bose, On embedding an outer-planar graph on a point set, Computational Geometry: Theory and Applications, vol.23, pp.303-312, 2002.

G. D. Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing, 1999.

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

G. D. Battista, G. Liotta, and F. Vargiu, Spirality and optimal orthogonal drawings, SIAM J. Comput, vol.27, issue.6, pp.1764-1811, 1998.

P. Braß, E. Cenek, C. A. Duncan, A. Efrat, C. Erten et al., On simultaneous planar graph embeddings, Comput. Geom, vol.36, issue.2, pp.117-130, 2007.