23 citations · 76 across the 30 of their papers we have counts for
3 papers · 2 filters
Linear kernels and single-exponential algorithms via protrusion decompositions
Eun Jung Kim, Alexander Langer, Christophe Paul +4
A \emph{-treewidth-modulator} of a graph is a set such that the treewidth of is at most some constant . In this paper, we present a novel algor…
Parameterized Domination in Circle Graphs
Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios +3
A circle graph is the intersection graph of a set of chords in a circle. Keil [Discrete Applied Mathematics, 42(1):51-63, 1993] proved that Dominating Set, Connected Dominating Set…
A single-exponential FPT algorithm for the -minor cover problem
Eun Jung Kim, Christophe Paul, Geevarghese Philip
Given an input graph G and an integer k, the parameterized K_4-minor cover problem asks whether there is a set S of at most k vertices whose deletion results in a K_4-minor-free gr…