On the size of k-irreducible triangulations With Vincent Delecroix, Arnaud de Mesmay, Symposium on Computational Geometry, SOCG26Best Theory Paper Award (See on ArXiv)
On the Computation of Schrijver's Kernel With Vincent Delecroix, Francis Lazarus, ACM-SIAM Symposium on Discrete Algorithms, SODA26 (See on ArXiv)
On cuts of small chromatic number in sparse graphs With Guillaume Aubian, Marthe Bonamy, Romain Bourneuf, Lucas Picasarri-Arrieta, Discrete Mathematics(See on ArXiv)
The Maximum Zero-Sum Partition Problem With Guillaume Fertin, Géraldine Jean, Stéphane Vialette, 25th International Computer Symposium, ICS 2022 (See on HAL)
Talks and Posters
Combinatorial Optimization seminar (June 2026, Grenoble, France)Bounding the size of k-irreducible triangulations
SoCG: Symposium on Computational Geometry (June 2026, New Brunswick, USA)On the size of k-irreducible triangulations (slides)
EuroCG: European Workshop on Computational Geometry (Mars 2026, Hagen, Germany)On the computation of Schrijver's Kernel
Graph seminar (February 2026, LaBRI, Bordeaux, France)On the size of k-irreducible triangulations
SODA: Symposium on Discrete Algorithms (January 2026, Vancouver, Canada)On the Computation of Schrijver's Kernel
Journées de Géométrie Algorithmique (October 2025, Roscoff, France)Minor kernelization of embedded graph (slides)
CI seminar (April 2025, LaBRI, Bordeaux, France)Kernelization of embedded graph (slides)
Geometry and Computing (October 2024, CIRM, Marseille, France)Using Delaunay triangulations to enumerate saddle connections (PDF)