Lucas de Meyer

According to our database, Lucas de Meyer authored at least 7 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

Optimal list recoloring of subcubic graphs and complete multipartite graphs.

Lucas de Meyer

Discret. Math., 2026

A Polynomial Bound on the Pathwidth of Graphs Edge-Coverable by k Shortest Paths.

Julien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois, Timothé Picavet

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

2025

A polynomial bound on the pathwidth of graphs edge-coverable by <i>k</i> shortest paths.

Julien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois, Timothé Picavet

CoRR, October, 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, January, 2025

2024

Square Coloring Planar Graphs with Automatic Discharging.

Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron

SIAM J. Discret. Math., March, 2024

Reconfiguration of Plane Trees in Convex Geometric Graphs.

Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Improved square coloring of planar graphs.

Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron

Discret. Math., April, 2023