Guillaume Ducoffe

105 papers A* 8A 1B 14C 3Misc 2Journal 74Unranked 2

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