- 11
- 1
David Coudert
12
Documents
Identifiants chercheurs
- david-coudert
- IdRef : 074539043
- 0000-0002-3306-8314
Présentation
Directeur de Recherche, Inria
Publications
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 6
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 5
- 2
- 2
- 3
- 2
- 1
- 12
|
Routing at Large Scale: Advances and Challenges for Complex NetworksIEEE Network, 2017, pp.12 - 22. ⟨10.1109/MNET.2017.1600203⟩
Article dans une revue
hal-01547511v1
|
|
Finding disjoint paths in networks with star shared risk link groupsTheoretical Computer Science, 2015, 579, pp.74-87. ⟨10.1016/j.tcs.2015.02.012⟩
Article dans une revue
hal-01132216v1
|
|
On computing the Gromov hyperbolicityACM Journal of Experimental Algorithmics, 2015, 20 (1), pp.18. ⟨10.1145/2780652⟩
Article dans une revue
hal-01182890v1
|
|
Recognition of C4-free and 1/2-hyperbolic graphsSIAM Journal on Discrete Mathematics, 2014, 28 (3), pp.1601-1617. ⟨10.1137/140954787⟩
Article dans une revue
hal-01070768v1
|
|
Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth13th International Symposium on Experimental Algorithms, 2014, Copenhagen, Denmark. pp.46-58
Communication dans un congrès
hal-00966851v1
|
|
Algorithme exact et approché pour le calcul de l'hyperbolicité d'un grapheAlgoTel 2013 - 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2013, Pornic, France. pp.1-4
Communication dans un congrès
hal-00818441v1
|
|
Feasibility study on distributed simulations of BGPPADS 2012 - 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation, Jul 2012, Zhangjiajie, China
Communication dans un congrès
hal-00706415v1
|
|
Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth[Research Report] RR-8470, INRIA. 2014, pp.301
Rapport
hal-00943549v1
|
|
On the recognition of $C_4$-free and $1/2$-hyperbolic graphs[Research Report] RR-8458, INRIA. 2014, pp.20
Rapport
hal-00937935v2
|
|
Applying clique-decomposition for computing Gromov hyperbolicity[Research Report] RR-8535, INRIA. 2014, pp.33
Rapport
hal-00989024v2
|
|
Feasibility study on distributed simulations of BGP[Research Report] RR-8283, 2013, pp.24
Rapport
hal-00813481v1
|
|
Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs[Research Report] RR-8074, INRIA. 2012
Rapport
hal-00735481v4
|