Guillaume Ducoffe

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 86

Top Venues

CoRR

Discret. Appl. Math.

SIAM J. Discret. Math.

Algorithmica

University of Côte d'Azur, France (PHD)

Education History

University of Côte d'Azur, France

PHD

Publications

Feodor F. Dragan, Guillaume Ducoffe
-Metric Graphs: Radius, Diameter and all Eccentricities. Algorithmica 86 (7) (2024)
Pierre Bergé, Guillaume Ducoffe, Michel Habib
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs. Theory Comput. Syst. 68 (1) (2024)
David Coudert, Mónika Csikós, Guillaume Ducoffe, Laurent Viennot
Practical Computation of Graph VC-Dimension. SEA (2024)
David Coudert, Mónika Csikós, Guillaume Ducoffe, Laurent Viennot
Practical Computation of Graph VC-Dimension. CoRR (2024)
Guillaume Ducoffe
Balancing graph Voronoi diagrams with one more vertex. Networks 83 (2) (2024)
Feodor F. Dragan, Guillaume Ducoffe
-Metric Graphs: Hyperbolicity. CoRR (2024)
Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle
Treelength of series-parallel graphs. Discret. Appl. Math. 341 (2023)
Guillaume Ducoffe
-Helly graphs. Theor. Comput. Sci. 946 (2023)
Feodor F. Dragan, Guillaume Ducoffe
-Metric Graphs: Radius, Diameter and all Eccentricities. CoRR (2023)
Feodor F. Dragan, Guillaume Ducoffe
-Metric Graphs: Radius, Diameter and all Eccentricities. WG (2023)
Guillaume Ducoffe, Laurent Feuilloley, Michel Habib, François Pitois
Pattern detection in ordered graphs. CoRR (2023)
Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric
Non-Existence of Stable Social Groups in Information-Driven Networks. Theory Comput. Syst. 66 (4) (2022)
Guillaume Ducoffe
Obstructions to Faster Diameter Computation: Asteroidal Sets. IPEC (2022)
Guillaume Ducoffe, Michel Habib, Laurent Viennot
-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension. SIAM J. Comput. 51 (5) (2022)
Guillaume Ducoffe
The diameter of AT-free graphs. J. Graph Theory 99 (4) (2022)
Guillaume Ducoffe
Obstructions to faster diameter computation: Asteroidal sets. CoRR (2022)
Guillaume Ducoffe
Optimal Centrality Computations Within Bounded Clique-Width Graphs. Algorithmica 84 (11) (2022)
Guillaume Ducoffe
Eccentricity queries and beyond using hub labels. Theor. Comput. Sci. 930 (2022)
Guillaume Ducoffe
Balancing graph Voronoi diagrams with one more vertex. CoRR (2022)
Guillaume Ducoffe
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. Algorithmica 84 (11) (2022)
Pierre Bergé, Guillaume Ducoffe, Michel Habib
Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs. STACS (2022)
Pierre Bergé, Guillaume Ducoffe, Michel Habib
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs. CoRR (2021)
Guillaume Ducoffe, Feodor F. Dragan
A story of diameter, radius, and (almost) Helly property. Networks 77 (3) (2021)
Guillaume Ducoffe
On Computing the Average Distance for Some Chordal-Like Graphs. MFCS (2021)
Guillaume Ducoffe, Alexandru Popa
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes. Discret. Appl. Math. 291 (2021)
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. Discret. Comput. Geom. 65 (3) (2021)
Guillaume Ducoffe
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs. SIAM J. Discret. Math. 35 (2) (2021)
Guillaume Ducoffe
Beyond Helly Graphs: The Diameter Problem on Absolute Retracts. WG (2021)
Guillaume Ducoffe
Beyond Helly graphs: the diameter problem on absolute retracts. CoRR (2021)
Guillaume Ducoffe
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. IPEC (2021)
Guillaume Ducoffe
Optimal Centrality Computations Within Bounded Clique-Width Graphs. IPEC (2021)
Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs. WADS (2021)
Guillaume Ducoffe, Alexandru Popa
The b-Matching problem in distance-hereditary graphs and beyond. Discret. Appl. Math. 305 (2021)
Guillaume Ducoffe, Michel Habib, Laurent Viennot
Fast Diameter Computation within Split Graphs. Discret. Math. Theor. Comput. Sci. 23 (3) (2021)
Guillaume Ducoffe
Isometric Embeddings in Trees and Their Use in Distance Problems. MFCS (2021)
Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle
Treelength of Series-parallel Graphs. LAGOS (2021)
Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. CoRR (2021)
Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Alexandru Popa
On the (di)graphs with (directed) proper connection number two. Discret. Appl. Math. 281 (2020)
Guillaume Ducoffe
Eccentricity queries and beyond using Hub Labels. CoRR (2020)
Guillaume Ducoffe
Isometric embeddings in trees and their use in the diameter problem. CoRR (2020)
Guillaume Ducoffe
Optimal diameter computation within bounded clique-width graphs. CoRR (2020)
Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse
On the Complexity of Computing Treebreadth. Algorithmica 82 (6) (2020)
Guillaume Ducoffe
Around the diameter of AT-free graphs. CoRR (2020)
Guillaume Ducoffe
Distance problems within Helly graphs and k-Helly graphs. CoRR (2020)
Guillaume Ducoffe, Michel Habib, Laurent Viennot
-minor free graphs and graphs of bounded (distance) VC-dimension. SODA (2020)
Guillaume Ducoffe, Michel Habib, Laurent Viennot
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. CoRR (2019)
David Coudert, Guillaume Ducoffe, Alexandru Popa
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs. ACM Trans. Algorithms 15 (3) (2019)
Guillaume Ducoffe
Finding cut-vertices in the square roots of a graph. Discret. Appl. Math. 257 (2019)
Guillaume Ducoffe
The 4-Steiner Root Problem. WG (2019)
Guillaume Ducoffe
Easy computation of eccentricity approximating trees. Discret. Appl. Math. 260 (2019)
Guillaume Ducoffe, Michel Habib, Laurent Viennot
Fast Diameter Computation within Split Graphs. CoRR (2019)
Guillaume Ducoffe, Michel Habib, Laurent Viennot
Fast Diameter Computation Within Split Graphs. COCOA (2019)
Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric
How long does it take for all users in a social network to choose their communities? Discret. Appl. Math. 270 (2019)
Guillaume Ducoffe, Arne Leitert
Equivalence between pathbreadth and strong pathbreadth. Discret. Appl. Math. 262 (2019)
Guillaume Ducoffe
A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters. SOSA (2019)
Feodor F. Dragan, Guillaume Ducoffe
A story of diameter, radius and Helly property. CoRR (2019)
Daniela Aguirre-Guerrero, Guillaume Ducoffe, Lluís Fàbrega, Pere Vilà, David Coudert
Low time complexity algorithms for path computation in Cayley Graphs. Discret. Appl. Math. 259 (2019)
Guillaume Ducoffe
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs. ICALP (2019)
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
Fast approximation and exact computation of negative curvature parameters of graphs. CoRR (2018)
Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Camelia Obreja, Alexandru Popa, Rozica Maria Tache
Extremal Graphs with Respect to the Modified First Zagreb Connection Index. SYNASC (2018)
Guillaume Ducoffe, Arne Leitert
Equivalence between pathbreadth and strong pathbreadth. CoRR (2018)
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
Digital Modelling of Knowledge Innovations In Sacrobosco's Sphere: A Practical Application Of CIDOC-CRM And Linked Open Data With CorpusTracer. DH (2018)
David Coudert, Guillaume Ducoffe, Nicolas Nisse, Mauricio Soto
On distance-preserving elimination orderings in graphs: Complexity and algorithms. Discret. Appl. Math. 243 (2018)
David Coudert, Guillaume Ducoffe
Revisiting Decomposition by Clique Separators. SIAM J. Discret. Math. 32 (1) (2018)
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. SoCG (2018)
Guillaume Ducoffe
Faster approximation algorithms for computing shortest cycles on weighted graphs. CoRR (2018)
Guillaume Ducoffe, Alexandru Popa
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes. CoRR (2018)
Guillaume Ducoffe
A short note on the complexity of computing strong pathbreadth. Inf. Process. Lett. 133 (2018)
Guillaume Ducoffe, Alexandru Popa
A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs. CoRR (2018)
Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric
How long does it take for all users in a social network to choose their communities?. FUN (2018)
Guillaume Ducoffe
Polynomial-time Recognition of 4-Steiner Powers. CoRR (2018)
Guillaume Ducoffe, Alexandru Popa
The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes. ISAAC (2018)
Guillaume Ducoffe, Alexandru Popa
The b-Matching Problem in Distance-Hereditary Graphs and Beyond. ISAAC (2018)
David Coudert, Guillaume Ducoffe, Alexandru Popa
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. SODA (2018)
Júlio Araújo, Guillaume Ducoffe, Nicolas Nisse, Karol Suchan
On interval number in cycle convexity. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Nathann Cohen, David Coudert, Guillaume Ducoffe, Aurélien Lancin
Applying clique-decomposition for computing Gromov hyperbolicity. Theor. Comput. Sci. 690 (2017)
David Coudert, Guillaume Ducoffe, Alexandru Popa
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. CoRR (2017)
David Coudert, Guillaume Ducoffe
A simple approach for lower-bounding the distortion in any Hyperbolic embedding. Electron. Notes Discret. Math. 61 (2017)
Guillaume Ducoffe
Finding Cut-Vertices in the Square Roots of a Graph. WG (2017)
Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Alexandru Popa
On the (di)graphs with (directed) proper connection number two. Electron. Notes Discret. Math. 62 (2017)
David Coudert, Guillaume Ducoffe, Nicolas Nisse
To Approximate Treewidth, Use Treelength! SIAM J. Discret. Math. 30 (3) (2016)
Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse
On the Complexity of Computing Treebreadth. IWOCA (2016)
David Coudert, Guillaume Ducoffe
Data center interconnection networks are not hyperbolic. Theor. Comput. Sci. 639 (2016)
Guillaume Ducoffe
The Parallel Complexity of Coloring Games. SAGT (2016)
David Coudert, Guillaume Ducoffe
On the hyperbolicity of bipartite graphs and intersection graphs. Discret. Appl. Math. 214 (2016)
Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse
On computing tree and path decompositions with metric constraints on the bags. CoRR (2016)
Guillaume Ducoffe, Mathias Lécuyer, Augustin Chaintreau, Roxana Geambasu
Web Transparency for Complex Targeting: Algorithms, Limits, and Tradeoffs. SIGMETRICS (2015)
David Coudert, Guillaume Ducoffe
-Free and 1/2-Hyperbolic Graphs. SIAM J. Discret. Math. 28 (3) (2014)
Júlio Araújo, Jean-Claude Bermond, Guillaume Ducoffe
Eulerian and Hamiltonian dicycles in Directed hypergraphs. Discret. Math. Algorithms Appl. 6 (1) (2014)
Mathias Lécuyer, Guillaume Ducoffe, Francis Lan, Andrei Papancea, Theofilos Petsios, Riley Spahn, Augustin Chaintreau, Roxana Geambasu
XRay: Enhancing the Web's Transparency with Differential Correlation. CoRR (2014)
Mathias Lécuyer, Guillaume Ducoffe, Francis Lan, Andrei Papancea, Theofilos Petsios, Riley Spahn, Augustin Chaintreau, Roxana Geambasu
XRay: Enhancing the Web's Transparency with Differential Correlation. USENIX Security Symposium (2014)
Guillaume Ducoffe
Hamiltonicity of large generalized de Bruijn cycles. Discret. Appl. Math. 161 (13-14) (2013)
Guillaume Ducoffe, Dorian Mazauric, Augustin Chaintreau
Convergence of Coloring Games with Collusions CoRR (2012)

Guillaume Ducoffe.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guillaume Ducoffe