Convergence of Coloring Games with Collusions - Guillaume Ducoffe; Dorian Mazauric; Augustin Chaintreau (CoRR, 2012)

Hamiltonicity of large generalized de Bruijn cycles. - Guillaume Ducoffe (Discret. Appl. Math., 2013)

XRay: Enhancing the Web's Transparency with Differential Correlation. - Mathias Lécuyer; Guillaume Ducoffe; Francis Lan; Andrei Papancea; Theofilos Petsios; Riley Spahn; Augustin Chaintreau; Roxana Geambasu (USENIX Security Symposium, 2014)

Eulerian and Hamiltonian dicycles in Directed hypergraphs. - Júlio Araújo 001; Jean-Claude Bermond; Guillaume Ducoffe (Discret. Math. Algorithms Appl., 2014)

Recognition of C4-Free and 1/2-Hyperbolic Graphs. - David Coudert; Guillaume Ducoffe (SIAM J. Discret. Math., 2014)

Web Transparency for Complex Targeting: Algorithms, Limits, and Tradeoffs. - Guillaume Ducoffe; Mathias Lécuyer; Augustin Chaintreau; Roxana Geambasu (SIGMETRICS, 2015)

The Parallel Complexity of Coloring Games. - Guillaume Ducoffe (SAGT, 2016)

On computing tree and path decompositions with metric constraints on the bags. - Guillaume Ducoffe; Sylvain Legay; Nicolas Nisse (CoRR, 2016)

On the hyperbolicity of bipartite graphs and intersection graphs. - David Coudert; Guillaume Ducoffe (Discret. Appl. Math., 2016)

To Approximate Treewidth, Use Treelength! - David Coudert; Guillaume Ducoffe; Nicolas Nisse (SIAM J. Discret. Math., 2016)

Data center interconnection networks are not hyperbolic. - David Coudert; Guillaume Ducoffe (Theor. Comput. Sci., 2016)

Metric properties of large graphs. (Propriétés métriques des grands graphes). - Guillaume Ducoffe (2016)

A simple approach for lower-bounding the distortion in any Hyperbolic embedding. - David Coudert; Guillaume Ducoffe (Electron. Notes Discret. Math., 2017)

Applying clique-decomposition for computing Gromov hyperbolicity. - Nathann Cohen; David Coudert; Guillaume Ducoffe; Aurélien Lancin (Theor. Comput. Sci., 2017)

Digital Modelling of Knowledge Innovations In Sacrobosco's Sphere: A Practical Application Of CIDOC-CRM And Linked Open Data With CorpusTracer. - Florian Kräutli; Matteo Valleriani; Esther Chen; Christoph Sander; Dirk Wintergrün; Sabine Bertram; Gesa Funke; Chantal Wahbi; Manon Gumpert; Victoria Beyer; Nana Citron; Guillaume Ducoffe (DH, 2018)

Extremal Graphs with Respect to the Modified First Zagreb Connection Index. - Guillaume Ducoffe; Ruxandra Marinescu-Ghemeci; Camelia Obreja; Alexandru Popa 001; Rozica Maria Tache (SYNASC, 2018)

A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs. - Guillaume Ducoffe; Alexandru Popa 001 (CoRR, 2018)

Polynomial-time Recognition of 4-Steiner Powers. - Guillaume Ducoffe (CoRR, 2018)

On distance-preserving elimination orderings in graphs: Complexity and algorithms. - David Coudert; Guillaume Ducoffe; Nicolas Nisse; Mauricio Soto (Discret. Appl. Math., 2018)

On interval number in cycle convexity. - Júlio Araújo 001; Guillaume Ducoffe; Nicolas Nisse; Karol Suchan (Discret. Math. Theor. Comput. Sci., 2018)

A short note on the complexity of computing strong pathbreadth. - Guillaume Ducoffe (Inf. Process. Lett., 2018)

Revisiting Decomposition by Clique Separators. - David Coudert; Guillaume Ducoffe (SIAM J. Discret. Math., 2018)

A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters. - Guillaume Ducoffe (SOSA, 2019)

The 4-Steiner Root Problem. - Guillaume Ducoffe (WG, 2019)

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. - Guillaume Ducoffe; Michel Habib; Laurent Viennot (CoRR, 2019)

A story of diameter, radius and Helly property. - Feodor F. Dragan; Guillaume Ducoffe (CoRR, 2019)

Low time complexity algorithms for path computation in Cayley Graphs. - Daniela Aguirre-Guerrero; Guillaume Ducoffe; Lluís Fàbrega; Pere Vilà; David Coudert (Discret. Appl. Math., 2019)

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 (Discret. Appl. Math., 2019)

Finding cut-vertices in the square roots of a graph. - Guillaume Ducoffe (Discret. Appl. Math., 2019)

Easy computation of eccentricity approximating trees. - Guillaume Ducoffe (Discret. Appl. Math., 2019)

Equivalence between pathbreadth and strong pathbreadth. - Guillaume Ducoffe; Arne Leitert (Discret. Appl. Math., 2019)

Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs. - David Coudert; Guillaume Ducoffe; Alexandru Popa 001 (ACM Trans. Algorithms, 2019)

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. - Guillaume Ducoffe; Michel Habib; Laurent Viennot (SODA, 2020)

On the Complexity of Computing Treebreadth. - Guillaume Ducoffe; Sylvain Legay; Nicolas Nisse (Algorithmica, 2020)

Isometric embeddings in trees and their use in the diameter problem. - Guillaume Ducoffe (CoRR, 2020)

Around the diameter of AT-free graphs. - Guillaume Ducoffe (CoRR, 2020)

Distance problems within Helly graphs and k-Helly graphs. - Guillaume Ducoffe (CoRR, 2020)

Optimal diameter computation within bounded clique-width graphs. - Guillaume Ducoffe (CoRR, 2020)

On the (di)graphs with (directed) proper connection number two. - Guillaume Ducoffe; Ruxandra Marinescu-Ghemeci; Alexandru Popa 001 (Discret. Appl. Math., 2020)

Isometric Embeddings in Trees and Their Use in Distance Problems. - Guillaume Ducoffe (MFCS, 2021)

On Computing the Average Distance for Some Chordal-Like Graphs. - Guillaume Ducoffe (MFCS, 2021)

Beyond Helly Graphs: The Diameter Problem on Absolute Retracts. - Guillaume Ducoffe (WG, 2021)

The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes. - Guillaume Ducoffe; Alexandru Popa 001 (Discret. Appl. Math., 2021)

The b-Matching problem in distance-hereditary graphs and beyond. - Guillaume Ducoffe; Alexandru Popa 001 (Discret. Appl. Math., 2021)

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. - Jérémie Chalopin; Victor Chepoi; Feodor F. Dragan; Guillaume Ducoffe; Abdulhakeem Mohammed; Yann Vaxès (Discret. Comput. Geom., 2021)

Fast Diameter Computation within Split Graphs. - Guillaume Ducoffe; Michel Habib; Laurent Viennot (Discret. Math. Theor. Comput. Sci., 2021)

A story of diameter, radius, and (almost) Helly property. - Guillaume Ducoffe; Feodor F. Dragan (Networks, 2021)

Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs. - Guillaume Ducoffe (SIAM J. Discret. Math., 2021)

Obstructions to Faster Diameter Computation: Asteroidal Sets. - Guillaume Ducoffe (IPEC, 2022)

Optimal Centrality Computations Within Bounded Clique-Width Graphs. - Guillaume Ducoffe (Algorithmica, 2022)

Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. - Guillaume Ducoffe (Algorithmica, 2022)

The diameter of AT-free graphs. - Guillaume Ducoffe (J. Graph Theory, 2022)

Non-Existence of Stable Social Groups in Information-Driven Networks. - Augustin Chaintreau; Guillaume Ducoffe; Dorian Mazauric (Theory Comput. Syst., 2022)

Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension. - Guillaume Ducoffe; Michel Habib; Laurent Viennot (SIAM J. Comput., 2022)

Eccentricity queries and beyond using hub labels. - Guillaume Ducoffe (Theor. Comput. Sci., 2022)

Pattern detection in ordered graphs. - Guillaume Ducoffe; Laurent Feuilloley; Michel Habib; François Pitois (CoRR, 2023)

Distance problems within Helly graphs and k-Helly graphs. - Guillaume Ducoffe (Theor. Comput. Sci., 2023)

Treelength of series-parallel graphs. - Thomas Dissaux; Guillaume Ducoffe; Nicolas Nisse; Simon Nivelle (Discret. Appl. Math., 2023)

Practical Computation of Graph VC-Dimension. - David Coudert; Mónika Csikós; Guillaume Ducoffe; Laurent Viennot (SEA, 2024)

ɑi-Metric Graphs: Hyperbolicity. - Feodor F. Dragan; Guillaume Ducoffe (CoRR, 2024)

Bow Metrics and Hyperbolicity. - Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Laurent Viennot (CoRR, 2024)

Leanness Computation: Small Values and Special Graph Classes. - David Coudert; Samuel Coulomb; Guillaume Ducoffe (Discret. Math. Theor. Comput. Sci., 2024)

Corrigendum: The diameter of AT-free graphs. - Guillaume Ducoffe (J. Graph Theory, 2024)

Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs. - Pierre Bergé; Guillaume Ducoffe; Michel Habib (Theory Comput. Syst., 2024)

Balancing graph Voronoi diagrams with one more vertex. - Guillaume Ducoffe (Networks, 2024)

α i-Metric Graphs: Radius, Diameter and all Eccentricities. - Feodor F. Dragan; Guillaume Ducoffe (Algorithmica, 2024)

Quasilinear-time eccentricities computation, and more, on median graphs. - Pierre Bergé; Guillaume Ducoffe; Michel Habib (SODA, 2025)

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. - Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Laurent Viennot (SODA, 2025)

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. - Feodor F. Dragan; Guillaume Ducoffe; Heather M. Guarnera (J. Comput. Syst. Sci., 2025)

On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs. - Guillaume Aubian; Filippo Brunelli; Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Allen Ibiapina; Laurent Viennot (CoRR, 2025)

On Gp-unimodality of radius functions in graphs: structure and algorithms. - Jérémie Chalopin; Victor Chepoi; Feodor F. Dragan; Guillaume Ducoffe; Yann Vaxès (CoRR, 2025)