Lucas de Meyer

11 papers A* 1A 1Journal 9
YearRankTypeTitle / Venue / Authors
2026 A conf
A Polynomial Bound on the Pathwidth of Graphs Edge-Coverable by k Shortest Paths.
STACS
Julien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois, Timothé Picavet
2026 J jnl
Optimal list recoloring of subcubic graphs and complete multipartite graphs.
Discret. Math.
Lucas de Meyer
2026 J jnl
Reconfiguration of Plane Trees in Convex Geometric Graphs.
Discret. Comput. Geom.
Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek
2025 J jnl
A polynomial bound on the pathwidth of graphs edge-coverable by
CoRR
Julien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois, Timothé Picavet
2025 J jnl
An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors.
CoRR
Lucas de Meyer, Frantisek Kardos, Aurélie Lagoutte, Guillem Perarnau
2025 J jnl
Optimal List Recoloring of Subcubic Graphs and Complete Multipartite Graphs.
CoRR
Lucas de Meyer
2024 A* conf
Reconfiguration of Plane Trees in Convex Geometric Graphs.
SoCG
Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek
2024 J jnl
Square Coloring Planar Graphs with Automatic Discharging.
SIAM J. Discret. Math.
Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron
2023 J jnl
Improved square coloring of planar graphs.
Discret. Math.
Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron
2023 J jnl
Reconfiguration of plane trees in convex geometric graphs.
CoRR
Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek
2022 J jnl
Square coloring planar graphs with automatic discharging.
CoRR
Nicolas Bousquet, Lucas de Meyer, Quentin Deschamps, Théo Pierron