23 citations · 76 across the 30 of their papers we have counts for
3 papers · 2 filters
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…
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
Didem Gözüpek, Sibel Özkan, Christophe Paul +2
In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost. The "Minimum Chan…
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
Julien Baste, Christophe Paul, Ignasi Sau +1
In phylogenetics, a central problem is to infer the evolutionary relationships between a set of species ; these relationships are often depicted via a phylogenetic tree -- a tre…