I am a junior researcher at INRAE, at the TSCF research unit. I work on graph algorithms and optimization in networks, as well as modelizing time and uncertainty in graphs. I also work on games from an algorithmic point of view.

Between 2022 and 2024, I was a postdoctoral researcher at LIMOS, under the supervision of Florent Foucaud in the ANR research project GRALMECO and the CAP 20-25 project. I mostly worked on problems related to distance in graphs from an algorithmic viewpoint.

In 2021-2022, I was an ATER at the IUT2 of Grenoble, doing my research with the Optimisation Combinatoire team of the G-SCOP laboratory.

Between 2019 and 2021, I was a postdoctoral student at the Institute of Mathematics of the UNAM Juriquilla. I worked under the supervision of Adriana Hansberg on the topic of balanceability.

In 2018-2019, I was an ATER at Université Grenoble Alpes working with the OC team at G-SCOP.

Between 2015 and 2018, I was a PhD student at Université de Lyon (Université Claude Bernard Lyon 1) working with the GOAL team at LIRIS, under the direction of Hamamache Kheddouci and the supervision of Aline Parreau and Éric Duchêne. You can find the manuscript (in French) here, an extended summary (in English) here and the slides of the defense (in French) here.

Support Sci-Hub!

### Research thematics

During my PhD, I focused on some aspects of graphs and on combinatorial games theory.

I am interested in several topics in combinatorics, notably combinatorial games, metric problems, critical graph theory and graph coloring. I study vertex deletion games, more classical combinatorial games, distinguishing colorings, path cover problems, families of critical graphs, as well as balanceable graphs. I work on both structural and algorithmic problems.

### Research projects

I am a member of the informal research group AlCoLoCo, which studies graphs and algorithms and is based in Clermont-Ferrand.

I work in the ANR project GRALMECO (Algorithmics for Metric Covering Problems in Graphs), which aims to improve our understanding of several problems related to distance and covering in graphs from an algorithmic viewpoint.

I took part of the ANR project GAG (Graphs And Games) on combinatorial games and graphs.

### Teaching

I supervise practical courses at Université Clermont Auvergne (Systems programming, XML, Mathematics tools).

As an ATER at IUT2 de Grenoble, I have taught several classes on topics such as algorithmic and programming (C, Web), operating systems, graphs, and probability and statistics.

I took part in a Computability and Complexity class at the UNAM Juriquilla, where I managed the tutorial sessions.

As an ATER at Université Grenoble-Alpes, I supervised courses and tutorials in several classes on topics such as graph theory, operations research, compiler theory and algorithms.

During my thesis, I taught computer science at ISFA.

In 2015-2016, I supervised practical courses in Unix and Java programming, and courses, tutorial and practical courses in C++ programming.

In 2016-2017 and 2017-2018, I supervised practical courses in Python and C++ programming.

### Misc. Activities

I was an organiser for the Séminaire des Doctorants Première Année du LIRIS, a seminar where new PhD students presented their research themes to each other.