5 citations · 10 across the 5 of their papers we have counts for
4 papers · 1 filter
Explicit linear kernels for packing problems
Valentin Garnero, Christophe Paul, Ignasi Sau +1
During the last years, several algorithmic meta-theorems have appeared (Bodlaender et al. [FOCS 2009], Fomin et al. [SODA 2010], Kim et al. [ICALP 2013]) guaranteeing the existence…
Hadwiger number of graphs with small chordality
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof +1
The Hadwiger number of a graph G is the largest integer h such that G has the complete graph K_h as a minor. We show that the problem of determining the Hadwiger number of a graph…
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…