Even before that, I was a Ph.D. student from the Université Paris-Dauphine, in the LAMSADE, supervised by Pr. Vangelis Th. Paschos and Pr. Bruno Escoffier, Université Pierre et Marie Curie.
I defended my Ph.D. on November 20, 2014. Here is the manuscript and here are the slides of the defense.
My research is in algorithmics and complexity.
I am mainly focused on graph problems, parameterized complexity, and approximability in moderately exponential/subexponential time or fixed-parameter time.
I also work on the computational complexity of geometric problems and games.
Here is my CV.
Key-words: Algorithms, Complexity, Graphs, Approximation, Parameterized Complexity, Games.