7 citations · 12 across the 4 of their papers we have counts for
4 papers
Multicut is FPT
Nicolas Bousquet, Jean Daligault, Stéphan Thomassé
Let be a graph on vertices and be a set of pairs of vertices in called \emph{requests}. A \emph{multicut} is a subset of such that every request …
On Finding Directed Trees with Many Leaves
Jean Daligault, Stephan Thomasse
The Rooted Maximum Leaf Outbranching problem consists in finding a spanning directed tree rooted at some prescribed vertex of a digraph with the maximum number of leaves. Its param…
A Polynomial Kernel For Multicut In Trees
Nicolas Bousquet, Jean Daligault, Stephan Thomasse +1
The MULTICUT IN TREES problem consists in deciding, given a tree, a set of requests (i.e. paths in the tree) and an integer k, whether there exists a set of k edges cutting all the…
FPT Algorithms and Kernels for the Directed -Leaf Problem
Jean Daligault, Gregory Gutin, Eun Jung Kim +1
A subgraph of a digraph is an {\em out-branching} if is an oriented spanning tree with only one vertex of in-degree zero (called the {\em root}). The vertices of of…