T. Aichholzer, B. Hackl, C. Vogtenhuber, F. Huemer, H. Hurtado et al., On the Number of Plane Geometric Graphs, Graphs and Combinatorics, vol.23, issue.S1, pp.67-84, 2007.
DOI : 10.1007/s00373-007-0704-5

V. Ajtai, M. Chvátal, E. Newborn, and . Szemerédi, Crossing-Free Subgraphs, Annals Discrete Math, vol.12, pp.9-12, 1982.
DOI : 10.1016/S0304-0208(08)73484-4

M. Beame, J. Saks, and . Thathachar, Time-space tradeoffs for branching programs, Proc. 39th Annual Symposium on Foundations of Computer Science, pp.254-263, 1998.

C. Buchin, K. Knauer, A. Kriegel, R. Schulz, and . Seidel, On the Number of Cycles in Planar Graphs, Proc. 13th COCOON, pp.97-107, 2007.
DOI : 10.1007/978-3-540-73545-8_12

A. Buchin and . Schulz, On the Number of Spanning Trees a Planar Graph Can Have, Proc. 18th European Symposium on Algorithms, pp.110-121, 2010.
DOI : 10.1007/978-3-642-15775-2_10

. Dumitrescu, On two lower bound constructions, Proc. 11th Canadian Conf. on Computational Geometry, pp.111-114, 1999.

. Dumitrescu, On the maximum multiplicity of some extreme geometric configurations in the plane, Geombinatorics, vol.12, issue.1, pp.5-14, 2002.

R. Dumitrescu and . Kaye, Matching colored points in the plane: Some new results, Computational Geometry, vol.19, issue.1, pp.69-85, 2001.
DOI : 10.1016/S0925-7721(01)00007-4

A. Dumitrescu, A. Schulz, C. D. Sheffer, and . Tóth, Bounds on the Maximum Multiplicity of Some Common Geometric Graphs, SIAM Journal on Discrete Mathematics, vol.27, issue.2
DOI : 10.1137/110849407
URL : https://hal.archives-ouvertes.fr/hal-00573645

W. Dumitrescu and . Steiger, On a matching problem in the plane, Discrete Mathematics, vol.211, issue.1-3, pp.183-195, 2000.
DOI : 10.1016/S0012-365X(99)00201-0

M. Flajolet and . Noy, Analytic combinatorics of non-crossing configurations, Discrete Mathematics, vol.204, issue.1-3, pp.203-229, 1999.
DOI : 10.1016/S0012-365X(98)00372-0
URL : https://hal.archives-ouvertes.fr/inria-00073493

M. García, A. Noy, and . Tejel, Lower bounds on the number of crossing-free subgraphs of KN, Computational Geometry, vol.16, issue.4, pp.211-221, 2000.
DOI : 10.1016/S0925-7721(00)00010-9

M. Hoffmann, A. Sharir, C. Sheffer, E. Tóth, and . Welzl, Counting plane graphs: flippability and its applications, 2010.

M. Hurtado and . Noy, Counting triangulations of almost-convex polygons, Ars Combinatoria, vol.45, pp.169-179, 1997.

W. O. Newborn and . Moser, Optimal crossing-free Hamiltonian circuit drawings of Kn, Journal of Combinatorial Theory, Series B, vol.29, issue.1, pp.13-26, 1980.
DOI : 10.1016/0095-8956(80)90041-6

J. Razen, E. Snoeyink, and . Welzl, Number of Crossing-Free Geometric Graphs vs. Triangulations, Electronic Notes in Discrete Mathematics, vol.31, pp.195-200, 2008.
DOI : 10.1016/j.endm.2008.06.039

S. and R. Seidel, A better upper bound on the number of triangulations of a planar point set, Journal of Combinatorial Theory Ser. A, vol.102, issue.1, pp.186-193, 2003.

E. Sharir and . Welzl, On the Number of Crossing???Free Matchings, Cycles, and Partitions, SIAM Journal on Computing, vol.36, issue.3, pp.695-720, 2006.
DOI : 10.1137/050636036

E. Sharir and . Welzl, Random triangulations of point sets, Proc. 22nd Annual ACM- SIAM Symposium on Computational Geometry, pp.273-281, 2006.

A. Sharir and . Sheffer, Counting triangulations of planar point sets, manuscript 2010, arxiv.org/abs/0911