17 citations · 23 across the 5 of their papers we have counts for
5 papers
Kernels for Feedback Arc Set In Tournaments
Stéphane Bessy, Fedor V. Fomin, Serge Gaspers +4
A tournament T=(V,A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, the Fe…
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…
Partitions versus sets : a case of duality
Laurent Lyaudet, Frédéric Mazoit, Stephan Thomasse
In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all know…
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…
Convex cones and SAGBI bases of permutation invariants
Nicolas M. Thiéry, Stéphan Thomassé
Let G be a permutation group acting on {1,...,n}, and < be any admissible term order on the polynomial ring K[x_1,...,x_n]. We prove that the invariant ring K[x_1,...,x_n]^G of G h…