- 18
- 2
- 2
- 1
David Coudert
23
Documents
Identifiants chercheurs
- david-coudert
- IdRef : 074539043
- 0000-0002-3306-8314
Présentation
Directeur de Recherche, Inria
Publications
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 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
- 13
- 6
- 4
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 2
- 2
- 2
- 1
- 1
- 3
- 3
- 10
- 6
- 1
- 23
- 23
- 2
|
Fully polynomial FPT algorithms for some classes of bounded clique-width graphsACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.20, ⟨10.1137/1.9781611975031.176⟩
Communication dans un congrès
hal-01676187v1
|
|
A simple approach for lower-bounding the distortion in any Hyperbolic embeddingEUROCOMB'17 -- The European Conference on Combinatorics, Graph Theory and Applications, Aug 2017, Vienna, Austria. pp.293 - 299, ⟨10.1016/j.endm.2017.06.051⟩
Communication dans un congrès
hal-01573042v1
|
|
Bin Packing with Colocations14th International Workshop on Approximation and Online Algorithms (WAOA), Aug 2016, Aarhus, Denmark. pp.40-51, ⟨10.1007/978-3-319-51741-4_4⟩
Communication dans un congrès
hal-01435614v1
|
|
On Computing the Hyperbolicity of Real-World Graphs23rd Annual European Symposium on Algorithms (ESA), Sep 2015, Patras, Greece. pp.215-226, ⟨10.1007/978-3-662-48350-3_19⟩
Communication dans un congrès
hal-01199860v1
|
|
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs[Research Report] Inria - Sophia antipolis; Universite Cote d'Azur; University of Bucharest, Faculty of Mathematics and Computer Science; National Institute for Research and Development in Informatics, Romania. 2017, pp.1-60
Rapport
hal-01562413v2
|
|
Distance-preserving orderings in graphs[Research Report] RR-8973, Inria Sophia Antipolis. 2016, pp.1-23
Rapport
hal-01393523v2
|
|
Clique-decomposition revisited[Research Report] INRIA Sophia Antipolis - I3S. 2016
Rapport
hal-01266147v1
|
|
A note on Integer Linear Programming formulations for linear ordering problems on graphs[Research Report] Inria; I3S; Universite Nice Sophia Antipolis; CNRS. 2016, pp.33
Rapport
hal-01271838v1
|
|
Bin packing with colocations[Research Report] Inria; I3S. 2016
Rapport
hal-01381333v2
|
|
Data center interconnection networks are not hyperbolic[Research Report] Inria Sophia Antipolis; I3S; Université Nice Sophia Antipolis; CNRS. 2015, pp.23
Rapport
hal-01149203v1
|
|
Diameter of Minimal Separators in Graphs[Research Report] RR-8639, Inria Sophia Antipolis; I3S; INRIA. 2014, pp.16
Rapport
hal-01088423v2
|