5 citations · 15 across the 12 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DS2024★ 1 cited
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…
cs.DS2024
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…
cs.DS2024
Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
For a fixed graph , the -SUBGRAPH HITTING problem consists in deleting the minimum number of vertices from an input graph to obtain a graph without any occurrence of as a…