In september 2016, I have joined Université Paris-Dauphine as a teaching assistant (ATER) for the whole year. Within that time, I am affiliated to the LAMSADE, more precisely to the working group algorithm and combinatorial optimization. Note that my email at u-bourgogne.fr does not work anymore.
From september 2014 to june 2016, I was at Université de Bourgogne. Also, I was a teaching assistant (ATER) for one year at Université de Bourgogne. For those two years, I was affiliated to the Le2i, more precisely to the working group Combnet (combinatorics and network).
From 2011 to 2014, I was a Ph.D. student in computer science affiliated to the Le2i (Laboratoire Electronique, Informatique et Image) and the Liris (Laboratoire d'InfoRmatique en Image et Système d'information), two computer science laboratories located in Dijon and Lyon, France, under the supervision of Hamamache Kheddouci and Olivier Togni. I defended my thesis entitled "Partitionnement, recouvrement et colorabilité dans les graphes" on July 8th 2014. The manuscript can be found here.
My research field is graph theory. I am mainly interested by two kinds of coloring problems. The first kind of coloring problems consists in adding distance constraints on colors classes (packing coloring, S-packing coloring and coloring of kth-power of graphs). The second kind of coloring problems consists in adding domination constraints on color classes (Grundy coloring or First-Fit coloring and b-coloring). I am also interested into the decomposition of graphs into several spanning trees.