Research TopicsHome  Research  Publications  Talks  VitaeGraph Decomposition and Algorithms Wellstructured Graph Families Fixed Parameterized Algorithms Bioinformatics Graph Decomposition AlgorithmsDesign of new algorithms for graph decompositions based on partitive or bipartitive families, such as modular decomposition or split decomposition. The algorithmic tools I like to use are for example, partition refinement techniques, Lexicographic Breadth First Search (LexBFS)... I also worked on the classical width parameters and the related tree or branch decompositions. For more details, see the ANR research project GRAAL. Wellstructured Graph FamiliesThe combinatorial properties of restricted graph families are the basis of efficient algorithms (for example to solve problems that are NPhard in general). I have particular interest in the recognition problem of graph families such as intersection graphs (interval graphs, chordal graphs, permutation graphs, circle graphs...) Fixed parameterized algorithms and kernelization
