New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A linear time algorithm for recognizing regular boolean functions
Journal of Algorithms
Efficient dualization of O(log n)-term monotone disjunctive normal forms
Discrete Applied Mathematics
Generating Partial and Multiple Transversals of a Hypergraph
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Linear Time Algorithm for Recognizing Regular Boolean Functions
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
On the complexity of monotone dualization and generating minimal hypergraph transversals
Discrete Applied Mathematics
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |