On the Variance of Quickselect. - Jean Daligault; Conrado Martínez (ANALCO, 2006)

On Finding Directed Trees with Many Leaves. - Jean Daligault; Stéphan Thomassé (IWPEC, 2009)

A Polynomial Kernel for Multicut in Trees. - Nicolas Bousquet 001; Jean Daligault; Stéphan Thomassé; Anders Yeo (STACS, 2009)

Diamond-free circle graphs are Helly circle. - Jean Daligault; Daniel Gonçalves 001; Michaël Rao (Discret. Math., 2010)

FPT algorithms and kernels for the Directed k-Leaf problem. - Jean Daligault; Gregory Z. Gutin; Eun Jung Kim 002; Anders Yeo (J. Comput. Syst. Sci., 2010)

Well-Quasi-Order of Relabel Functions. - Jean Daligault; Michaël Rao; Stéphan Thomassé (Order, 2010)

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 (2011)

Multicut Is FPT. - Nicolas Bousquet 001; Jean Daligault; Stéphan Thomassé (SIAM J. Comput., 2018)