| 2026 | ESA | Beyond Trees: The Weighted Center Problem on Gromov Hyperbolic Graphs. | Guillaume Ducoffe |
| 2026 | ICALP | A Fine-Grained Dichotomy for the Center Problem on Gromov Hyperbolic Graphs. | Guillaume Ducoffe |
| 2025 | SODA | Quasilinear-time eccentricities computation, and more, on median graphs. | Pierre Berg, Guillaume Ducoffe, Michel Habib |
| 2025 | SODA | Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. | Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot |
| 2023 | WG | α | Feodor F. Dragan, Guillaume Ducoffe |
| 2022 | STACS | Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs. | Pierre Berg, Guillaume Ducoffe, Michel Habib |
| 2021 | LAGOS | Treelength of Series-parallel Graphs. | Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle |
| 2021 | MFCS | Isometric Embeddings in Trees and Their Use in Distance Problems. | Guillaume Ducoffe |
| 2021 | MFCS | On Computing the Average Distance for Some Chordal-Like Graphs. | Guillaume Ducoffe |
| 2021 | WADS | Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs. | Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera |
| 2021 | WG | Beyond Helly Graphs: The Diameter Problem on Absolute Retracts. | Guillaume Ducoffe |
| 2020 | SODA | Diameter computation on | Guillaume Ducoffe, Michel Habib, Laurent Viennot |
| 2019 | COCOA | Fast Diameter Computation Within Split Graphs. | Guillaume Ducoffe, Michel Habib, Laurent Viennot |
| 2019 | ICALP | Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs. | Guillaume Ducoffe |
| 2019 | SODA | A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters. | Guillaume Ducoffe |
| 2019 | WG | The 4-Steiner Root Problem. | Guillaume Ducoffe |
| 2018 | FUN | How long does it take for all users in a social network to choose their communities?. | Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric |
| 2018 | ISAAC | The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes. | Guillaume Ducoffe, Alexandru Popa |
| 2018 | ISAAC | The b-Matching Problem in Distance-Hereditary Graphs and Beyond. | Guillaume Ducoffe, Alexandru Popa |
| 2018 | SODA | Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. | David Coudert, Guillaume Ducoffe, Alexandru Popa |
| 2018 | SYNASC | Extremal Graphs with Respect to the Modified First Zagreb Connection Index. | Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Camelia Obreja, Alexandru Popa, Rozica Maria Tache |
| 2017 | WG | Finding Cut-Vertices in the Square Roots of a Graph. | Guillaume Ducoffe |
| 2016 | IWOCA | On the Complexity of Computing Treebreadth. | Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse |
| 2016 | SAGT | The Parallel Complexity of Coloring Games. | Guillaume Ducoffe |
| 2015 | SIGMETRICS | Web Transparency for Complex Targeting: Algorithms, Limits, and Tradeoffs. | Guillaume Ducoffe, Mathias Lcuyer, Augustin Chaintreau, Roxana Geambasu |