A. J. Asratian, T. M. Denley, and R. , Häggkvist Bipartite graphs and their applications, 1998.

F. Bonomo and G. Durán, Computational complexity of classical problems for hereditary classes of graphs, or Electronic Notes in Discrete Mathematics, pp.413-434, 2004.

E. Boros, M. C. Golumbic, and V. E. Levit, On the number of vertices belonging to all maximum stable sets of a graph, Discrete Applied Mathematics, vol.124, issue.1-3, pp.17-25, 2002.
DOI : 10.1016/S0166-218X(01)00327-4

E. Boros, K. Elbassioni, and V. Gurvich, Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms, Journal of Graph Theory, vol.117, issue.3, pp.209-232, 2006.
DOI : 10.1002/jgt.20180

A. Branstädt, J. P. Spinrad, and V. B. Le, Graph classes : A survey, SIAM Monographs on Discrete Math. and Appl, 1999.

P. Burzyn, F. Bonomo, and G. Durán, NP-completeness results for edge modification problems, Discrete Applied Mathematics, vol.154, issue.13, pp.1824-1844, 2006.
DOI : 10.1016/j.dam.2006.03.031

B. Colson, P. Marcotte, and G. Savard, An overview of bilevel optimization, Annals of Operations Research, vol.89, issue.1, pp.235-256, 2007.
DOI : 10.1007/s10479-007-0176-2

S. Dempe, Foundations of bilevel programming, 2002.

P. Erdos, T. Gallai, and Z. Tuzc, Covering the cliques of a graph with vertices, Discrete Mathematics, vol.108, issue.1-3, pp.279-289, 1992.
DOI : 10.1016/0012-365X(92)90681-5

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

O. Goldschmidt and D. S. Hochbaum, A Polynomial Algorithm for the k-cut Problem for Fixed k, Mathematics of Operations Research, vol.19, issue.1, pp.24-37, 1994.
DOI : 10.1287/moor.19.1.24

L. Khachiyan, E. Boros, K. Borys, K. Elbassioni, V. Gurvich et al., On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction, Theory of Computing Systems, pp.204-233, 2008.
DOI : 10.1007/s00224-007-9025-6

C. Lee, Variations of maximum-clique transversal sets on graphs, Annals of Operations Research, vol.189, issue.1, 2009.
DOI : 10.1007/s10479-009-0673-6

J. M. Lewis and M. Yannakakis, The node-deletion problem for hereditary properties is NP-complete, Journal of Computer and System Sciences, vol.20, issue.2, pp.219-230, 1980.
DOI : 10.1016/0022-0000(80)90060-4

B. Ries, C. Bentz, C. Picouleau, D. De-werra, M. Costa et al., Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid, Discrete Mathematics, vol.310, issue.1, pp.310-132, 2010.
DOI : 10.1016/j.disc.2009.08.009
URL : https://hal.archives-ouvertes.fr/hal-00974959

A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, 2003.

W. Spurr and K. Spurr, Aferd Packer's High Protein Gourmet Cookbook, 1995.

P. J. Slater, A constructive characterization of trees with at least k disjoint maximum matchings, Journal of Combinatorial Theory, Series B, vol.25, issue.3, pp.326-338, 1978.
DOI : 10.1016/0095-8956(78)90009-6

L. N. Vicente, G. Savard, and J. J. Judice, Discrete linear bilevel programming problem, Journal of Optimization Theory and Applications, vol.81, issue.3, pp.597-614, 1996.
DOI : 10.1007/BF02275351

D. Wagner, Disjoint st-cuts in a network, pp.361-371, 1990.

M. Yannakakis, Edge-Deletion Problems, SIAM Journal on Computing, vol.10, issue.2, pp.297-309, 1981.
DOI : 10.1137/0210021

M. Yannakakis, Node-Deletion Problems on Bipartite Graphs, SIAM Journal on Computing, vol.10, issue.2, pp.310-327, 1981.
DOI : 10.1137/0210022

R. Zenklusen, B. Ries, C. Picouleau, D. De-werra, M. Costa et al., Blockers and transversals, Blockers and Transversals, pp.4306-4314, 2009.
DOI : 10.1016/j.disc.2009.01.006
URL : https://hal.archives-ouvertes.fr/hal-00975349

J. Zito, The structure and maximum number of maximum independent sets in trees, Journal of Graph Theory, vol.7, issue.2, pp.207-221, 1991.
DOI : 10.1002/jgt.3190150208