Lucas de Meyer
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
1
Venues
1
Active years
2026–2026
Best venue rank
A
Where they publish
Papers
1 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STACS | 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 |