P. Afshani and T. M. Chan, Approximation algorithms for maximum cliques in 3d unit-disk graphs, Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG'05, pp.19-22, 2005.

P. Afshani and H. Hatami, Approximation and inapproximability results for maximum clique of disc graphs in high dimensions, Inf. Process. Lett, vol.105, issue.3, pp.83-87, 2008.

J. Alber and J. Fiala, Geometric separation and exact solutions for the parameterized independent set problem on disk graphs, J. Algorithms, vol.52, issue.2, pp.134-151, 2004.
DOI : 10.1016/j.jalgor.2003.10.001

N. Alon, R. Yuster, and U. Zwick, Finding and counting given length cycles, Algorithmica, vol.17, issue.3, pp.209-223, 1997.
DOI : 10.1007/bfb0049422
URL : http://www.math.tau.ac.il/~nogaa/PDFS/ayz4.pdf

C. Ambühl and U. Wagner, The Clique Problem in Intersection Graphs of Ellipses and Triangles, Theory Comput. Syst, vol.38, issue.3, pp.279-292, 2005.

J. Bang-jensen, B. Reed, M. Schacht, R. ?ámal, B. Toft et al., On six problems posed by Jarik Ne?et?il, Topics in Discrete Mathematics, pp.613-627, 2006.

C. Biró, É. Bonnet, D. Marx, T. Miltzow, and P. Rz??ewski, Fine-grained complexity of coloring unit disks and balls, 33rd International Symposium on Computational Geometry, vol.18, p.16, 2017.

A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Learnability and the vapnik-chervonenkis dimension, J. ACM, vol.36, issue.4, pp.929-965, 1989.

A. Bock, Y. Faenza, C. Moldenhauer, and A. J. Ruiz-vargas, Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, pp.187-198, 2014.

É. Bonnet, P. Giannopoulos, E. J. Kim, P. Rz??ewski, and F. Sikora, QPTAS and subexponential algorithm for maximum clique on disk
URL : https://hal.archives-ouvertes.fr/hal-01991635

N. Bousquet, A. Lagoutte, Z. Li, A. Parreau, and S. Thomassé, Identifying codes in hereditary classes of graphs and vc-dimension, SIAM J. Discrete Math, vol.29, issue.4, pp.2047-2064, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01038012

A. Brandstädt, V. B. Le, and J. P. Spinrad, Graph classes: a survey. SIAM, 1999.

H. Breu and D. G. Kirkpatrick, Unit disk graph recognition is NP-hard, Comput. Geom, vol.9, issue.1-2, pp.3-24, 1998.

S. Cabello, Maximum clique for disks of two sizes. Open problems from Geometric Intersection Graphs: Problems and Directions CG Week Workshop, p.2015, 2015.

S. Cabello, Open problems presented at the Algorithmic Graph Theory on the Adriatic Coast workshop, 2015.

T. M. Chan, Polynomial-time approximation schemes for packing and piercing fat objects, J. Algorithms, vol.46, issue.2, pp.178-189, 2003.

B. N. Clark, C. J. Colbourn, and D. S. Johnson, Unit disk graphs, Discrete Mathematics, vol.86, issue.1-3, pp.165-177, 1990.

L. Danzer, Zur lösung des gallaischen problems über kreisscheiben in der euklidischen ebene, Studia Sci. Math. Hungar, vol.21, issue.1-2, pp.111-134, 1986.

T. Erlebach, K. Jansen, and E. Seidel, Polynomial-time approximation schemes for geometric intersection graphs, SIAM J. Comput, vol.34, issue.6, p.17, 2005.

A. V. Fishkin, Disk graphs: A short survey, Approximation and Online Algorithms, First International Workshop, WAOA 2003, vol.2909, pp.260-264, 2003.

M. Gibson and I. A. Pirwani, Algorithms for dominating set in disk graphs: Breaking the logn barrier-(extended abstract), Algorithms-ESA 2010, 18th Annual European Symposium, pp.243-254, 2010.

S. Har-peled, H. Kaplan, W. Mulzer, L. Roditty, P. Seiferth et al., Stabbing pairwise intersecting disks by five points, 2018.

D. Haussler and E. Welzl, Epsilon-nets and simplex range queries, pp.61-71, 1986.

R. J. Kang and T. Müller, Sphere and Dot Product Representations of Graphs, Discrete & Computational Geometry, vol.47, issue.3, pp.548-568, 2012.

P. Koebe, Kontaktprobleme der konformen Abbildung. Hirzel, 1936.

D. Marx and M. Pilipczuk, Optimal parameterized algorithms for planar facility location problems using voronoi diagrams, Algorithms-ESA 2015-23rd Annual European Symposium, pp.865-877, 2015.

T. A. Mckee and F. R. Mcmorris, Topics in intersection graph theory, 1999.

T. Nieberg and J. Hurink, A PTAS for the minimum dominating set problem in unit disk graphs, Approximation and Online Algorithms, Third International Workshop, WAOA 2005, pp.296-306, 2005.

T. Nieberg, J. Hurink, and W. Kern, A robust PTAS for maximum weight independent sets in unit disk graphs, Graph-Theoretic Concepts in Computer Science, 30th International Workshop, pp.214-221, 2004.

V. Raghavan and J. P. Spinrad, Robust algorithms for restricted domains, J. Algorithms, vol.48, issue.1, pp.160-172, 2003.

W. D. Smith and N. C. Wormald, Geometric separator theorems & applications, 39th Annual Symposium on Foundations of Computer Science, FOCS '98, pp.232-243, 1998.

L. Stachó, A solution of gallai's problem on pinning down circles, Mat. Lapok, vol.32, issue.13, pp.19-47, 1981.

E. J. Van-leeuwen, Better approximation schemes for disk graphs, Algorithm TheorySWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, pp.316-327, 2006.

E. J. Van-leeuwen, Optimization and Approximation on Systems of Geometric Objects, 2009.

V. N. Vapnik and A. Y. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Measures of complexity, pp.11-30, 2015.