Guillaume Ducoffe

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Balancing graph Voronoi diagrams with one more vertex.

[BibT_eX]

[DOI]

Networks, March, 2024

Corrigendum: The diameter of AT-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2024

Leanness Computation: Small Values and Special Graph Classes.

[BibT_eX]

[DOI]

Samuel Coulomb

Discret. Math. Theor. Comput. Sci., 2024

Bow Metrics and Hyperbolicity.

[BibT_eX]

[DOI]

CoRR, 2024

ɑi-Metric Graphs: Hyperbolicity.

[BibT_eX]

[DOI]

CoRR, 2024

Practical Computation of Graph VC-Dimension.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

2023

Distance problems within Helly graphs and k-Helly graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2023

Pattern detection in ordered graphs.

[BibT_eX]

[DOI]

CoRR, 2023

α i-Metric Graphs: Radius, Diameter and all Eccentricities.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022

Eccentricity queries and beyond using hub labels.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

Non-Existence of Stable Social Groups in Information-Driven Networks.

[BibT_eX]

[DOI]

Augustin Chaintreau

Dorian Mazauric

Theory Comput. Syst., 2022

The diameter of AT-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs.

[BibT_eX]

[DOI]

Pierre Bergé

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Obstructions to Faster Diameter Computation: Asteroidal Sets.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021

A story of diameter, radius, and (almost) Helly property.

[BibT_eX]

[DOI]

Networks, 2021

Beyond Helly Graphs: The Diameter Problem on Absolute Retracts.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs.

[BibT_eX]

[DOI]

Heather M. Guarnera

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

On Computing the Average Distance for Some Chordal-Like Graphs.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Isometric Embeddings in Trees and Their Use in Distance Problems.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Treelength of Series-parallel Graphs.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Optimal Centrality Computations Within Bounded Clique-Width Graphs.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

Optimal diameter computation within bounded clique-width graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Distance problems within Helly graphs and k-Helly graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Around the diameter of AT-free graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Isometric embeddings in trees and their use in the diameter problem.

[BibT_eX]

[DOI]

CoRR, 2020

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Equivalence between pathbreadth and strong pathbreadth.

[BibT_eX]

[DOI]

Arne Leitert

Discret. Appl. Math., 2019

Easy computation of eccentricity approximating trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Low time complexity algorithms for path computation in Cayley Graphs.

[BibT_eX]

[DOI]

Daniela Aguirre-Guerrero

Discret. Appl. Math., 2019

A story of diameter, radius and Helly property.

[BibT_eX]

[DOI]

CoRR, 2019

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension.

[BibT_eX]

[DOI]

CoRR, 2019

The 4-Steiner Root Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Fast Diameter Computation Within Split Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

Revisiting Decomposition by Clique Separators.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

A short note on the complexity of computing strong pathbreadth.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

On interval number in cycle convexity.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2018

On distance-preserving elimination orderings in graphs: Complexity and algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Polynomial-time Recognition of 4-Steiner Powers.

[BibT_eX]

[DOI]

CoRR, 2018

A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs.

[BibT_eX]

[DOI]

CoRR, 2018

Extremal Graphs with Respect to the Modified First Zagreb Connection Index.

[BibT_eX]

[DOI]

Ruxandra Marinescu-Ghemeci

Camelia Obreja

Rozica Maria Tache

Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

Fully polynomial FPT algorithms for some classes of bounded clique-width graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

The b-Matching Problem in Distance-Hereditary Graphs and Beyond.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

How long does it take for all users in a social network to choose their communities?.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Digital Modelling of Knowledge Innovations In Sacrobosco's Sphere: A Practical Application Of CIDOC-CRM And Linked Open Data With CorpusTracer.

[BibT_eX]

[DOI]

Proceedings of the 13th Annual International Conference of the Alliance of Digital Humanities Organizations, 2018

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Applying clique-decomposition for computing Gromov hyperbolicity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

On the (di)graphs with (directed) proper connection number two.

[BibT_eX]

[DOI]

Ruxandra Marinescu-Ghemeci

Electron. Notes Discret. Math., 2017

A simple approach for lower-bounding the distortion in any Hyperbolic embedding.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Finding Cut-Vertices in the Square Roots of a Graph.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

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

[BibT_eX]

[DOI]

PhD thesis, 2016

Data center interconnection networks are not hyperbolic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

To Approximate Treewidth, Use Treelength!

[BibT_eX]

[DOI]

Nicolas Nisse

SIAM J. Discret. Math., 2016

On the hyperbolicity of bipartite graphs and intersection graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

On computing tree and path decompositions with metric constraints on the bags.

[BibT_eX]

[DOI]

Sylvain Legay

Nicolas Nisse

CoRR, 2016

The Parallel Complexity of Coloring Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

On the Complexity of Computing Treebreadth.

[BibT_eX]

[DOI]

Sylvain Legay

Nicolas Nisse

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015

Web Transparency for Complex Targeting: Algorithms, Limits, and Tradeoffs.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

2014

Recognition of C4-Free and 1/2-Hyperbolic Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Eulerian and Hamiltonian dicycles in Directed hypergraphs.

[BibT_eX]

[DOI]

Júlio Araújo

Jean-Claude Bermond

Discret. Math. Algorithms Appl., 2014

XRay: Enhancing the Web's Transparency with Differential Correlation.

[BibT_eX]

[DOI]

Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., 2014

2013

Hamiltonicity of large generalized de Bruijn cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Convergence of Coloring Games with Collusions

[BibT_eX]

[DOI]