Ignasi Sau

activity

20082025

most citedAn FPT 2-Approximation for Tree-Cut Decomposition

23 citations · 60 across the 50 of their papers we have counts for

collaborators

Showing 2012Show all

3 papers · 1 filter

cs.DS2012★ 4 cited

A Linear Kernel for Planar Total Dominating Set

Valentin Garnero, Ignasi Sau

A total dominating set of a graph $G = (V, E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$ . Finding a total dominating set of minimum s…

cs.DS2012

Linear kernels and single-exponential algorithms via protrusion decompositions

Eun Jung Kim, Alexander Langer, Christophe Paul +4

A \emph{ $t$ -treewidth-modulator} of a graph $G$ is a set $X \subseteq V (G)$ such that the treewidth of $G - X$ is at most some constant $t - 1$ . In this paper, we present a novel algor…

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…