N. Aerts and S. Felsner, Straight line triangle representations, Proceedings of the 21st International Symposium on Graph Drawing (GD), pp.119-130, 2013.
DOI : 10.1007/978-3-319-03841-4_11
URL : http://arxiv.org/abs/1503.06970

N. Alon and E. Scheinerman, Degrees of freedom versus dimension for containment orders, Order, vol.5, issue.1, pp.11-16, 1988.
DOI : 10.1007/BF00143892

A. Asinowski, E. Cohen, M. C. Golumbic, V. Limouzy, M. Lipshteyn et al., Vertex Intersection Graphs of Paths on a Grid, Journal of Graph Algorithms and Applications, vol.16, issue.2, pp.129-150, 2012.
DOI : 10.7155/jgaa.00253

S. Cabello, J. Cardinal, and S. Langerman, The Clique Problem in Ray Intersection Graphs, Discrete & Computational Geometry, vol.108, issue.1???3, pp.771-783, 2013.
DOI : 10.1007/s00454-013-9538-5

J. Chalopin and D. Gonçalves, Every planar graph is the intersection graph of segments in the plane, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.631-638, 2009.
DOI : 10.1145/1536414.1536500
URL : https://hal.archives-ouvertes.fr/lirmm-00395364

S. Chaplick, V. Jelínek, J. Kratochvíl, and T. Vysko?il, Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill, Proceedings of the 38th Graph-Theoretic Concepts in Computer Science (WG), pp.274-285, 2012.
DOI : 10.1007/978-3-642-34611-8_28

S. Chaplick, S. G. Kobourov, and T. Ueckerdt, Equilateral L-Contact Graphs, Proceedings of the 39th Graph-Theoretic Concepts in Computer Science (WG), pp.139-151, 2013.
DOI : 10.1007/978-3-642-45043-3_13
URL : http://arxiv.org/abs/1303.1279

S. Chaplick and T. Ueckerdt, Planar Graphs as VPG-Graphs, Journal of Graph Algorithms and Applications, vol.17, issue.4, pp.475-494, 2013.
DOI : 10.7155/jgaa.00300
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.6738

E. Cohen, M. C. Golumbic, W. T. Trotter, and R. Wang, Posets and VPG Graphs, Order, vol.18, issue.1, 2014.
DOI : 10.1007/s11083-015-9349-9

H. De-fraysseix and P. O. De-mendez, Representations by Contact and Intersection of Segments, Algorithmica, vol.47, issue.4, pp.453-463, 2007.
DOI : 10.1007/s00453-006-0157-x
URL : https://hal.archives-ouvertes.fr/hal-00138575

H. De-fraysseix and P. O. De-mendez, Stretching of Jordan Arc Contact Systems, Discrete Applied Mathematics, vol.155, issue.9, pp.1079-1095, 2007.
DOI : 10.1007/978-3-540-24595-7_7
URL : https://hal.archives-ouvertes.fr/hal-00005644

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

S. Felsner, K. Knauer, G. B. Mertzios, and T. Ueckerdt, Intersection graphs of L-shapes and segments in the plane, Proceedings of the 39th annual symposium on Mathematical Foundations of Computer Science, p.14, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01414991

M. C. Francis, J. Kratochvíl, and T. Vysko?il, Segment representation of a subclass of co-planar graphs, Discrete Mathematics, vol.312, issue.10, pp.3121815-1818, 2012.
DOI : 10.1016/j.disc.2012.01.024
URL : https://hal.archives-ouvertes.fr/lirmm-00807948

M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, 1979.

M. C. Golumbic, M. Lipshteyn, and M. Stern, Edge intersection graphs of single bend paths on a grid, Networks, vol.16, issue.3, pp.130-138, 2009.
DOI : 10.1002/net.20305

M. C. Golumbic, D. Rotem, and J. Urrutia, Comparability graphs and intersection graphs, Discrete Mathematics, vol.43, issue.1, pp.37-46, 1983.
DOI : 10.1016/0012-365X(83)90019-5
URL : http://doi.org/10.1016/0012-365x(83)90019-5

A. Gyárfás, Problems from the world surrounding perfect graphs, Zastos. Mat, vol.19, issue.3-4, pp.413-441, 1987.

D. Heldt, K. Knauer, and T. Ueckerdt, Edge-intersection graphs of grid paths: The bend-number, Discrete Applied Mathematics, vol.167, pp.144-162, 2014.
DOI : 10.1016/j.dam.2013.10.035
URL : https://hal.archives-ouvertes.fr/hal-01457989

S. G. Kobourov, T. Ueckerdt, and K. Verbeek, Combinatorial and Geometric Properties of Planar Laman Graphs, SODA, pp.1668-1678, 2013.
DOI : 10.1137/1.9781611973105.120

J. Kratochvíl and A. Kub?na, On intersection representations of co-planar graphs, Discrete Mathematics, vol.178, issue.1-3, pp.251-255, 1998.
DOI : 10.1016/S0012-365X(97)81834-1

J. Kratochvíl and J. Matousek, Intersection Graphs of Segments, Journal of Combinatorial Theory, Series B, vol.62, issue.2, pp.289-315, 1994.
DOI : 10.1006/jctb.1994.1071

F. Luccio, S. Mazzone, and C. K. Wong, A note on visibility graphs, Discrete Mathematics, vol.64, issue.2-3, pp.209-219, 1987.
DOI : 10.1016/0012-365X(87)90190-7
URL : http://doi.org/10.1016/0012-365x(87)90190-7

M. Middendorf and F. Pfeiffer, The max clique problem in classes of string-graphs. Discrete mathematics, pp.365-372, 1992.

A. Pawlik, J. Kozik, T. Krawczyk, M. Laso´nlaso´n, P. Micek et al., Triangle-free intersection graphs of line segments with large chromatic number, Journal of Combinatorial Theory, Series B, vol.105, 2013.
DOI : 10.1016/j.jctb.2013.11.001

E. R. Scheinerman, Intersection classes and multiple intersection parameters of graphs, 1984.

H. E. Warren, Lower bounds for approximation by nonlinear manifolds, Transactions of the American Mathematical Society, vol.133, issue.1, pp.167-178, 1968.
DOI : 10.1090/S0002-9947-1968-0226281-1