5 citations · 7 across the 5 of their papers we have counts for
12 papers · 1 filter
A more versatile model for enumerative kernelization: a case study for Vertex Cover
Marin Bougeret, Guilherme C. M. Gomes, Ignasi Sau
Enumerative kernelization is a recent promising at the intersection of parameterized complexity and enumeration algorithms, with two proposed models. The first, known as enum-kerne…
Kernelization dichotomies for hitting minors under structural parameterizations
Marin Bougeret, Eric Brandwein, Ignasi Sau
For a finite collection of connected graphs , the -MINOR-DELETION problem consists in, given a graph and an integer , deciding whether conta…
Enumeration kernels for Vertex Cover and Feedback Vertex Set
Marin Bougeret, Guilherme C. M. Gomes, Vinicius F. dos Santos +1
Enumerative kernelization is a recent and promising area sitting at the intersection of parameterized complexity and enumeration algorithms. Its study began with the paper of Creig…
Pushing the frontiers of subexponential FPT time for Feedback Vertex Set
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves +1
The paper deals with the Feedback Vertex Set problem parameterized by the solution size. Given a graph and a parameter , one has to decide if there is a set of at most $…
Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves +1
In this paper, we investigate the existence of parameterized algorithms running in subexponential time for two fundamental cycle-hitting problems: Feedback Vertex Set (FVS) and Tri…
Kick the cliques
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves +1
In the -Cover problem, given a graph and an integer one has to decide if there exists a set of at most vertices whose removal destroys all -cliques of . In t…