PhD student in Computer Science and Mathematics
I am a PhD student at Université Côte d'Azur (France), laboratory I3S, team Coati, under the supervision of Frédéric Havet.
Contact
firstname . lastname at inria.fr
I am a PhD student at Université Côte d'Azur (France), laboratory I3S, team Coati, under the supervision of Frédéric Havet.
firstname . lastname at inria.fr
I am interested in Graph theory and Combinatorics, and more generally in Theoretical Computer Science and Discrete Mathematics.
Quickly excluding an apex-forest with Jędrzej Hodor, Hoang La, and Piotr Micek; submitted.
Subdivisions in dicritical digraphs with large order or digirth with Lucas Picasarri-Arrieta; submitted.
The χ-binding function of d-directional segment graphs with Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka and Amadeus Reinald; submitted.
The grid-minor theorem revisited with Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin and David R. Wood; in the proceedings of SODA 24.
On the minimum number of arcs in 4-dicritical oriented graphs with Frédéric Havet and Lucas Picasarri-Arrieta; in Journal of Graph Theory (to appear), in the proceedings of WG 2023.
On the minimum number of inversions to make a digraph k-(arc-)strong with Julien Duron, Frédéric Havet and Florian Hörsch; in the proceedings of Eurocomb 2023.
Neighborhood complexity of planar graphs with Gwenaël Joret; in Combinatorica (to appear).
Problems, proofs, and disproofs on the inversion number with Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhoefer, Nicolas Nisse and Quentin Vermande; submitted.
On the parameterized complexity of symmetric directed multicut with Eduard Eiben and Magnus Wahlström; in the proceedings of IPEC 2022.
On the minimum number of arcs in k-dicritical oriented graphs with Pierre Aboulker, Thomas Bellito and Frédéric Havet; presented at ICGT 2022.
Preference swaps for stable matching problem with Eduard Eiben, Gregory Gutin, Philip Neary, Magnus Wahlström and Anders Yeo; in Theoretical Computer Science.
On the dichromatic number of surfaces with Pierre Aboulker, Frédéric Havet and Kolja Knauer; in The Electronic Journal of Combinatorics.
Eurocomb 2023, August 2023, Prague, Czech Republic presention of the paper On the minimum number of inversions to make a digraph k-(arc-)strong
JGA 2022, November 2022, Paris, France presention of the paper Neighborhood complexity of planar graphs
ICGT 2022, July 2022, Montpellier, France presention of the paper On the minimum number of arcs in k-dicritical oriented graphs
Eurocomb 2021, September 2021, Barcelona, Spain (online) presention of the paper On the dichromatic number of surfaces
March to June 2023: internship supervised by Piotr Micek, Kraków, Poland
September 2022 to February 2023: internship supervised by Frédéric Havet, Inria Sophia-Antipolis, France
March to July 2022: internship supervised by
Gwenaël Joret,
Université Libre de Bruxelles, Belgium:
Neighborhood complexity of planar graphs
February to June 2021: internship supervised by
Magnus Wahlström,
Royal Holloway, University of London:
Parameterized complexity of
Symmetric Directed Multicut
summer 2020: internship supervised by
Frédéric Havet,
INRIA Sophia-Antipolis, France:
Coloring oriented graphs embedded on surfaces
2023-2026: PhD student at Université Côte d'Azur, supervised by Frédéric Havet.
2021-2022: Master Parisien de Recherche en Informatique (MPRI), Paris, France, with highest honors.
2019-2023: Student at the ÉNS (Ulm), computer science department.
2017-2019:
preparatory class MPSI and MP★,
lycée Blaise Pascal, Clermont-Ferrand.