loic.dubois@univ-eiffel.fr
PhD candidate in Computational Geometry at Université Gustave Eiffel, advised by Éric Colin de Verdière and Vincent Despré. You may find my CV here. I design and analyze efficient algorithms for geometric (and topological) problems. My focus is on the design of polynomial time algorithms for representations of surfaces, and for graphs drawn on surfaces.
Computing the Canonical Portalgon | submitted | |
A discrete analog of Tutte's barycentric embeddings on surfaces | with Colin de Verdière and Despré | SODA 2025 |
Untangling Graphs on Surfaces | with Colin de Verdière and Despré | SODA 2024 |
Making Multicurves Cross Minimally on Surfaces | ESA 2024 | |
A bound for Delaunay flip algorithms on flat tori | CCCG 2022 (best student paper), CGT 2023 | |
Two lower bounds for p-centered colorings | with Joret, Perarnau, Pilipczuk, and Pitois | DMTCS 2020 |
Hyperbolic triangulations | with Despré, Pouget, and Teillaud | submitted to the Computational Geometry Algorithms Library (CGAL) |
Assembler (36h) |
OpenGL (64h) |
SQL (24h) |
Algorithms and programming in Python (56h) |