My main areas of research are combinatorial optimization and graph theory, and in particular integer multicommodity flows. I am also interested in discrete geometry and problems involving graph metrics.

Additional pages

• The tableau, a survey on integer multicommodity flow problems, joint work with András Sebő.
• Definitions for the tableau.
• Notes on the multicommodity flow problem. Mostly unfinished notes to myself.
• Matching theory (work in progress). A skeleton of a course about matchings.
• A proof of the Okamura-Seymour theorem about edge-disjoint paths in planar graphs.
• A proof of the Klein-Plotkin-Rao theorem about decomposing graphs into small diameter components.

Projects

• Dissiml, an Ocaml library to compute compatible orders for Robinson dissimilarities.
• Small projects in OCaml, that I wrote to teach functional programming to undegrad students. Course and exercices here.
• my Github page, with only projects related to my teachings.

Presentations

Most of the slides of my presentations can be found on my publication's list. Some other presentations are listed below.

• Edge-disjoint paths in bounded treewidth graphs. A talk about approximation of the edge-disjoint paths problem in bounded treewidth graphs, when a constant congestion is allowed, joint work with Chandra Chekuri and Bruce Shepherd (2011).
• Polyhedral combinatorics linking tours, scattering sets and multiway cuts (an older version in French). About the problem of finding a shortest tour (see above), joint work with Vincent Jost (2009).

Other documents

• Méthodes avancées pour l'optimisation combinatoire. A transcript of a doctoral course given by Yann Kieffer in Grenoble (2010).
• Accessibilité dans les automates temporisés à deux horloges. My master thesis, about the reachability problem in two-clock timed automata (2006).