I am currently working on two partial path covering problems : the partial multicut problem and the disjoint paths blocker problem. I try to solve these problems using different approaches, leading to either exact solutions using mathematical programming or dynamic programming in restricted classes of graphs, or to approximations.

Phd Thesis

On November 30th 2010, I defended my Ph. D. about the formal verification, using the Coq proof assistant, and the optimization of graph-coloring algorithms for register allocation, under the advise of Sandrine Blazy and Eric Soutif.
Manuscript     Slides