Jean Daligault

13 papers A* 1A 1Journal 8Unranked 2
YearRankTypeTitle / Venue / Authors
2018 J jnl
Multicut Is FPT.
SIAM J. Comput.
Nicolas Bousquet, Jean Daligault, Stéphan Thomassé
2011 A* conf
Multicut is FPT.
STOC
Nicolas Bousquet, Jean Daligault, Stéphan Thomassé
2011 — —
Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe. (Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut.)
Jean Daligault
2010 J jnl
Diamond-free circle graphs are Helly circle.
Discret. Math.
Jean Daligault, Daniel Gonçalves, Michaël Rao
2010 J jnl
FPT algorithms and kernels for the Directed k-Leaf problem.
J. Comput. Syst. Sci.
Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo
2010 J jnl
Multicut is FPT
CoRR
Nicolas Bousquet, Jean Daligault, Stéphan Thomassé
2010 J jnl
Well-Quasi-Order of Relabel Functions.
Order
Jean Daligault, Michaël Rao, Stéphan Thomassé
2009 J jnl
A Polynomial Kernel For Multicut In Trees
CoRR
Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo
2009 A conf
A Polynomial Kernel for Multicut in Trees.
STACS
Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo
2009 J jnl
On Finding Directed Trees with Many Leaves
CoRR
Jean Daligault, Stéphan Thomassé
2009 — conf
On Finding Directed Trees with Many Leaves.
IWPEC
Jean Daligault, Stéphan Thomassé
2008 J jnl
FPT Algorithms and Kernels for the Directed $k$-Leaf Problem
CoRR
Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo
2006 — conf
On the Variance of Quickselect.
ANALCO
Jean Daligault, Conrado Martínez