T. Achterberg, SCIP: solving constraint integer programs, Mathematical Programming Computation, vol.29, issue.2, pp.1-41, 0340.
DOI : 10.1287/ijoc.6.4.445
URL : http://mpc.zib.de/index.php/MPC/article/viewFile/4/6/

P. K. Agarwal, Range Searching, Handbook of Discrete and Computational Geometry, 2017.
DOI : 10.1201/9781420035315.ch36

P. K. Agarwal and N. H. Mustafa, Independent set of intersection graphs of convex objects in 2D, Computational Geometry, vol.34, issue.2, pp.83-95, 2006.
DOI : 10.1016/j.comgeo.2005.12.001
URL : http://suraj.lums.edu.pk/~nabil/Research/Papers/indset.ps

P. K. Agarwal and J. Pan, Near-Linear Algorithms for Geometric Hitting Sets and Set Covers, Annual Symposium on Computational Geometry, SOCG'14, p.271, 2014.
DOI : 10.1145/2582112.2582152

H. Brönnimann and M. T. Goodrich, Almost optimal set covers in finite VC-dimension, Discrete & Computational Geometry, vol.16, issue.2, pp.463-479, 1995.
DOI : 10.1145/73393.73397

N. Bus, S. Garg, N. H. Mustafa, and S. Ray, Tighter estimates for -nets for disks
DOI : 10.1016/j.comgeo.2015.12.002
URL : https://hal.archives-ouvertes.fr/hal-01345860

N. Bus, S. Garg, N. H. Mustafa, and S. Ray, Limits of Local Search: Quality and Efficiency, Discrete & Computational Geometry, vol.30, issue.3, pp.1-18, 2017.
DOI : 10.1145/258533.258641
URL : https://hal.archives-ouvertes.fr/hal-01468685

T. M. Chan and S. Har-peled, Approximation Algorithms for Maximum Independent Set of Pseudo-Disks, Discrete & Computational Geometry, vol.2, issue.3, pp.373-392
DOI : 10.1145/1542362.1542367
URL : http://arxiv.org/pdf/1103.1431

G. Even, D. Rawitz, and S. Shahar, Hitting sets when the VC-dimension is small, Information Processing Letters, vol.95, issue.2, pp.358-362, 2005.
DOI : 10.1016/j.ipl.2005.03.010

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness [14] D. Haussler and E. Welzl. Epsilon-nets and simplex range queries, Discrete Comput. Geom, vol.2, pp.360127-151, 1979.

D. S. Hochbaum and W. Maass, Fast approximation algorithms for a nonconvex covering problem, Journal of Algorithms, vol.8, issue.3, pp.305-323, 1987.
DOI : 10.1016/0196-6774(87)90012-5

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

J. Komlós, J. Pach, and G. J. Woeginger, Almost tight bounds for??-Nets, Discrete & Computational Geometry, vol.16, issue.2, pp.163-173, 1992.
DOI : 10.1137/1116025

A. Kupavskii, N. H. Mustafa, and J. Pach, Near-optimal lower bounds for epsilon- 370 nets for half-spaces and low complexity set systems, 2017.
DOI : 10.1007/978-3-319-44479-6_21

N. H. Mustafa, K. Dutta, and A. Ghosh, Improved Results on Geometric Hitting Set Problems, Discrete & Computational Geometry, vol.8, issue.3, pp.883-895, 2010.
DOI : 10.1002/9781118033203
URL : http://www.mpi-sb.mpg.de/%7Esaurabh/Papers/Hitting-Sets.pdf

N. H. Mustafa, K. Varadarajan, E. Pyrga, and S. Ray, Epsilon-approximations and epsilon-nets New existence proofs for epsilon-nets, Handbook of Discrete and Computational Geometry Proceedings of Symposium on Computational Geometry, pp.199-207, 2008.

R. Raz and M. Safra, A sub-constant error-probability low-degree test, and a subconstant error-probability PCP characterization of NP, Proceedings of STOC, pp.475-484, 1997.

R. Wunderling, Paralleler und objektorientierter Simplex-Algorithmus, 1996.