• Parameterized algorithms and polynomial kernels.
• VC-dimension as a tool for studying graphs and hypergraphs.
• Graph coloring and chi-boundedness.

Contact:

Publications

1. Excluding cycles with a fixed number of chords, with Pierre Aboulker, in preparation.
2. Adjacent vertex-distinguishing edge coloring of graphs with maximum degree bounded, with Marthe Bonamy and Hervé Hocquard, in preparation.
3. VC-dimension and Erdös-Pósa property of graphs with Stéphan Thomassé, in preparation.
4. Clique versus independant set, with Aurélie Lagoutte and Stéphan Thomassé, submitted.
5. Recoloring bounded treewidth graphs with Marthe Bonamy, accepted to LAGOS'13.
6. Parameterized Domination in Circle Graphs with Daniel Gonçalves, George Mertzios, Christophe Paul, Ignasi Sau and Stéphan Thomassé, WG'12, volume 7551 of Lecture Notes in Computer Science (2012) 308-319
7. Scott's induced subdivision conjecture for maximal triangle-free graphs with Stéphan Thomassé, Combinatorics, Probability and Computing, 21 (2012) 512-514.
8. Multicut is FPT with Jean Daligault, Stéphan Thomassé, STOC'11, Proceedings of the 43rd annual ACM synoposium on Theory of computing (2011), 459-468.
9. Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata with Christof Löding, LATA 2010 , volume 6031 of Lecture Notes in Computer Science, (2010) 118-129.
10. A Polynomial Kernel for Multicut in Trees with Jean Daligault, Stéphan Thomassé, Anders Yeo, STACS'09, (2009) 183-194.

Talks

• BGW'12, Bordeaux, November, 22nd, 2012, Graphs with no cycle with a fixed number of chords (blackboard).
• JGA'12, Clermont-Ferrand, November, 14th, 2012, Coloration arc-en-ciel (in french).
• Séminaire équipe AlGCo, October, 18th, 2012, Clique / Stable Set separation.
• WG'12, Jerusalem, June, 28th, 2012, Parameterized domination on circle graphs.
• Semindoc LIRMM, Montpellier, April, 18th, 2012, Coloration de graphes: algorithmes et structures (in french).
• Workshop on coloration, Lyon, March, 19th, 2012, Scott's induced subdivision conjecture holds for maximal triangle-free graphs (blackboard).
• Journées Agape, Montpellier, February, 7th, 2012, Parameterized domination in circle graphs.
• JGA'11, Lyon, November, 15th, 2011, Conjecture de Scott pour les graphes sans triangle maximaux (in french).
• STOC'11, San José, June, 9th, 2011, Multicut is FPT.
• LIAFA, Paris, May, 10th, 2011, Multicut is FPT.
• Tel Aviv, April, 3rd, 2011, VC-dimension and Erdös-Pósa property.
• Journées Agape'10, Montpellier, February 8th, 2011, Multicut is fixed-parameter tractable (blackboard).
• JGA'10, VC-dimension et propriété d'Erdös-Pósa (in french).

Thesis:

• Vapnik-Chervonenkis Dimension (Master Thesis).
• Le problème de l'équivalence pour les automates de Büchi fortement non ambigüs (in French, First year of Master Thesis) (slides: french, english).
• Un noyau polynomial pour Multicut in Trees (in french, Bachelor Thesis) (slides).

Events:

2012

• BGW'12, Bordeaux, November 21-24.
• JGA'12, Clermont-Ferrand, November 14-16.
• JCALM, Montpellier, October 11-12.
• WG'12, Jerusalem, Israel, June 26-28.
• Workshop on coloration, Lyon, France, March 15-21.
• JCALM, Nice, February 16-17.
• Journées Agape , Montpellier, France, February 6-12.

2011

• Journées GRATOS , November 30-December 2.
• JGA 2011, Lyon, France, November 15-17.
• STOC 2011, San José, United States, June 6-8.
• Invitation at Tel Aviv University, in the team of Noga Alon, April, 3-8.
• JCALM, Marseille, France, February 18.
• Journées Agape , Montpellier, France, February 7-11.

2010

• JGA'10 , Marseille, France, November 08-10.
• The 2nd International Workshop on Graph Decomposition : Theoretical, Algorithmic and Logical Aspects, Marseille, France, October 18-22.