M. Ajtai, The shortest vector problem in L2 is NP-hard for randomized reductions, Proc. of the 30th annual ACM Symposium on Theory of Computing (STOC'98, pp.10-19, 1998.

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

V. S. Kumar, S. Arya, and H. Ramesh, Hardness of Set Cover with intersection 1, Proc. of the 27th International Colloquium on Automata, Languages and Programming (ICALP'00), vol.1853, pp.624-635, 2000.

G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-spaccamela et al., Complexity and approximation, 1999.

A. Badanidiyuru, R. Kleinberg, and H. Lee, Approximating low-dimensional coverage problems, Proc. of the 28th annual symposium on Computational geometry, pp.161-170, 2012.
DOI : 10.1145/2261250.2261274
URL : http://arxiv.org/pdf/1112.0689.pdf

B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM, vol.41, issue.1, pp.153-180, 1994.
DOI : 10.1109/sfcs.1983.7

C. Bazgan, M. Chopin, A. Nichterlein, and F. Sikora, Parameterized approximability of maximizing the spread of influence in networks, Journal of Discrete Algorithms, vol.27, pp.54-65, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01366676

C. Bazgan, F. Foucaud, and F. Sikora, On the Approximability of Partial VC Dimension, Proc. 10th International Conference on Combinatorial Optimization and Applications (COCOA'16), vol.10043, pp.92-106, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01431728

A. Bhaskara, M. Charikar, E. Chlamtac, U. Feige, and A. Vijayaraghavan, Detecting high log-densities: an O(n 1/4 ) approximation for densest k-subgraph, Proc. of the 42nd annual ACM Symposium on Theory of Computing (STOC'10, pp.201-210, 2010.

H. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, vol.209, issue.12, pp.1-45, 1998.

B. Bollobás and A. D. Scott, On separating systems, European Journal of Combinatorics, vol.28, pp.1068-1071, 2007.

J. A. Bondy, Induced subsets, Journal of Combinatorial Theory, Series B, vol.12, issue.2, pp.201-202, 1972.
DOI : 10.1016/0095-8956(72)90025-1
URL : https://doi.org/10.1016/0095-8956(72)90025-1

N. Bousquet, Hitting sets: VC-dimension and Multicut, 2013.

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

N. Bousquet and S. Thomassé, VC-dimension and Erd?s-Pósa property of graphs, Discrete Mathematics, vol.338, issue.12, pp.2302-2317, 2015.

K. Bringmann, L. Kozma, S. Moran, and N. S. Narayanaswamy, Hitting Set in hypergraphs of low VC-dimension, Proc. of the 24th Annual European Symposium on Algorithms (ESA'16), vol.57, pp.1-23, 2016.

M. Bruglieri, M. Ehrgott, H. W. Hamacher, and F. Maffioli, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, Discrete Applied Mathematics, vol.154, issue.9, pp.1344-1357, 2006.

L. Cai, Parameterized complexity of cardinality constrained optimization problems, The Computer Journal, vol.51, issue.1, pp.102-121, 2007.

L. Cai, S. M. Chan, and S. O. Chan, Random Separation: a new method for solving fixed-cardinality optimization problems, Proc. of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC'06), vol.4169, pp.239-250, 2006.

L. Cai, D. Juedes, and I. Kanj, The inapproximability of non-NP-hard optimization problems, Theoretical Computer Science, vol.289, issue.1, pp.553-571, 2002.

B. Caskurlu, V. Mkrtchyan, O. Parekh, and K. Subramani, On partial vertex cover and budgeted maximum coverage problems in bipartite graphs, Proc. of the 8th IFIP International Conference on Theoretical Computer Science (IFIP TCS'14), vol.8705, pp.13-26, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01402014

E. Charbit, I. Charon, G. Cohen, O. Hudry, and A. Lobstein, Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. Advances in Mathematics of Communications, vol.2, issue.4, pp.403-420, 2008.

J. Chen, X. Huang, I. A. Kanj, and G. Xia, On the computational hardness based on linear FPT-reductions, Journal of Combinatorial Optimization, vol.11, issue.2, pp.231-247, 2006.

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
URL : https://hal.archives-ouvertes.fr/hal-00353765

B. Courcelle, J. A. Makowsky, and U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems, vol.33, pp.125-150, 2000.

R. Crowston, G. Gutin, M. Jones, G. Muciaccia, and A. Yeo, Parameterizations of test cover with bounded test sizes, Algorithmica, vol.74, issue.1, pp.367-384, 2016.

R. Crowston, G. Gutin, M. Jones, S. Saurabh, and A. Yeo, Parameterized study of the test cover problem, Proc. of the 37th International Symposyium on Mathematical Foundations of Computer Science (MFCS'12), vol.7464, pp.283-295, 2012.

K. M. De-bontridder, B. V. Halldórsson, M. M. Halldórsson, C. A. Hurkens, J. K. Lenstra et al., Approximation algorithms for the test cover problem, Mathematical Programming Series B, vol.98, pp.477-491, 2003.

E. D. Demaine and M. Hajiaghayi, Bidimensionality: New connections between FPT algorithms and PTASs, Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005, pp.590-601, 2005.

R. G. Downey, P. A. Evans, and M. R. Fellows, Parameterized learning complexity. Proc. of the 6th annual conference on Computational learning theory (COLT'93), pp.51-57, 1993.

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized Complexity, 2013.

U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, pp.634-652, 1998.

J. Flum and M. Grohe, Parameterized Complexity Theory, 2006.

F. V. Fomin, D. Lokshtanov, V. Raman, and S. Saurabh, Subexponential algorithms for partial cover problems, Information Processing Letters, vol.111, issue.16, pp.814-818, 2011.
DOI : 10.1016/j.ipl.2011.05.016
URL : https://bora.uib.no/bitstream/1956/12033/2/09005.FominFedor.2318.pdf

F. Foucaud, Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes, Journal of Discrete Algorithms, vol.31, pp.48-68, 2015.
DOI : 10.1016/j.jda.2014.08.004
URL : https://hal.archives-ouvertes.fr/hal-00923356

F. Foucaud, G. B. Mertzios, R. Naserasr, A. Parreau, and P. Valicov, Identification, location-domination and metric dimension on interval and permutation graphs, II. Algorithms and complexity. Algorithmica
DOI : 10.1016/j.tcs.2017.01.006
URL : https://hal.archives-ouvertes.fr/hal-01198784

M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, 1979.

M. A. Henning and A. Yeo, Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs, Graphs and Combinatorics, vol.30, issue.4, pp.909-932, 2014.
DOI : 10.1007/s00373-013-1311-2

M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, On a new class of codes for identifying vertices in graphs, IEEE Transactions on Information Theory, vol.44, pp.599-611, 1998.

S. Khot, Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique, SIAM Journal on Computing, vol.36, issue.4, pp.1025-1071, 2006.
DOI : 10.1109/focs.2004.59

J. Kneis, D. Mölle, and P. Rossmanith, Partial vs. complete domination: t-dominating set, Proc. of the 33nd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07), vol.4362, pp.367-376, 2007.

E. Kranakis, D. Krizanc, B. Ruf, J. Urrutia, and G. J. Woeginger, The VC-dimension of set systems defined by graphs, Discrete Applied Mathematics, vol.77, issue.3, pp.237-257, 1997.

D. Micciancio, The shortest vector in a lattice is hard to approximate to within some constant, SIAM Journal on Computing, vol.30, issue.6, pp.2008-2035, 2001.

J. Moncel, Codes Identifiants dans les Graphes, 2005.
URL : https://hal.archives-ouvertes.fr/tel-00010293

T. Müller and J. Sereni, Identifying and locating-dominating codes in (random) geometric networks, Combinatorics, Probability and Computing, vol.18, issue.6, pp.925-952, 2009.

N. Yonatan, Answer to the question "Is there an approximation algorithm for MAX k DOUBLE SET COVER?

C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, issue.3, pp.425-440, 1991.
DOI : 10.1145/62212.62233

C. H. Papadimitriou and M. Yannakakis, On limited nondeterminism and the complexity of the V-C dimension, Journal of Computer and System Sciences, vol.53, issue.2, pp.161-170, 1996.

E. Petrank, The hardness of approximation: gap location, Computational Complexity, vol.4, pp.133-157, 1994.
DOI : 10.1109/istcs.1993.253461

P. J. Slater and D. F. , On location-domination numbers for certain classes of graphs, Congressus Numerantium, vol.45, pp.97-106, 1984.

A. Rényi, On random generating elements of a finite Boolean algebra, Acta Scientiarum Mathematicarum Szeged, vol.22, pp.75-81, 1961.

N. Sauer, On the density of families of sets, Journal of Combinatorial Theory, Series A, vol.13, pp.145-147, 1972.

S. Shelah, A combinatorial problem; stability and order for models and theories in infinitary languages, Pacific Journal of Mathematics, vol.41, pp.247-261, 1972.

V. N. Vapnik and A. J. ?ervonenkis, The uniform convergence of frequencies of the appearance of events to their probabilities, Akademija Nauk SSSR, vol.16, pp.264-279, 1971.