| No. |
Title |
Author |
Year |
| 1 |
Obstructions to Faster Diameter Computation: Asteroidal Sets |
Ducoffe, Guillaume |
2022 |
| 2 |
Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs |
Bergé, Pierre et al. |
2022 |
| 3 |
Isometric Embeddings in Trees and Their Use in Distance Problems |
Ducoffe, Guillaume |
2021 |
| 4 |
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width |
Ducoffe, Guillaume |
2021 |
| 5 |
On Computing the Average Distance for Some Chordal-Like Graphs |
Ducoffe, Guillaume |
2021 |
| 6 |
Optimal Centrality Computations Within Bounded Clique-Width Graphs |
Ducoffe, Guillaume |
2021 |
| 7 |
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs |
Ducoffe, Guillaume |
2019 |
| 8 |
A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters |
Ducoffe, Guillaume |
2018 |
| 9 |
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs |
Chalopin, Jérémie et al. |
2018 |
| 10 |
How long does it take for all users in a social network to choose their communities? |
Bermond, Jean-Claude et al. |
2018 |
| 11 |
The b-Matching Problem in Distance-Hereditary Graphs and Beyond |
Ducoffe, Guillaume et al. |
2018 |
| 12 |
The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes |
Ducoffe, Guillaume et al. |
2018 |
