Loïc Dubois

ldubois[at]nd.edu

Postdoc at University of Notre Dame, supervised by Erin Chambers. I design and analyze algorithms for geometric and topological data, a line of research called Computational Geometry. I am specifically interested in graphs and surfaces: representing, decomposing, and comparing them.

My PhD thesis was defended on September 2025. From September 2022 to September 2025, I was a PhD student at Université Gustave Eiffel, supervised by Éric Colin de Verdière and Vincent Despré. Before that, I studied at École Normale Supérieure de Lyon.

I have reviewed or am reviewing articles for the conferences SODA, SoCG, ESA, GD, and STACS, and for the journals DCG, JoCG, and CGT.

I have teached assembler, OpenGL, SQL, algorithms and programming in Python, and maths for computer scientists.

Research

• Computing the intrinsic Delaunay triangulation of a closed polyhedral surface.
  To appear in Proc. Int. Symp. on Computational Geometry (SoCG), 2026.
• A discrete analog of Tutte's barycentric embeddings on surfaces.
  With Éric Colin de Verdière and Vincent Despré.
  To appear in TheoretiCS.
  Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2025.
• Making multicurves cross minimally on surfaces.
  Proc. European Symposium on Algorithms (ESA), 2024.
  
• Untangling graphs on surfaces.
  With Éric Colin de Verdière and Vincent Despré.
  Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2024.
• A bound for Delaunay flip algorithms on flat tori.
  Computing in Geometry and Topology, 2023.
  Proc. Canadian Conf. on Computational Geometry (CCCG), 2022.
• Two lower bounds for p-centered colorings.
  With Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, and François Pitois.
  Discrete Mathematics and Theoretical Computer Science, 2020.

Software

• 2D Triangulations on Hyperbolic Surfaces.
  With Vincent Despré, Marc Pouget, and Monique Teillaud.
  Computational Geometry Algorithms Library (CGAL), 2025.