66 citations · 206 across the 36 of their papers we have counts for
Showing 2015 · cs.DSShow all
3 papers · 2 filters
cs.DS2015
Exact Algorithms via Monotone Local Search
Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov +1
We give a new general approach for designing exact exponential-time algorithms for subset problems. In a subset problem the input implicitly describes a family of sets over a unive…
cs.DS2015
Faster algorithms to enumerate hypergraph transversals
Manfred Cochefert, Jean-Francois Couturier, Serge Gaspers +1
A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversal…
cs.DS2015★ 4 cited
On the Number of Minimal Separators in Graphs
Serge Gaspers, Simon Mackenzie
We consider the largest number of minimal separators a graph on n vertices can have at most. We give a new proof that this number is in . We prove that t…