4 citations · 5 across the 3 of their papers we have counts for
3 papers
math.CO2011★ 1 cited
Scott's induced subdivision conjecture for maximal triangle-free graphs
Nicolas Bousquet, Stéphan Thomassé
Scott conjectured that the class of graphs with no induced subdivision of a given graph is -bounded. We verify his conjecture for maximal triangle-free graphs.
cs.DS2010
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 …
cs.DM2009★ 4 cited
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…