12 citations · 41 across the 9 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015★ 10 cited
Efficient enumeration of solutions produced by closure operations
Arnaud Mary, Yann Strozecki
In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the c…
cs.CC2015
Incremental complexity of a bi-objective hypergraph transversal problem
Ricardo Andrade, Etienne Birmelé, Arnaud Mary +2
The hypergraph transversal problem has been intensively studied, from both a theoretical and a practical point of view. In particular , its incremental complexity is known to be qu…