Hypergraphs: Combinatorics of Finite Sets, 1989. ,
Patient-specific driver gene prediction and risk assessment through integrated network analysis of cancer omics profiles, Nucleic Acids Research, vol.43, issue.7, 2015. ,
DOI : 10.1093/nar/gku1393
AN EFFICIENT INCREMENTAL ALGORITHM FOR GENERATING ALL MAXIMAL INDEPENDENT SETS IN HYPERGRAPHS OF BOUNDED DIMENSION, Parallel Processing Letters, vol.10, issue.04, pp.253-266, 2000. ,
DOI : 10.1142/S0129626400000251
Generating Partial and Multiple Transversals of a Hypergraph, Lecture Notes in Computer Science, vol.1853, pp.588-599, 2000. ,
DOI : 10.1007/3-540-45022-X_50
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
Hypergraph Transversal Computation and Related Problems in Logic and AI, Logics in Artificial Intelligence, pp.549-564, 2002. ,
DOI : 10.1007/3-540-45757-7_53
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
Computational aspects of monotone dualization: A brief survey, Discrete Applied Mathematics, vol.156, issue.11, pp.11-2035, 2008. ,
DOI : 10.1016/j.dam.2007.04.017
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
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions, Discrete Applied Mathematics, vol.96, issue.97, pp.0-363, 1999. ,
DOI : 10.1016/S0166-218X(99)00099-2
Computing Knock-Out Strategies in Metabolic Networks, Journal of Computational Biology, vol.15, issue.3, pp.259-268, 2008. ,
DOI : 10.1089/cmb.2007.0229
Computing complex metabolic intervention strategies using constrained minimal cut sets, Metabolic Engineering, vol.13, issue.2, pp.204-213, 2011. ,
DOI : 10.1016/j.ymben.2010.12.004
Comparison and improvement of algorithms for computing minimal cut sets, BMC Bioinformatics, vol.14, issue.1, p.318, 2013. ,
DOI : 10.1287/ijoc.6.4.445
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.16-2350, 2006. ,
DOI : 10.1016/j.dam.2006.04.012
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
Hypergraph Transversal Computation with Binary Decision Diagrams, Experimental Algorithms, pp.91-102, 2013. ,
DOI : 10.1007/978-3-642-38527-8_10