Skip to Main content Skip to Navigation


...
tel-00008087v1  Theses
David Coudert. Algorithmique et optimisation de réseaux de communications optiques
Modélisation et simulation. Université Nice Sophia Antipolis, 2001. Français
...
hal-01182890v1  Journal articles
Nathann CohenDavid CoudertAurélien Lancin. On computing the Gromov hyperbolicity
ACM Journal of Experimental Algorithmics, Association for Computing Machinery, 2015, 20 (1), pp.18. ⟨10.1145/2780652⟩
...
hal-01199860v1  Conference papers
Michele BorassiDavid CoudertPierluigi CrescenziAndrea Marino. On Computing the Hyperbolicity of Real-World Graphs
23rd Annual European Symposium on Algorithms (ESA), Sep 2015, Patras, Greece. pp.215-226, ⟨10.1007/978-3-662-48350-3_19⟩
...
hal-01198461v1  Conference papers
Alvinice KodjoBrigitte JaumardNapoleão NepomucenoMejdi KaddourDavid Coudert. Dimensioning microwave wireless networks
ICC 2015 : IEEE International Conference on Communications, Jun 2015, London, United Kingdom. pp.2803 - 2809, ⟨10.1109/ICC.2015.7248751⟩
...
hal-02125359v1  Reports
Yann BusnelChristelle CaillouetDavid Coudert. VESPA: Constrained target coverage by distributed deployment of connected UAVs
[Research Report] Inria; I3S, Université Côte d'Azur; IMT Atlantique. 2019
...
hal-01753324v1  Journal articles
David CoudertGuillaume Ducoffe. Revisiting Decomposition by Clique Separators
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (1), pp.682 - 694. ⟨10.1137/16M1059837⟩
...
hal-03311598v1  Conference papers
Huy DuongBrigitte JaumardDavid Coudert. Minimum Disturbance Rerouting to Optimize Bandwidth Usage
ONDM 2021 - International Conference on Optical Network Design and Modeling, Jun 2021, Gothenburg, Sweden. pp.1-6, ⟨10.23919/ONDM51796.2021.9492388⟩
...
hal-02465317v1  Reports
Ali Al ZoobiDavid CoudertNicolas Nisse. Space and time trade-off for the k shortest simple paths problem
[Research Report] Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2020
...
hal-02152971v1  Journal articles
David CoudertGuillaume DucoffeAlexandru Popa. P-FPT algorithms for bounded clique-width graphs
ACM Transactions on Algorithms, Association for Computing Machinery, 2019, 15 (3), pp.1-57. ⟨10.1145/3310228⟩
...
hal-03187276v2  Reports
Ali Al ZoobiDavid CoudertNicolas Nisse. On the complexity of finding $k$ shortest dissimilar paths in a graph
[Research Report] Inria; CNRS; I3S; Université Côte d’Azur. 2021, pp.9
...
hal-03461101v1  Conference papers
Igor Dias da SilvaChristelle CaillouetDavid Coudert. Optimizing FANET deployment for mobile sensor tracking in disaster management scenario
7th International Conference on Information and Communication Technologies for Disaster Management (ICT-DM), Dec 2021, Hangzhou, China. pp.134-141, ⟨10.1109/ICT-DM52643.2021.9664204⟩
inria-00530964v1  Book sections
Tibor CinklerDavid CoudertMichele FlamminiGianpiero MonacoLuca Moscardelli et al.  Traffic Grooming: Combinatorial Results and Practical Resolutions.
Arie Koster and Xavier Muñoz. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks., XXVII, Springer, pp.63-94, 2010, EATCS Texts in Theoretical Computer Science, 978-3-642-02249-4. ⟨10.1007/978-3-642-02250-0⟩
...
hal-02865918v1  Conference papers
Ali Al ZoobiDavid CoudertNicolas Nisse. Space and Time Trade-Off for the k Shortest Simple Paths Problem
SEA 2020 - 18th International Symposium on Experimental Algorithms, Jun 2020, Catania, Italy. pp.13, ⟨10.4230/LIPIcs.SEA.2020.18⟩
...
hal-02835953v1  Conference papers
Ali Al ZoobiDavid CoudertNicolas Nisse. Compromis espace-temps pour le problème de k plus courts chemins simples
ALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France. pp.4
...
hal-03345749v1  Journal articles
Brigitte JaumardYan WangDavid Coudert. Dantzig–Wolfe decomposition for the design of filterless optical networks
Journal of Optical Communications and Networking, Piscataway, NJ ; Washington, DC : IEEE : Optical Society of America, 2021, 13 (12), pp.10. ⟨10.1364/JOCN.424415⟩
...
hal-01930552v1  Conference papers
Huy DuongBrigitte JaumardDavid CoudertRon Armolavicius. Efficient Make Before Break Capacity Defragmentation
IEEE International Conference on High Performance Switching and Routing, Jun 2018, Bucharest, Romania. pp.6, ⟨10.1109/HPSR.2018.8850754⟩
...
hal-02267396v1  Conference papers
Yann BusnelChristelle CaillouetDavid Coudert. Self-organized UAV-based Supervision and Connectivity: Challenges and Opportunities
NCA 2019 - 18th IEEE International Symposium on Network Computing and Applications, Sep 2019, Cambridge, United States. pp.1-5, ⟨10.1109/NCA.2019.8935060⟩
...
hal-01676187v1  Conference papers
David CoudertGuillaume DucoffeAlexandru Popa. Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.20, ⟨10.1137/1.9781611975031.176⟩
...
hal-00966851v1  Conference papers
David CoudertDorian MazauricNicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth
13th International Symposium on Experimental Algorithms, 2014, Copenhagen, Denmark. pp.46-58