Jean Daligault

According to our database, Jean Daligault authored at least 8 papers between 2006 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Multicut Is FPT.

Nicolas Bousquet, Jean Daligault, Stéphan Thomassé

SIAM J. Comput., 2018

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

PhD thesis, 2011

2010

Well-Quasi-Order of Relabel Functions.

Jean Daligault, Michaël Rao, Stéphan Thomassé

Order, 2010

FPT algorithms and kernels for the Directed k-Leaf problem.

Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo

J. Comput. Syst. Sci., 2010

Diamond-free circle graphs are Helly circle.

Jean Daligault, Daniel Gonçalves, Michaël Rao

Discret. Math., 2010

2009

A Polynomial Kernel for Multicut in Trees.

Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

On Finding Directed Trees with Many Leaves.

Jean Daligault, Stéphan Thomassé

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

2006

On the Variance of Quickselect.

Jean Daligault, Conrado Martínez

Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006