D. Avis and K. Fukuda, Reverse search for enumeration, Discrete Applied Mathematics, vol.65, issue.1-3, pp.21-46, 1996.
DOI : 10.1016/0166-218X(95)00026-N

URL : http://doi.org/10.1016/0166-218x(95)00026-n

C. Berge, Hypergraphs: Combinatorics of Finite Sets, 1989.

E. Boros, K. M. 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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

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

T. Eiter, G. Gottlob, and K. Makino, New Results on Monotone Dualization and Generating Hypergraph Transversals, SIAM Journal on Computing, vol.32, issue.2, pp.514-537, 2003.
DOI : 10.1137/S009753970240639X

URL : http://arxiv.org/abs/cs/0204009

V. Fedor, P. Fomin, D. Heggernes, and . Kratsch, Charis Papadopoulos, and Yngve Villanger. Enumerating minimal subset feedback vertex sets, Algorithmica, vol.69, issue.1, pp.216-231, 2014.

P. A. Golovach, P. Heggernes, D. Kratsch, and Y. Villanger, An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets, Lecture Notes in Computer Science, vol.7965, issue.1, pp.485-496, 2013.
DOI : 10.1007/978-3-642-39206-1_41

D. Gunopulos, R. Khardon, H. Mannila, and H. Toivonen, Data mining, hypergraph transversals, and machine learning, PODS, pp.209-216, 1997.
DOI : 10.1145/263661.263684

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs, of Pure and Applied Mathematics. Marcel Dekker, 1998.

V. Mamadou-moustapha-kanté, A. Limouzy, L. Mary, and . Nourine, Enumeration of Minimal Dominating Sets and Variants, Lecture Notes in Computer Science, vol.18, issue.1-3, pp.298-309, 2011.
DOI : 10.1023/A:1016783217662

V. Mamadou-moustapha-kanté, A. Limouzy, L. Mary, and . Nourine, On the enumeration of minimal dominating sets and related notions, 2012.

V. Mamadou-moustapha-kanté, A. Limouzy, L. Mary, and . Nourine, On the neighbourhood helly of some graph classes and applications to the enumeration of minimal dominating sets, ISAAC, pp.289-298, 2012.

V. Mamadou-moustapha-kanté, A. Limouzy, L. Mary, T. Nourine, and . Uno, On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs, Lecture Notes in Computer Science, vol.8283, pp.339-349, 2013.
DOI : 10.1007/978-3-642-45030-3_32

D. J. Kavvadias and E. C. Stavropoulos, An Efficient Algorithm for the Transversal Hypergraph Generation, Journal of Graph Algorithms and Applications, vol.9, issue.2, pp.239-264, 2005.
DOI : 10.7155/jgaa.00107

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

L. Khachiyan, E. Boros, K. Borys, K. M. Elbassioni, and V. Gurvich, Generating All Vertices of a Polyhedron Is Hard, Discrete & Computational Geometry, vol.9, issue.4, pp.174-190, 2008.
DOI : 10.1007/s00454-008-9050-5

L. Khachiyan, E. Boros, K. Borys, K. M. Elbassioni, V. Gurvich et al., Generating Cut Conjunctions in Graphs and Related??Problems, Algorithmica, vol.27, issue.1???3, pp.239-263, 2008.
DOI : 10.1007/s00453-007-9111-9

L. Khachiyan, E. Boros, K. M. Elbassioni, and V. Gurvich, An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation, Discrete Applied Mathematics, vol.154, issue.16, pp.2350-2372, 2006.
DOI : 10.1016/j.dam.2006.04.012

L. Khachiyan, E. Boros, K. M. Elbassioni, and V. Gurvich, On Enumerating Minimal Dicuts and Strongly Connected Subgraphs, Algorithmica, vol.117, issue.1, pp.159-172, 2008.
DOI : 10.1007/s00453-007-9074-x

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

E. L. Lawler, J. K. Lenstra, and A. H. Kan, Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms, SIAM Journal on Computing, vol.9, issue.3, pp.558-565, 1980.
DOI : 10.1137/0209042

URL : https://pure.tue.nl/ws/files/2499168/Metis196442.pdf

K. Makino and T. Uno, New Algorithms for Enumerating All Maximal Cliques, Lecture Notes in Computer Science, vol.3111, pp.260-272, 2004.
DOI : 10.1007/978-3-540-27810-8_23

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

K. Murakami and T. Uno, Efficient algorithms for dualizing large-scale hypergraphs, Discrete Applied Mathematics, vol.170, issue.0, pp.83-94, 2014.
DOI : 10.1016/j.dam.2014.01.012

URL : http://arxiv.org/abs/1102.3813

L. Nourine and J. Petit, Extending set-based dualization: Application to pattern mining, ECAI, 2012.
DOI : 10.1016/j.tcs.2016.01.020

URL : https://hal.archives-ouvertes.fr/hal-01353000

B. Schwikowski and E. Speckenmeyer, On enumerating all minimal solutions of feedback problems, Discrete Applied Mathematics, vol.117, issue.1-3, pp.253-265, 2002.
DOI : 10.1016/S0166-218X(00)00339-5

A. Shioura, A. Tamura, and T. Uno, An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs, SIAM Journal on Computing, vol.26, issue.3, pp.678-692, 1997.
DOI : 10.1137/S0097539794270881

Y. Strozecki, Enumeration Complexity and Matroid Decomposition, 2010.

K. Takata, A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph, SIAM Journal on Discrete Mathematics, vol.21, issue.4, pp.936-946, 2007.
DOI : 10.1137/060653032

. Robert-endre-tarjan, Enumeration of the Elementary Circuits of a Directed Graph, SIAM Journal on Computing, vol.2, issue.3, pp.211-216, 1973.
DOI : 10.1137/0202017