Français

Jean Daligault

I defended my Ph.D. thesis in Computer Science on July 5th 2011 at Université Montpellier II, under the direction of Stéphan Thomassé.

Personal

Research areas :

I am working on graph decompositions and parameterized complexity. I am more generally interested in any field from graph theory and combinatorics. My research areas comprise in particular FPT algorithms, problem kernels, exponential algorithms, graphs algorithms, structural properties of graphs and digraphs, order theory.

Adress:

LIRMM, 161 rue Ada, 34392 Montpellier Cedex 5 - France
Phone +33 4 67 41 85 80
Office 3.188
Email : daligault@lirmm.fr

PhD thesis

Publications

• Multicut is FPT , Nicolas Bousquet, J.D, Stéphan Thomassé, accepted to STOC 2011.
• Treewidth Reduction for the Parameterized Multicut Problem , J.D, Christophe Paul, Anthony Perez, Stéphan Thomassé, preprint 2010.
• Well-quasi order of relabel functions , J.D, Michael Rao, Stéphan Thomassé, Order 27 (2010), 301-315.
• Diamond-free Circle Graphs are Helly Circle , J.D., Daniel Gonçalves, Michael Rao, Discrete Math. 310 (4), 845-849, 2010.
• FPT Algorithms and Kernels for the Directed k-Leaf Problem , J.D, Gregory Gutin, Eun Jung Kim, Anders Yeo, J. Comput. Syst. Sci. 76 (2010), 144-152.
• On finding Directed Trees with Many Leaves , J.D., Stephan Thomassé, proc. of IWPEC 09.
• A Polynomial Kernel for Multicut In Trees , Nicolas Bousquet, J.D, Stéphan Thomassé, Anders Yeo, Proceedings of STACS '09.
• On the variance of Quickselect , J. D., Conrado Martinez, proceedings of ANALCO 06.

Talks

• JGA '08, Un Noyau Polynomial pour Multicut In Trees (slides)
• ROGICS '08, Well-quasi-order of relabel functions (slides) .
• Workshop on Graph Decomposition: Theoretical, Algorithmic and Logical Aspects '08, Well-quasi-order of relabel functions (slides) .
• JGA '07, Algorithme linéaire de reconnaissance pour les Unit Circular-arcs Graphs, et existence d'un modèle compact. (slides)