F. Bernhart and P. C. Kainen, The book thickness of a graph, J. Combin. Theory, Ser. B, vol.27, pp.320-331, 1979.

P. Braß, E. Cenek, C. A. Duncan, A. Efrat, C. Erten et al., On simultaneous planar graph embeddings, Computational Geometry: Theory and Applications, vol.36, issue.2, pp.117-130, 2007.

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, How to draw a planar graph on a grid, Combinatorica, vol.10, pp.41-51, 1990.

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

H. Enomoto and M. S. Miyauchi, Embedding graphs into a three page book with o(m log n) crossings of edges over the spine, SIAM Journal on Discrete Mathematics, vol.12, issue.3, pp.337-341, 1999.

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.

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

J. Pach and R. Wenger, Embedding planar graphs at fixed vertex locations, Graph and Combinatorics, vol.17, pp.717-728, 2001.
DOI : 10.1007/3-540-37623-2_20
URL : https://link.springer.com/content/pdf/10.1007%2F3-540-37623-2_20.pdf

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