P. Afshani, E. Berglin, I. Van-duijn, and J. S. Nielsen, Applications of Incidence Bounds in Point Covering Problems, SoCG, pp.1-6015, 2016.

P. Alimonti and V. Kann, Some APX-completeness results for cubic graphs, Theoretical Computer Science, vol.237, issue.1-2, pp.123-134, 2000.
DOI : 10.1016/S0304-3975(98)00158-3
URL : https://doi.org/10.1016/s0304-3975(98)00158-3

P. Ashok, S. Kolay, N. Misra, and S. Saurabh, Unique Covering Problems with Geometric Sets, COCOON, pp.548-558, 2015.
DOI : 10.1007/978-3-319-21398-9_43

P. Ashok, S. Kolay, and S. Saurabh, Multivariate Complexity Analysis of Geometric Red Blue Set Cover, Algorithmica, vol.36, issue.1, pp.1-31, 2015.
DOI : 10.1016/0095-8956(84)90013-3

J. Boissonnat, K. Dutta, A. Ghosh, and S. Kolay, Kernelization of the subset general position problem in geometry, MFCS, pp.1-2513, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01583101

K. Bringmann, L. Kozma, S. Moran, and N. S. Narayanaswamy, Hitting set for hypergraphs of low VC-dimension, ESA, pp.1-2318, 2016.

M. Pilipczuk and S. Saurabh, Parameterized Algorithms, 2015.

H. Dell and D. Van-melkebeek, Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses, STOC, pp.251-260, 2010.
DOI : 10.1145/1806689.1806725

I. Dinur and D. Steurer, Analytical approach to parallel repetition, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC '14, pp.624-633, 2014.
DOI : 10.1007/978-3-642-15369-3_54

M. Dom, M. R. Fellows, and F. A. , Parameterized Complexity of Stabbing Rectangles and Squares in the Plane, In WALCOM, vol.40, issue.2, pp.298-309, 2009.
DOI : 10.1007/s00224-005-1273-8

R. G. Downey and M. R. Fellows, Parameterized Complexity, 1999.
DOI : 10.1007/978-1-4612-0515-9

J. Flum and M. Grohe, Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series), 2006.

P. Giannopoulos, C. Knauer, and S. Whitesides, Parameterized Complexity of Geometric Problems, The Computer Journal, vol.51, issue.3, pp.372-384, 2008.
DOI : 10.1093/comjnl/bxm053
URL : http://comjnl.oxfordjournals.org/cgi/reprint/bxm053v1.pdf

P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh, Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization, Information and Computation, vol.231, pp.109-116, 2013.
DOI : 10.1016/j.ic.2013.08.007

R. M. Karp, Reducibility among combinatorial problems In 50 Years of Integer Programming 1958-2008 -From the Early Years to the State-of-the-Art, pp.219-241, 2010.

S. Kratsch, G. Philip, and S. Ray, Point Line Cover, ACM Transactions on Algorithms, vol.12, issue.3, p.40, 2016.
DOI : 10.1016/0304-3975(83)90020-8

S. Langerman and P. Morin, Covering things with things, DCG, vol.33, issue.4, pp.717-729, 2005.

J. Matou?ek, Lectures on Discrete Geometry, 2002.
DOI : 10.1007/978-1-4613-0039-7

N. Megiddo and A. Tamir, On the complexity of locating linear facilities in the plane, Operations Research Letters, vol.1, issue.5, pp.194-197, 1982.
DOI : 10.1016/0167-6377(82)90039-6

V. V. Vazirani, Approximation Algorithms, 2013.
DOI : 10.1007/978-3-662-04565-7