D. Achlioptas and C. Moore, On the 2-Colorability of Random Hypergraphs, Proc. 6th RANDOM, pp.78-90
DOI : 10.1007/3-540-45726-7_7

P. Damaschke, Parameterized enumeration, transversals, and imperfect phylogeny reconstruction, Theoretical Computer Science, vol.351, issue.3, pp.337-350, 2006.
DOI : 10.1016/j.tcs.2005.10.004

G. Dong and J. Li, Mining border descriptions of emerging patterns from dataset pairs, Knowledge and Information Systems, vol.1, issue.2, pp.178-202, 2005.
DOI : 10.1016/S1535-6108(02)00032-6

A. Dudek and A. Frieze, Loose hamilton cycles in random kuniform hypergraphs, 2010.

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 and G. Gottlob, Hypergraph Transversal Computation and Related Problems in Logic and AI, Lecture Notes in Computer Science, vol.2424, pp.549-564, 2002.
DOI : 10.1007/3-540-45757-7_53

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

T. Eiter, K. Makino, and G. Gottlob, Computational aspects of monotone dualization: A brief survey, Discrete Applied Mathematics, vol.156, issue.11, pp.2035-2049, 2008.
DOI : 10.1016/j.dam.2007.04.017

P. Erdös and A. Rényi, On random graphs. I. Publ, Math. Debrecen, vol.6, pp.290-297, 1959.

P. Erdös and A. Rényi, On the evolution of random graphs, Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp.17-61, 1960.

L. Michael, L. Fredman, and . Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms, vol.21, issue.3, pp.618-628, 1996.

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

M. Hagen, Algorithmic and Computational Complexity Issues of MONET. Dissertation, Institut für Informatik, 2008.

C. Hébert, A. Bretto, and B. Crémilleux, A data mining formalization to improve hypergraph minimal transversal computation, Fundam. Inf, vol.80, pp.415-433, 2007.

I. Kapovich, A. Myasnikov, P. Schupp, and V. Shpilrain, Generic-case complexity, decision problems in group theory, and random walks, Journal of Algebra, vol.264, issue.2, pp.665-694, 2003.
DOI : 10.1016/S0021-8693(03)00167-4

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

M. Lelarge, A New Approach to the Orientation of Random Hypergraphs, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '12, pp.251-264, 2012.
DOI : 10.1137/1.9781611973099.23
URL : https://hal.archives-ouvertes.fr/hal-01270322

K. Murakami and T. Uno, Efficient algorithms for dualizing large-scale hypergraphs, Discrete Applied Mathematics, vol.70, pp.83-94, 2014.

A. G. Myasnikov and A. N. Rybalov, Abstract, The Journal of Symbolic Logic, vol.55, issue.02, pp.656-673, 2008.
DOI : 10.1305/ndjfl/1168352664