K. Pankaj, N. H. Agarwal, and . Mustafa, Independent set of intersection graphs of convex objects in 2D, Comput. Geom, vol.34, issue.2, pp.83-95, 2006.

M. J. Aschner, G. Katz, Y. Morgenstern, and . Yuditsky, Approximation Schemes for Covering and Packing, Proceedings of the 7th International Workshop on Algorithms and Computation (WALCOM), pp.89-100, 2013.
DOI : 10.1007/978-3-642-36065-7_10
URL : http://arxiv.org/pdf/1209.5199.pdf

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.607-624, 2017.
DOI : 10.1145/258533.258641
URL : https://hal.archives-ouvertes.fr/hal-01468685

N. Bus, N. H. Mustafa, and S. Ray, Geometric Hitting Sets for Disks: Theory and Practice, Proceedings of the 23rd Annual European Symposium on Algorithms (ESA), pp.903-914, 2015.
DOI : 10.1007/s00454-010-9285-9
URL : https://hal.archives-ouvertes.fr/hal-01188987

S. Cabello and D. Gajser, Simple PTAS???s for families of graphs excluding a minor, Discrete Applied Mathematics, vol.189, pp.41-48, 2015.
DOI : 10.1016/j.dam.2015.03.004

T. M. Chan, Polynomial-time approximation schemes for packing and piercing fat objects, Journal of Algorithms, vol.46, issue.2, pp.178-189, 2003.
DOI : 10.1016/S0196-6774(02)00294-8
URL : http://www.cs.uwaterloo.ca/~tmchan/fat_draft.ps.gz

M. Timothy, E. Chan, and . Grant, Exact algorithms and APX-hardness results for geometric packing and covering problems, Comput. Geom, vol.47, issue.2, pp.112-124, 2014.

M. Timothy, S. Chan, and . Har-peled, Approximation algorithms for maximum independent set of pseudo-disks, Discrete & Computational Geometry, vol.48, issue.2, pp.373-392, 2012.

R. Fraser, Algorithms for Geometric Covering and Piercing Problems, 2012.

G. Gibson, E. Kanade, K. R. Krohn, and . Varadarajan, Guarding terrains via local search, JoCG, vol.5, issue.1, pp.168-178, 2014.

M. Gibson and I. A. Pirwani, Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier, Proceedings of the 18th Annual European Symposium on Algorithms (ESA), pp.243-254, 2010.
DOI : 10.1007/978-3-642-15775-2_21

R. 12-sathish-govindarajan, S. Raman, A. Ray, and R. Basu, Packing and covering with non-piercing regions, Proceedings of the 22nd Annual European Symposium on Algorithms (ESA), pp.1-4717, 2016.

D. Marx, Efficient Approximation Schemes for Geometric Problems?, Proceedings of the 13th Annual European Symposium on Algorithms (ESA), pp.448-459, 2005.
DOI : 10.1007/11561071_41

D. Marx, Parameterized Complexity of Independence and Domination on Geometric Graphs, Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC), pp.154-165, 2006.
DOI : 10.1007/11847250_14

H. Nabil, R. Mustafa, S. Raman, and . Ray, Quasi-polynomial time approximation scheme for weighted geometric set cover on pseudodisks and halfspaces, SIAM J. Comput, vol.44, issue.6, pp.1650-1669, 2015.

H. Nabil, S. Mustafa, and . Ray, Improved results on geometric hitting set problems, Discrete & Computational Geometry, vol.44, issue.4, pp.883-895, 2010.

H. Mustafa and K. Varadarajan, Epsilon-approximations and Epsilon-nets, Handbook of Discrete and Computational Geometry, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01468664

R. Radoi?i? and G. Tóth, The discharging method in combinatorial geometry and the Pach-Sharir conjecture, Contemporary Mathematics: Surveys on Discrete and Computational Geometry, pp.319-342, 2008.
DOI : 10.1090/conm/453/08806