Dualization of a monotone Boolean function represented by a conjunctive normal form
(CNF) is a problem which, in different disguise, is ubiquitous in many areas including …

Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …

In this paper, we consider the problems of generating all maximal (bipartite) cliques in a
given (bipartite) graph G=(V, E) with n vertices and m edges. We propose two algorithms for …

This paper considers the problem of dualizing a monotone CNF (equivalently, computing all
minimal transversals of a hypergraph), whose associated decision problem is a prominent …

Finding inclusion-minimal hitting sets (MHSs) for a given family of sets is a fundamental
combinatorial problem with applications in domains as diverse as Boolean algebra …

This work presents techniques for modeling Boolean functions by mixed-integer linear
inequalities (MILP) on binary variables in-place (without auxiliary variables), reaching …

Given a finite set V, and a hypergraph H⊆ 2V, the hypergraph transversal problem calls for
enumerating all minimal hitting sets (transversals) for H. This problem plays an important …

The transversal hypergraph problem asks to enumerate the minimal hitting sets of a
hypergraph. If the solutions have bounded size, Eiter and Gottlob [SICOMP'95] gave an …

Given a finite set V, and integers k≥ 1 and r≥ 0, denote by A(k,r) the class of hypergraphs
A⊆2^v with (k, r)-bounded intersections, ie in which the intersection of any k distinct …

This article surveys some recent results on the generation of implicitly given hypergraphs
and their applications in Boolean and integer programming, data mining, reliability theory …