5 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.DS2012★ 2 cited
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…
cs.DS2012★ 5 cited
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…