No. |
Title |
Author |
Year |
---|

1 |
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs |
Ducoffe, Guillaume |
2019 |

2 |
A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters |
Ducoffe, Guillaume |
2018 |

3 |
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs |
Chalopin, Jérémie et al. |
2018 |

4 |
How long does it take for all users in a social network to choose their communities? |
Bermond, Jean-Claude et al. |
2018 |

5 |
The b-Matching Problem in Distance-Hereditary Graphs and Beyond |
Ducoffe, Guillaume et al. |
2018 |

6 |
The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes |
Ducoffe, Guillaume et al. |
2018 |