23 citations · 60 across the 50 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013
The role of planarity in connectivity problems parameterized by treewidth
Julien Baste, Ignasi Sau
For some years it was believed that for "connectivity" problems such as Hamiltonian Cycle, algorithms running in time 2^{O(tw)}n^{O(1)} -called single-exponential- existed only on…
cs.DS2013
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…
math.CO2013
An edge variant of the Erdős-Pósa property
Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
For every , we denote by the multigraph with two vertices and parallel edges. Given a graph , we say that a subgraph of is a model of $θ_{r}…