Improved square coloring of planar graphs. - Nicolas Bousquet 001; Quentin Deschamps; Lucas de Meyer; Théo Pierron (Discret. Math., 2023)

Reconfiguration of Plane Trees in Convex Geometric Graphs. - Nicolas Bousquet 001; Lucas de Meyer; Théo Pierron; Alexandra Wesolek (SoCG, 2024)

Square Coloring Planar Graphs with Automatic Discharging. - Nicolas Bousquet 001; Quentin Deschamps; Lucas de Meyer; Théo Pierron (SIAM J. Discret. Math., 2024)

Optimal List Recoloring of Subcubic Graphs and Complete Multipartite Graphs. - Lucas de Meyer (CoRR, 2025)

An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors. - Lucas de Meyer; Frantisek Kardos; Aurélie Lagoutte; Guillem Perarnau (CoRR, 2025)