4 citations · 5 across the 4 of their papers we have counts for
4 papers
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…
A Linear Kernel for Planar Red-Blue Dominating Set
Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos
In the Red-Blue Dominating Set problem, we are given a bipartite graph and an integer , and asked whether has a subset of at most $k…
Explicit linear kernels via dynamic programming
Valentin Garnero, Christophe Paul, Ignasi Sau +1
Several algorithmic meta-theorems on kernelization have appeared in the last years, starting with the result of Bodlaender et al. [FOCS 2009] on graphs of bounded genus, then gener…
A Linear Kernel for Planar Total Dominating Set
Valentin Garnero, Ignasi Sau
A total dominating set of a graph is a subset such that every vertex in is adjacent to some vertex in . Finding a total dominating set of minimum s…