A. Björklund, T. Husfeldt, and M. Koivisto, Set Partitioning via Inclusion-Exclusion, SIAM Journal on Computing, vol.39, issue.2, pp.546-563, 2009.
DOI : 10.1137/070683933

B. Bollobás, Modern graph theory, Graduate Texts in Mathematics, vol.184, 1998.
DOI : 10.1007/978-1-4612-0619-4

A. Brandstädt, E. Eschen, and R. Sritharan, The induced matching and chain subgraph cover problems for convex bipartite graphs. Theoretical computer science, pp.260-265, 2007.

Y. Chang-wu, C. Gen-huey, and M. , On the complexity of the k-chain subgraph cover problem, Theoretical Computer Science, vol.205, issue.1-2, pp.85-98, 1998.
DOI : 10.1016/S0304-3975(97)00036-4

M. F. Vânia, C. M. Dias, J. L. De-figueiredo, and . Szwarcfiter, Generating bicliques of a graph in lexicographic order, Theoretical Computer Science, vol.337, issue.1-3, pp.240-248, 2005.

M. F. Vânia, C. M. Dias, J. L. De-figueiredo, and . Szwarcfiter, On the generation of bicliques of a graph, Discrete Applied Mathematics, vol.155, issue.14, pp.1826-1832, 2007.

T. Eiter and G. Gottlob, Identifying the Minimal Transversals of a Hypergraph and Related Problems, SIAM Journal on Computing, vol.24, issue.6, pp.1278-1304, 1995.
DOI : 10.1137/S0097539793250299

V. Fedor, D. Fomin, and . Kratsch, Exact Exponential Algorithms, 2010.

M. L. Fredman and L. Khachiyan, On the Complexity of Dualization of Monotone Disjunctive Normal Forms, Journal of Algorithms, vol.21, issue.3, pp.618-628, 1996.
DOI : 10.1006/jagm.1996.0062

D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, vol.27, issue.3, pp.119-123, 1988.
DOI : 10.1016/0020-0190(88)90065-8

K. Makino and T. Uno, Lecture Notes in Computer Science, chapter New Algorithms for Enumerating All Maximal Cliques, pp.260-272, 2004.
DOI : 10.1007/978-3-540-27810-8_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.705

J. W. Moon and L. Moser, On cliques in graphs, Israel Journal of Mathematics, vol.3, issue.1, pp.23-28, 1965.
DOI : 10.1007/BF02760024

I. Nor, J. Engelstädter, O. Duron, M. Reuter, M. Sagot et al., On the Genetic Architecture of Cytoplasmic Incompatibility: Inference from Phenotypic Data, The American Naturalist, vol.182, issue.1, pp.15-24, 2013.
DOI : 10.1086/670612
URL : https://hal.archives-ouvertes.fr/hal-00837003

M. Yannakakis, The Complexity of the Partial Order Dimension Problem, SIAM Journal on Algebraic Discrete Methods, vol.3, issue.3, pp.351-358, 1982.
DOI : 10.1137/0603036