I am interested in Graph theory and Combinatorics, and more generally in Theoretical Computer Science and Discrete Mathematics.

Publications

  2025

• Faithful universal graphs for minor-closed classes
  with Paul Bastide, Louis Esperet, Carla Groenland, Claire Hilaire, and Alexandra Wesolek; submitted.

• k-shortest simple paths in bounded treewidth graphs
  with David Coudert and Andrea d'Ascenzo; in Theoretical Computer Science.
  

• Excluding a rectangular grid
  submitted.
  

  2024

• Centered coloring in minor-closed graph classes
  with Jędrzej Hodor, Hoang La, and Piotr Micek; submitted.

• Blow-ups and extensions of trees in tournaments
  with Pierre Aboulker, Frédéric Havet, William Lochet, Raul Lopes, and Lucas Picasarri-Arrieta; submitted.

• Weak coloring numbers of minor-closed graph classes
  with Jędrzej Hodor, Hoang La, and Piotr Micek; in the proceedings of SODA 2025.

• Diameter of the inversion graph
  with Frédéric Havet and Florian Hörsch; submitted.

• 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; in European Journal of Combinatorics.

  2023

• The χ-binding function of d-directional segment graphs
  with Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, and Amadeus Reinald; in Discrete & Computational Geometry.

• 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 2024.

• 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, 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.

  2022

• 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; in The Electronic Journal of Combinatorics.

• 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; in SIDMA, presented at ICGT 2022.

  2021

• 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.

See also on arXiv, DBLP.

Research internships

• 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