Publications of David Coudert

BACK TO COATI PUBLICATION INDEX

Publications of David Coudert

Books and proceedings

1. David Coudert and Emanuele Natale, editors. 19th International Symposium on Experimental Algorithms (SEA 2021), volume 190, Nice, France, June 2021. David Coudert and Emanuele Natale, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. [WWW ] [bibtex-entry]
    
2. D. Coudert and D. Simplot-Ryl, editors. Ad Hoc & Sensor Wireless Networks, an International Journal -- Special issue on Ad hoc, Mobile and Wireless Networks, volume 9. Old City Publishing, 2010. [WWW ] [bibtex-entry]
    
3. D. Coudert, D. Simplot-Ryl, and I. Stojmenovic, editors. 7th International Conference on AD-HOC Networks & Wireless (AdHoc-NOW), volume 5198 of Lecture Notes in Computer Science, September 2008. Springer. [WWW ] [bibtex-entry]
    
4. D. Coudert, V. Issarny, and N. Georgantas, editors. 1st International Workshop on Ad-hoc Ambient Computing (AdhocAmC), Sophia Antipolis, France, September 2008. I3S, CNRS, Université de Nice Sophia, INRIA. [WWW ] [bibtex-entry]
    
5. D. Coudert, S. Krco, and K. Wrona, editors. PhD workshop (PhD-NOW), Sophia Antipolis, France, September 2008. I3S, CNRS, Université de Nice Sophia, INRIA. [WWW ] [bibtex-entry]
    
6. G. Chelius and D. Coudert, editors. Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07), volume 9, Ile d'Oléron, France, May 2007. CNRS, LaBRI, Université Bordeaux I. [WWW ] [bibtex-entry]
    

Thesis

1. D. Coudert. Algorithmique et optimisation dans les réseaux de télécommunications. Habilitation à Diriger des Recherches, Université de Nice Sophia-Antipolis (UNS), March 2010. [WWW ] [PDF ] [bibtex-entry]
    
2. D. Coudert. Algorithmique et optimisation de réseaux de communications optiques. PhD thesis, Université de Nice Sophia-Antipolis (UNSA), Décembre 2001. [POSTSCRIPT ] [Abstract] [bibtex-entry]
    

Articles in journal or book's chapters

1. Huy Duong, Brigitte Jaumard, David Coudert, and Romualdas Armolavicius. Efficient Make-Before-Break Layer 2 Reoptimization. IEEE/ACM Transactions on Networking, 29(5):1910-1921, October 2021. [WWW ] [PDF ]
   Keywords: Network reconfiguration, rerouting, reoptimization, make-before-break. [bibtex-entry]
    
2. Matteo Frigo, Emilio Cruciani, David Coudert, Rachid Deriche, Samuel Deslauriers-Gauthier, and Emanuele Natale. Network alignment and similarity reveal atlas-based topological differences in structural connectomes. Network Neuroscience, May 2021. [WWW ] [PDF ]
   Keywords: Weisfeiler-Lehman, graph Jaccard index, graph alignment, structural connectome, brain network topology, neuroscience, OPAL-Meso, brain parcellation, brain network, graph matching, Network alignment. [bibtex-entry]
    
3. Brigitte Jaumard, Yan Wang, and David Coudert. Dantzig--Wolfe decomposition for the design of filterless optical networks. Journal of Optical Communications and Networking, 13(12):10, 2021. [WWW ] [PDF ] [bibtex-entry]
    
4. Daniela Aguirre-Guerrero, Guillaume Ducoffe, Lluis Fabrega, Pere Vila, and David Coudert. Low Time Complexity Algorithms for Path Computation in Cayley Graphs. Discrete Applied Mathematics, 259:218-225, April 2019. [WWW ] [PDF ]
   Keywords: interconnection networks, Cayley graphs, path computation, K-shortest paths. [bibtex-entry]
    
5. David Coudert, Guillaume Ducoffe, and Alexandru Popa. P-FPT algorithms for bounded clique-width graphs. ACM Transactions on Algorithms, 15(3):1-57, June 2019. [WWW ] [PDF ] [bibtex-entry]
    
6. Brigitte Jaumard, Hamed Pouya, and David Coudert. Wavelength Defragmentation for Seamless Migration. Journal of Lightwave Technology, 37(17):4382-4393, September 2019. [WWW ] [PDF ]
   Keywords: Network Reconfig- uration, Network Reconfiguration, Fragmented Network, Routing and Wavelength Assignment, Wavelength Defragmentation, Seamless Defragmentation, Make-Before-Break Rerouting. [bibtex-entry]
    
7. David Coudert, Guillaume Ducoffe, Nicolas Nisse, and Mauricio Soto. On distance-preserving elimination orderings in graphs: Complexity and algorithms. Discrete Applied Mathematics, 243:140-153, March 2018. [WWW ] [PDF ]
   Keywords: bounded treewidth, integer linear programming, Keyword: distance-preserving elimination ordering, metric graph theory, NP-complete, exact exponential algorithm. [bibtex-entry]
    
8. David Coudert and Guillaume Ducoffe. Revisiting Decomposition by Clique Separators. Siam Journal on Discrete Mathematics, 32(1):682 - 694, January 2018. [WWW ] [PDF ]
   Keywords: Keyword: clique minimal separator decomposition, minimal triangulation, clique-number, treewidth, planar graphs, bounded-degree graphs. [bibtex-entry]
    
9. Nathann Cohen and David Coudert. Le défi des 1001 graphes. Interstices, December 2017. [WWW ]
   Keywords: théorie des graphes, cycle hamiltonien, algorithmes. [bibtex-entry]
    
10. Nathann Cohen, David Coudert, Guillaume Ducoffe, and Aurélien Lancin. Applying clique-decomposition for computing Gromov hyperbolicity. Theoretical Computer Science, 690:114-139, 2017. [WWW ] [PDF ]
    Keywords: clique-decomposition, graph algorithms, outerplanar graphs, Gromov hyperbolicity. [bibtex-entry]
     
11. Brigitte Jaumard, Mejdi Kaddour, Alvinice Kodjo, Napoleão Nepomuceno, and David Coudert. Cost-effective Bandwidth Provisioning in Microwave Wireless Networks under Unreliable Channel Conditions. Pesquisa Operacional, 37(3):525 - 544, September 2017. [WWW ] [PDF ]
    Keywords: column generation, microwave networks, mixed-integer linear programming. [bibtex-entry]
     
12. Sahel Sahhaf, Wouter Tavernier, Dimitri Papadimitriou, Davide Careglio, Alok Kumar, Christian Glacet, David Coudert, Nicolas Nisse, Lluis Fàbrega, Pere Vilà, Miguel Camelo, Pieter Audenaert, Didier Colle, and Piet Demeester. Routing at Large Scale: Advances and Challenges for Complex Networks. IEEE Network, pp 12 - 22, 2017. [WWW ] [PDF ]
    Keywords: Complex networks, Geometric routing, Compact routing, Algebraic routing, Path-vector routing. [bibtex-entry]
     
13. David Coudert, Guillaume Ducoffe, and Nicolas Nisse. To Approximate Treewidth, Use Treelength!. Siam Journal on Discrete Mathematics, 30(3):13, 2016. [WWW ] [PDF ]
    Keywords: Graph, Treewidth, Treelength, Cycle basis, Genus. [bibtex-entry]
     
14. David Coudert and Guillaume Ducoffe. Data center interconnection networks are not hyperbolic. Theoretical Computer Science, 639:72-90, 2016. [WWW ] [PDF ]
    Keywords: interconnection network, data center, Cayley graph, greedy routing scheme, metric embedding, graph endomorphism, Gromov hy-perbolicity. [bibtex-entry]
     
15. David Coudert and Guillaume Ducoffe. On the hyperbolicity of bipartite graphs and intersection graphs. Discrete Applied Mathematics, 214:187-195, 2016. [WWW ] [PDF ]
    Keywords: biclique graph, line graph, clique graph, Gromov hyperbolicity, bipartite graph, intersection graph, graph power. [bibtex-entry]
     
16. David Coudert, Dorian Mazauric, and Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth. ACM Journal of Experimental Algorithmics, 21(1):23, 2016. [WWW ] [PDF ] [bibtex-entry]
     
17. David Coudert, Stéphane Pérennes, Hervé Rivano, and Marie-Emilie Voge. Combinatorial optimization in networks with Shared Risk Link Groups. Discrete Mathematics and Theoretical Computer Science, Vol. 18, no 3:25, May 2016. [WWW ] [PDF ]
    Keywords: colored graphs, Shared Risk Link Group, complexity, algorithms, Multi-layer networks. [bibtex-entry]
     
18. Deepesh Agarwal, Christelle Caillouet, David Coudert, and Frédéric Cazals. Unveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems. Molecular and Cellular Proteomics, 14:2274-2284, April 2015. [WWW ] [PDF ]
    Keywords: Biophysics, Bioinformatics, Mathematical Modeling, connectivity inference, Algorithms, Mass Spectrometry, Structural Biology. [Abstract] [bibtex-entry]
     
19. Omid Amini, David Coudert, and Nicolas Nisse. Non-deterministic graph searching in trees. Journal of Theoretical Computer Science (TCS), 580:101-121, May 2015. [WWW ] [PDF ]
    Keywords: Pathwidth, Trees, Graph Searching, Treewidth. [Abstract] [bibtex-entry]
     
20. Jean-Claude Bermond, David Coudert, Gianlorenzo D 'angelo, and Fatima Zahra Moataz. Finding disjoint paths in networks with star shared risk link groups. Journal of Theoretical Computer Science (TCS), 579:74-87, May 2015. [WWW ] [PDF ]
    Keywords: Diverse routing, Shared Risk Link Group, Complexity, Algorithms, Disjoint paths, Colored graph. [Abstract] [bibtex-entry]
     
21. Nathann Cohen, David Coudert, and Aurélien Lancin. On computing the Gromov hyperbolicity. ACM Journal on Experimental Algorithmics, 20(1):18, 2015. [WWW ] [PDF ]
    Keywords: Algorithms, Gromov Hyperbolicity, Networks. [Abstract] [bibtex-entry]
     
22. David Coudert, Alvinice Kodjo, and Truong Khoa Phan. Robust Energy-aware Routing with Redundancy Elimination. Computers and Operations Research, 64:21, December 2015. [WWW ] [PDF ]
    Keywords: Robust Network Optimization, Green Networking, Energy-aware Routing, Redundancy Elimination. [Abstract] [bibtex-entry]
     
23. Grit Classen, David Coudert, Arie Koster, and Napoleao Nepomuceno. Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks. INFORMS Journal on Computing, 26(4):893-909, 2014. [WWW ] [PDF ]
    Keywords: network reliability, fixed wireless networks, capacitated network design, integer programming, chance-constrained programming. [bibtex-entry]
     
24. David Coudert and Guillaume Ducoffe. Recognition of C4-free and 1/2-hyperbolic graphs. Siam Journal on Discrete Mathematics, 28(3):1601-1617, September 2014. [WWW ] [PDF ]
    Keywords: rectangular matrix multiplication, Hyperbolicity, discrete metric space, graph algorithms, C4-free graphs, rectangular matrix multiplication.. [bibtex-entry]
     
25. J-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, and F. Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Theoretical Computer Science (TCS), 444:3-16, July 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
26. D. Coudert, F. Huc, and D. Mazauric. A Distributed Algorithm for Computing the Node Search Number in Trees. Algorithmica, 63(1-2):158-190, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
27. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theoretical Computer Science (TCS), 412(35):4675-4687, August 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
28. D. Coudert, F. Giroire, and I. Sau. Circuits in graphs through a prescribed set of ordered vertices. Journal of Interconnection Networks (JOIN), 11(3-4):121-141, 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
29. D. Coudert and J-S. Sereni. Characterization of graphs and digraphs with small process number. Discrete Applied Mathematics (DAM), 159(11):1094-1109, July 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
30. T. Cinkler, D. Coudert, M. Flammini, G. Monaco, L. Moscardelli, X. Muñoz, I. Sau, M. Shalom, and S. Zaks. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks, volume XXVII of EATCS Texts in Theoretical Computer Science, chapter Traffic Grooming: Combinatorial Results and Practical Resolutions, pages 63-94. Springer, A. Koster and X. Muñoz edition, 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
31. D. Coudert, N. Nepomuceno, and H. Rivano. Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks. Computer Communications, Special Section on Hot Topics in Mesh Networking, 33(8):898-906, May 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
32. J-C. Bermond, D. Coudert, and B. Lévêque. Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring. Journal of Interconnection Networks (JOIN), 9(4):471-486, December 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
33. J-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. Theoretical Computer Science, 384(2-3):139-151, October 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
34. D. Coudert, P. Datta, S. Perennes, H. Rivano, and M-E. Voge. Shared Risk Resource Group: Complexity and Approximability issues. Parallel Processing Letters, 17(2):169-184, June 2007. [PDF ] [Abstract] [bibtex-entry]
     
35. D. Coudert, F. Huc, and J.-S. Sereni. Pathwidth of outerplanar graphs. Journal of Graph Theory, 55(1):27-41, May 2007. [PDF ] [Abstract] [bibtex-entry]
     
36. J-C. Bermond and D. Coudert. Handbook of Combinatorial Designs (2nd edition), volume 42 of Discrete mathematics and Applications, chapter VI.27, Grooming, pages 494-496. Chapman & Hall- CRC Press, editors C.J. Colbourn and J.H. Dinitz, November 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
37. J-C. Bermond, C. Colbourn, D. Coudert, G. Ge, A. Ling, and X. Muñoz. Traffic Grooming in Unidirectional WDM Rings With Grooming Ratio C=6. SIAM Journal on Discrete Mathematics, 19(2):523-542, 2005. [PDF ] [Abstract] [bibtex-entry]
     
38. J-C. Bermond, D. Coudert, and M-L. Yu. On DRC-Covering of $K_n$ by cycles. Journal of Combinatorial Designs, 11(2):100-112, 2003. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
39. D. Coudert and X. Muñoz. Recent Research Developments in Optics, 3, chapter 37, Graph Theory and Traffic Grooming in WDM Rings, pages 759-778. Research Signpost. Kerala, India, 2003.
    Note: ISBN: 81-271-0028-5. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
40. D. Coudert, A. Ferreira, and S. Pérennes. Isomorphisms of the De Bruijn Digraph and Free-Space Optical Networks. Networks (Wiley-Interscience), 40(3):155-164, October 2002. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
41. D. Coudert, A. Ferreira, and X. Muñoz. A Multihop-Multi-OPS Optical Interconnection Network. IEEE/OSA Journal of Lightwave Technology, 18(12):2076-2085, 2000. [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
42. D. Coudert, A. Ferreira, and X. Muñoz. Topologies for Optical Interconnection Networks Based on the Optical Transpose Interconnection System. OSA Applied Optics -- Information Processing, 39(17):2965-2974, June 2000. [POSTSCRIPT ] [Abstract] [bibtex-entry]
     

Conference's articles

1. David Coudert, André Nusser, and Laurent Viennot. Hyperbolicity Computation through Dominating Sets. In ALENEX 2022 - Symposium on Algorithm Engineering and Experiments, Alexandria, VA, United States, pages 78-90, January 2022. [WWW ] [PDF ]
   Keywords: Algorithm engineering, Graph algorithms, Gromov hyperbolicity. [bibtex-entry]
    
2. Ali Al Zoobi, David Coudert, and Nicolas Nisse. De la difficulté de trouver des chemins dissimilaires. In ALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, La Rochelle, France, September 2021. [WWW ] [PDF ]
   Keywords: Similarité entre chemins, $k$ plus courts chemins simples. [bibtex-entry]
    
3. Igor Dias Da Silva, Christelle Caillouet, and David Coudert. Optimizing FANET deployment for mobile sensor tracking in disaster management scenario. In 7th International Conference on Information and Communication Technologies for Disaster Management (ICT-DM), Hangzhou, China, pages 134-141, December 2021. IEEE. [WWW ] [PDF ]
   Keywords: UAVs, disaster management, linear programming, column generation. [bibtex-entry]
    
4. Huy Duong, Brigitte Jaumard, and David Coudert. Minimum Disturbance Rerouting to Optimize Bandwidth Usage. In ONDM 2021 - International Conference on Optical Network Design and Modeling, Gothenburg, Sweden, pages 1-6, June 2021. IEEE. [WWW ] [PDF ]
   Keywords: Network reconfiguration, rerouting, reoptimization, make-before-break. [bibtex-entry]
    
5. Ali Al Zoobi, David Coudert, and Nicolas Nisse. Compromis espace-temps pour le problème de k plus courts chemins simples. In ALGOTEL 2020 -- 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Lyon, France, pages 4, September 2020. [WWW ] [PDF ]
   Keywords: k plus courts chemins simples, algorithmes de graphes, compromis complexité espace-temps. [bibtex-entry]
    
6. Ali Al Zoobi, David Coudert, and Nicolas Nisse. Space and Time Trade-Off for the k Shortest Simple Paths Problem. In SEA 2020 - 18th International Symposium on Experimental Algorithms, volume 160 of Leibniz International Proceedings in Informatics (LIPIcs), Catania, Italy, pages 13, June 2020. Schloss Dagstuhl--Leibniz-Zentrum f'ur Informatik. [WWW ] [PDF ]
   Keywords: k shortest simple paths, graph algorithm, space-time trade-off. [bibtex-entry]
    
7. Yann Busnel, Christelle Caillouet, and David Coudert. VESPA, ou l'art de coordonner une flotte de drone sans leader. In ALGOTEL 2020 -- 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Lyon, France, pages 1-4, September 2020. [WWW ] [PDF ]
   Keywords: Drone, Auto-organisation, Déploiement décentralisé, Gestion de crise, Connectivité réseau. [bibtex-entry]
    
8. Yann Busnel, Christelle Caillouet, and David Coudert. Self-organized Disaster Management System by Distributed Deployment of Connected UAVs. In ICT-DM 2019 - 6th International Conference on Information and Communication Technologies for Disaster Management, Paris, France, pages 1-8, December 2019. [WWW ] [PDF ] [bibtex-entry]
    
9. Yann Busnel, Christelle Caillouet, and David Coudert. Self-organized UAV-based Supervision and Connectivity: Challenges and Opportunities. In NCA 2019 - 18th IEEE International Symposium on Network Computing and Applications, Cambridge, United States, pages 1-5, September 2019. IEEE. [WWW ] [PDF ] [bibtex-entry]
    
10. David Coudert, Guillaume Ducoffe, and Alexandru Popa. Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. In ACM-SIAM Symposium on Discrete Algorithms, New Orleans, United States, pages 20, January 2018. SIAM. [WWW ] [PDF ] [bibtex-entry]
     
11. Huy Duong, Brigitte Jaumard, David Coudert, and Ron Armolavicius. Efficient Make Before Break Capacity Defragmentation. In IEEE International Conference on High Performance Switching and Routing, Bucharest, Romania, pages 6, June 2018. IEEE. [WWW ] [PDF ]
    Keywords: Network reconfiguration, rerouting, defragmentation, make-before-break. [bibtex-entry]
     
12. Huy Duong, Brigitte Jaumard, David Coudert, and Ron Armolavicius. Modèle d'optimisation pour la défragmentation de la capacité. In ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France, May 2018. [WWW ] [PDF ]
    Keywords: Fragmentation des ressources, réseau optique, couche utilisateur, reroutage transparent, reroutage MBB. [bibtex-entry]
     
13. Brigitte Jaumard, Hamed Pouya, and David Coudert. Make-Before-Break Wavelength Defragmentation. In 20th International Conference on Transparent Optical Networks (ICTON), Bucharest, Romania, pages 5, July 2018. IEEE. [WWW ] [PDF ]
    Keywords: Wavelength Defragmentation, Seamless Defragmentation, Make Before Break Rerouting, Routing and Wavelength Assignment, Fragmented Network, Network Reconfiguration. [bibtex-entry]
     
14. David Coudert and Guillaume Ducoffe. A simple approach for lower-bounding the distortion in any Hyperbolic embedding. In EUROCOMB'17 -- The European Conference on Combinatorics, Graph Theory and Applications, volume 61, Vienna, Austria, pages 293 - 299, August 2017. Elsevier. [WWW ] [PDF ]
    Keywords: Gromov hyperbolicity, Hyperbolic space, Cop and Robber games. [bibtex-entry]
     
15. David Coudert, James Luedtke, Eduardo Moreno, and Konstantinos Priftis. Computing and maximizing the exact reliability of wireless backhaul networks. In International Network Optimization Conference, volume 64 of Electronic Notes in Discrete Mathematics, Lisbon, Portugal, pages 85-94, February 2017. Elsevier. [WWW ] [PDF ]
    Keywords: Network design, Backhaul network, Reliability, Optimization. [bibtex-entry]
     
16. Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, and Vassilis Zissimopoulos. Bin Packing with Colocations. In Klaus Jansen and Monaldo Mastrolilli, editors, 14th International Workshop on Approximation and Online Algorithms (WAOA), volume 10138, Aarhus, Denmark, pages 40-51, August 2016. Springer. [WWW ] [PDF ] [bibtex-entry]
     
17. David Coudert and Guillaume Ducoffe. Liens entre symétries et étirements de routages dans les réseaux d'interconnexions de centres de données. In ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Bayonne, France, May 2016. [WWW ] [PDF ]
    Keywords: Mots-clefs : Graphe, Centre de données, Routage géométrique, Endomorphisme de graphe, Hyperbolicité. [bibtex-entry]
     
18. Michele Borassi, David Coudert, Pierluigi Crescenzi, and Andrea Marino. On Computing the Hyperbolicity of Real-World Graphs. In 23rd Annual European Symposium on Algorithms (ESA), volume 9294 of Lecture Notes in Computer Science, Patras, Greece, pages 215-226, September 2015. Springer. [WWW ] [PDF ]
    Keywords: Hyperbolicity, Graph, Algorithm. [Abstract] [bibtex-entry]
     
19. David Coudert, Guillaume Ducoffe, and Nicolas Nisse. Structure vs métrique dans les graphes. In ALGOTEL 2015 - 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, June 2015. [WWW ] [PDF ]
    Keywords: Genre, Hyperbolicité, Graphe, Largeur arborescente (Treewidth), Longueur arborescente (Treelength). [Abstract] [bibtex-entry]
     
20. Alvinice Kodjo, Brigitte Jaumard, Napoleão Nepomuceno, Mejdi Kaddour, and David Coudert. Dimensioning microwave wireless networks. In ICC 2015 : IEEE International Conference on Communications, London, United Kingdom, pages 2803 - 2809, June 2015. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
21. David Coudert, Brigitte Jaumard, and Fatima Zahra Moataz. Dynamic Routing and Spectrum Assignment with Non-Disruptive Defragmentation. In ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Le Bois-Plage-en-Ré, France, pages 1-4, June 2014. [WWW ] [PDF ] [bibtex-entry]
     
22. David Coudert, Alvinice Kodjo, and Khoa Phan. Robust Optimization for Energy-aware Routing with Redundancy Elimination. In ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Le-Bois-Plage-en-Ré, France, pages 1-4, June 2014. [WWW ] [PDF ] [bibtex-entry]
     
23. David Coudert, Dorian Mazauric, and Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth. In 13th International Symposium on Experimental Algorithms, volume 8504 of Lecture Notes in Computer Science, Copenhagen, Denmark, pages 46-58, 2014. [WWW ] [PDF ] [bibtex-entry]
     
24. Alvinice Kodjo, David Coudert, and Christelle Caillouet. Optimisation robuste pour le partage de réseaux d'accès micro-ondes entre opérateurs. In ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France, February 2014. Société française de recherche opérationnelle et d'aide à la décision. [WWW ]
    Keywords: Wireless backhaul network, robust optimization, infrastructure sharing. [bibtex-entry]
     
25. D. Agarwal, J. Araujo, C. Caillouet, F. Cazals, D. Coudert, and S. Perennes. Connectivity Inference in Mass Spectrometry based Structure Determination. In H.L. Bodlaender and G.F. Italiano, editors, European Symposium on Algorithms, volume 8125 of Lecture Notes in Computer Science - LNCS, Sophia-Antipolis, France, France, pages 289-300, 2013. Springer. [WWW ] [bibtex-entry]
     
26. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. SRLG-Diverse Routing with the Star Property. In Design of Reliable Communication Networks, DRCN, Budapest, Hungary, March 2013. [WWW ] [PDF ] [bibtex-entry]
     
27. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing with Star SRLGs. In N. Nisse, Franck Rousseau, and Yann Busnel, editors, 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, France, pages 1-4, May 2013. [WWW ] [PDF ] [bibtex-entry]
     
28. C. Caillouet, D. Coudert, and A. Kodjo. Robust optimization in multi-operators microwave backhaul networks. In 4th Global Information Infrastructure and Networking Symposium, Trento, Italy, pages 1-6, 2013. IEEE. [WWW ] [PDF ] [bibtex-entry]
     
29. N. Cohen, D. Coudert, and A. Lancin. Algorithme exact et approché pour le calcul de l'hyperbolicité d'un graphe. In N. Nisse, Franck Rousseau, and Yann Busnel, editors, 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, France, pages 1-4, May 2013.
    Note: Page 1-4. [WWW ] [PDF ] [bibtex-entry]
     
30. D. Coudert, A. Koster, K. Phan, and M. Tieves. Robust Redundancy Elimination for Energy-aware Routing. In The 2013 IEEE International Conference on Green Computing and Communications (GreenCom 2013), Beijing, China, August 2013. IEEE. [WWW ] [PDF ] [bibtex-entry]
     
31. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing in networks with star SRLGs. In ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) Student Workshop, Nice, France, pages 1-2, December 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
32. D. Coudert, L. Hogie, A. Lancin, D. Papadimitriou, S. Pérennes, and I. Tahiri. Feasibility study on distributed simulations of BGP. In PADS - 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation - 2012, Zhangjiajie, Chine, April 2012. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
33. S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, and I. Tahiri. Reconfiguration avec contraintes physiques dans les réseaux WDM. In Ducourthial et Bertrand et Felber et Pascal, editor, 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
34. G. Classen, D. Coudert, A. Koster, and N. Nepomuceno. A Chance-Constrained Model & Cutting Planes for Fixed Broadband Wireless Networks. In International Network Optimization Conference (INOC), volume 6701 of Lecture Notes in Computer Science, Hamburg, Germany, pages 37-42, June 2011. [PDF ] [Abstract] [bibtex-entry]
     
35. G. Classen, D. Coudert, A. Koster, and N. Nepomuceno. Bandwidth assignment for reliable fixed broadband wireless networks. In 12th IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM), Lucca, Italy, pages 1-6, June 2011. IEEE. [PDF ] [Abstract] [bibtex-entry]
     
36. D. Coudert, N. Nepomuceno, and I. Tahiri. Optimisation de la consommation énergétique dans les réseaux sans fil fixes. In Pascal Ducourthial, Bertrand et Felber, editor, 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel France, 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
37. D. Coudert, N. Nepomuceno, and I. Tahiri. Energy saving in fixed wireless broadband networks. In International Network Optimization Conference (INOC), volume 6701 of Lecture Notes in Computer Science, Hamburg, Germany, pages 484-489, June 2011. [PDF ] [Abstract] [bibtex-entry]
     
38. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse. Tradeoffs in routing reconfiguration problems. In Maria Gradinariu Potop-Butucaru et Hervé Rivano, editor, 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Belle Dune France, pages 4p, 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
39. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. In P. Boldi and L. Gargano, editors, Fifth International conference on Fun with Algorithms (FUN 2010), volume 6099 of Lecture Notes in Computer Science, Ischia Island, Italy, pages 121-132, June 2010. Springer.
    Note: Http://hal.inria.fr/inria-00495443. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
40. D. Coudert. Graph searching games for the WDM reconfiguration problem. In 24th European Conference on Operational Research (EURO), Lisbon, Portugal, pages 1p, July 2010.
    Note: Invited talk. [WWW ] [Abstract] [bibtex-entry]
     
41. B. Jaumard, N.N. Bhuiyan, S. Sebbah, F. Huc, and D. Coudert. A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks. In IEEE High Performance Switching and Routing (HPSR), Richardson, TX, USA, pages 8p, June 2010. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
42. B. Jaumard, N.N. Bhuiyan, S. Sebbah, F. Huc, and D. Coudert. A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks. In 10th INFORMS Telecommunications Conference, Montréal, Canada, pages 2p, May 2010. Informs. [WWW ] [Abstract] [bibtex-entry]
     
43. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, H. Rivano, I. Sau, and F. Solano Donado. MPLS label stacking on the line network. In L. Fratta et al., editor, IFIP Networking, volume 5550 of Lecture Notes in Computer Science, Aachen, Germany, pages 809-820, May 2009. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
44. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau, and F. Solano Donado. Designing Hypergraph Layouts to GMPLS Routing Strategies. In 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), volume 5869 of Lecture Notes in Computer Science, Piran, Slovenia, pages 57--71, May 2009. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
45. D. Coudert, F. Giroire, and I. Sau. Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids. In J. Kratochvìl and M. Miller, editors, 20th International Workshop on Combinatorial Algorithms -- IWOCA, volume 5874 of Lecture Notes in Computer Science, Hradec nad Moravicì, Czech Republic, pages 134-145, June 2009. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
46. D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J-S. Sereni. Reconfiguration dans les réseaux optiques. In A. Chaintreau and C. Magnien, editors, 11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09), Carry le Rouet, pages 4p, June 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
47. D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J-S. Sereni. Reconfiguration of the Routing in WDM Networks with Two Classes of Services. In 13th Conference on Optical Network Design and Modeling (ONDM), Braunschweig, Germany, pages 6p, February 2009. IEEE. [WWW ] [Abstract] [bibtex-entry]
     
48. D. Coudert, D. Mazauric, and N. Nisse. On Rerouting Connection Requests in Networks with Shared Bandwidth. In DIMAP workshop on Algorithmic Graph Theory (AGT09), volume 32 of Electronic Notes in Discrete Mathematics, Warwick, UK, pages 109-116, March 2009. Elsevier. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
49. D. Coudert, N. Nepomuceno, and H. Rivano. Minimizing Energy Consumption by Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks. In First IEEE WoWMoM Workshop on Hot Topics in Mesh Networking (HotMESH), Kos, Greece, pages 6p, June 2009. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
50. D. Coudert, N. Nepomuceno, and H. Rivano. Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks. In A. Chaintreau and C. Magnien, editors, 11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09), Carry le Rouet, pages 4p, June 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
51. D. Coudert, F. Huc, and D. Mazauric. Computing and updating the process number in trees (short paper). In T. Baker and S. Tixeuil, editors, 12th International Conference On Principles Of DIstributed Systems (OPODIS), volume 5401 of Lecture Notes in Computer Science, Luxor, Egypt, pages 546-550, December 2008. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
52. D. Coudert, F. Huc, and D. Mazauric. A distributed algorithm for computing and updating the process number of a forest (brief announcement). In G. Taubenfeld, editor, 22nd International Symposium on Distributed Computing (DISC), volume 5218 of Lecture Notes in Computer Science, Arcachon, France, pages 500-501, September 2008. Springer. [PDF ] [Abstract] [bibtex-entry]
     
53. D. Coudert, F. Huc, and D. Mazauric. Algorithme générique pour les jeux de capture dans les arbres. In 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08), Saint-Malo, pages 37--40, May 2008. [PDF ] [Abstract] [bibtex-entry]
     
54. D. Coudert, F. Huc, F. Peix, and M.-E. Voge. Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints. In IEEE ICC, number ON01-6, Beijing, China, pages 5170 - 5174, May 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
55. J-C. Bermond, M. Cosnard, D. Coudert, and S. Pérennes. Optimal Solution of the Maximum All Request Path Grooming Problem. In Advanced International Conference on Telecommunications (AICT), pages 6p, 2006. IEEE. [PDF ] [Abstract] [bibtex-entry]
     
56. J-C. Bermond, D. Coudert, X. Muñoz, and I. Sau. Traffic Grooming in Bidirectional WDM ring networks. In IEEE-LEOS ICTON / COST 293 GRAAL, volume 3, pages 19-22, June 2006. [PDF ] [Abstract] [bibtex-entry]
     
57. D. Coudert, S. Pérennes, H. Rivano, and M-E. Voge. Shared Risk Resource Groups and Survivability in Multilayer Networks. In IEEE-LEOS ICTON / COST 293 GRAAL, volume 3, pages 235-238, June 2006.
    Note: Invited Paper. [PDF ] [Abstract] [bibtex-entry]
     
58. J-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. In 12th International Colloquium on Structural Information and Communication Complexity -- SIROCCO, Le Mont Saint-Michel, France, pages 34-48, May 24-26 2005. LNCS 3499. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
59. D. Coudert, S. Perennes, Q-C. Pham, and J-S. Sereni. Rerouting requests in WDM networks. In AlgoTel'05, Presqu'île de Giens, France, pages 17-20, mai 2005. [PDF ] [Abstract] [bibtex-entry]
     
60. J-C. Bermond and D. Coudert. Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory. In IEEE ICC, volume 2, Anchorage, Alaska, pages 1402-1406, May 2003.
    Note: ON07-3. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
61. J-C. Bermond, D. Coudert, and X. Muñoz. Traffic Grooming in Unidirectional WDM Ring Networks: The All-to-all Unitary Case. In The 7th IFIP Working Conference on Optical Network Design & Modelling -- ONDM, Budapest, Hongrie, pages 1135-1153, 2003. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
62. M. Bouklit, D. Coudert, J-F. Lalande, C. Paul, and H. Rivano. Approximate multicommodity flow for WDM networks design. In J. Sibeyn, editor, SIROCCO 10, number 17 of Proceedings in Informatics, Umea, Sweden, pages 43--56, 2003. Carleton Scientific. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
63. M. Bouklit, D. Coudert, J-F. Lalande, and H. Rivano. Approximation combinatoire de multiflot fractionnaire : améliorations. In AlgoTel'03, Banyuls-sur-mer, France, mai 2003. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
64. D. Coudert, H. Rivano, and X. Roche. A combinatorial approximation algorithm for the multicommodity flow problem. In K. Jansen and R. Solis-Oba, editors, WAOA 03, number 2909 of Lecture Notes in Computer Science, Budapest, Hungary, pages 256--259, September 2003. Springer-Verlag. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
65. D. Coudert and H. Rivano. Routage optique dans les réseaux WDM multifibres avec conversion partielle.. In AlgoTel'02, Mèze, France, pages 17-24, May 2002. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
66. D. Coudert and H. Rivano. Lightpath assignment for multifibers WDM networks with wavelength translators. In Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE, volume 3, pages 2686--2690vol.3, 17-21 Nov. 2002.
    Note: OPNT-01-5. [PDF ] [Abstract] [bibtex-entry]
     
67. J-C. Bermond, L. Chacon, D. Coudert, and F. Tillerot. A Note on Cycle Covering. In ACM Symposium on Parallel Algorithms and Architectures -- SPAA, Crete island, Greece, pages 310-311, 4-6 July 2001. [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
68. J-C. Bermond, L. Chacon, D. Coudert, and F. Tillerot. Cycle Covering. In International Colloquium on Structural Information and Communication Complexity -- SIROCCO, Proceedings in Informatics 11, Vall de Nuria, Spain, pages 21-34, 27-29 June 2001. Carleton Scientific. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
69. D. Coudert and X. Muñoz. How Graph Theory can help Communications Engineering. In D.K.Gautam, editor, Broad band optical fiber communications technology -- BBOFCT, Jalgaon, India, pages 47-61, December 2001. Nirtali Prakashan.
    Note: Invited paper. [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
70. D. Coudert. Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications. In Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications -- AlgoTel, St-Jean de Luz, France, pages 47-53, 28-30 Mai 2001. [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
71. J-C. Bermond, L. Chacon, D. Coudert, and F. Tillerot. Conception d'un réseau WDM protégé par sous-réseaux. In 2ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'00), La Rochelle, France, pages 83-88, May 2000. INRIA. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
72. D. Coudert, A. Ferreira, and S. Perennes. De Bruijn Isomorphisms and Free Space Optical Networks. In IEEE International Parallel and Distributed Processing Symposium, pages 769-774, 2000. IEEE Press. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
73. D. Coudert, A. Ferreira, and X. Muñoz. OTIS-Based Multi-Hop Multi-OPS Lightwave Networks. In J. Rolim et al., editor, Proceedings of the Workshop on Optics and Computer Science 1999, volume 1586 of Lecture Notes in Computer Science, pages 897-910, April 1999. Springer Verlag. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
74. D. Coudert, A. Ferreira, and S. Perennes. Theoretical Aspects of the Optical Transpose Interconnecting System Architecture. In Première Rencontres Francophones sur les aspects Algorithmiques des Télécommunications -- AlgoTel, Roscoff, France, pages 101-106, 5-7 Mai 1999. [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
75. D. Coudert, A. Ferreira, and X. Muñoz. Multiprocessor Architectures Using Multi-hops Multi-OPS Lightwave Networks and Distributed Control. In IEEE International Parallel Processing Symposium, pages 151-155, 1998. IEEE Press. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     

Internal reports

1. Ali Al Zoobi, David Coudert, and Nicolas Nisse. Finding the k Shortest Simple Paths: Time and Space trade-offs. Research Report, Inria ; I3S, Université Côte d'Azur, April 2021. [WWW ] [PDF ]
   Keywords: k shortest simple paths, graph algorithm, space-time trade-off. [bibtex-entry]
    
2. Ali Al Zoobi, David Coudert, and Nicolas Nisse. On the complexity of finding $k$ shortest dissimilar paths in a graph. Research Report, Inria ; CNRS ; I3S ; Université Côte d’Azur, 2021. [WWW ] [PDF ] [bibtex-entry]
    
3. David Coudert, Ali Al Zoobi, and Arthur Finkelstein. On finding $k$ earliest arrival time journeys in public transit networks. Research Report, Inria, June 2021. [WWW ] [PDF ]
   Keywords: Journey planning, shortest path, routing, timetables. [bibtex-entry]
    
4. David Coudert, André Nusser, and Laurent Viennot. Enumeration of far-apart pairs by decreasing distance for faster hyperbolicity computation. Research Report, Inria ; I3S, Université Côte d'Azur, April 2021. [WWW ] [PDF ]
   Keywords: Gromov hyperbolicity, Graph algorithms, Far-apart pairs, Enumeration algorithms. [bibtex-entry]
    
5. Ali Al Zoobi, David Coudert, and Nicolas 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, February 2020. [WWW ] [PDF ] [bibtex-entry]
    
6. Yann Busnel, Christelle Caillouet, and David Coudert. VESPA: Constrained target coverage by distributed deployment of connected UAVs. Research Report, Inria ; I3S, Université Côte d'Azur ; IMT Atlantique, May 2019. [WWW ] [PDF ] [bibtex-entry]
    
7. David Coudert, Guillaume Ducoffe, and Alexandru Popa. 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, July 2017. [WWW ] [PDF ]
   Keywords: Fully polynomial FPT, Graph algorithms, Hardness in P, Split decomposition, Neighbourhood diversity, Primeval decomposition, Clique-width, Modular decomposition. [bibtex-entry]
    
8. Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, and Vassilis Zissimopoulos. Bin packing with colocations. Research Report, Inria ; I3S, October 2016. [WWW ] [PDF ] [bibtex-entry]
    
9. David Coudert. A note on Integer Linear Programming formulations for linear ordering problems on graphs. Research Report, Inria ; I3S ; Universite Nice Sophia Antipolis ; CNRS, February 2016. [WWW ] [PDF ] [bibtex-entry]
    
10. David Coudert and Guillaume Ducoffe. Clique-decomposition revisited. Research Report, INRIA Sophia Antipolis - I3S, February 2016. [WWW ] [PDF ]
    Keywords: planar graphs, treewidth, clique-decomposition, minimal triangulation, clique-number, bounded-degree graphs. [bibtex-entry]
     
11. David Coudert, Guillaume Ducoffe, Nicolas Nisse, and Mauricio Soto. Distance-preserving orderings in graphs. Research Report RR-8973, Inria Sophia Antipolis, 2016. [WWW ] [PDF ]
    Keywords: bounded treewidth, distance-preserving elimination ordering, metric graph theory, NP-complete, exact expo- nential algorithm, integer linear programming. [bibtex-entry]
     
12. David Coudert, James Luedtke, Eduardo Moreno, and Konstantinos Priftis. Computing and maximizing the exact reliability of wireless backhaul networks. Research Report, Inria Sophia Antipolis ; I3S, November 2016. [WWW ] [PDF ]
    Keywords: Network design, Backhaul network, Reliability, Optimization. [bibtex-entry]
     
13. David Coudert and Guillaume Ducoffe. Data center interconnection networks are not hyperbolic. Research Report, Inria Sophia Antipolis ; I3S ; Université Nice Sophia Antipolis ; CNRS, May 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
14. Deepesh Agarwal, Christelle Caillouet, David Coudert, and Frédéric Cazals. Unveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems. Research Report RR-8622, Inria, October 2014. [WWW ] [PDF ]
    Keywords: Molecular machines, Mixed integer linear program, Biophysics, Mass spectrometry, Protein assembly, Structural biology, Connectivity Inference Connected induced sub-graphs. [bibtex-entry]
     
15. Nathann Cohen, David Coudert, Guillaume Ducoffe, and Aurélien Lancin. Applying clique-decomposition for computing Gromov hyperbolicity. Research Report RR-8535, INRIA, June 2014. [WWW ] [PDF ]
    Keywords: Hyperbolicity, Algorithms, Graphs, Decomposition. [bibtex-entry]
     
16. David Coudert and Guillaume Ducoffe. On the recognition of $C\_4$-free and $1/2$-hyperbolic graphs. Research Report RR-8458, INRIA, January 2014. [WWW ] [PDF ] [bibtex-entry]
     
17. David Coudert, Guillaume Ducoffe, and Nicolas Nisse. Diameter of Minimal Separators in Graphs. Research Report RR-8639, Inria Sophia Antipolis ; I3S ; INRIA, November 2014. [WWW ] [PDF ] [bibtex-entry]
     
18. David Coudert, Alvinice Kodjo, and Khoa Phan. Robust Energy-aware Routing with Redundancy Elimination. Research Report RR-8457, INRIA, January 2014. [WWW ] [PDF ]
    Keywords: Robust Network Optimization, Green Networking, Energy-aware Routing, Redundancy Elimination. [bibtex-entry]
     
19. David Coudert, Dorian Mazauric, and Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth. Research Report RR-8470, INRIA, February 2014. [WWW ] [PDF ]
    Keywords: Pathwidth, vertex-separation, branch-and-bound, Sage. [bibtex-entry]
     
20. D. Agarwal, J. Araujo, C. Caillouet, F. Cazals, D. Coudert, and S. Pérennes. Connectivity Inference in Mass Spectrometry based Structure Determination. Research Report RR-8320, INRIA, June 2013. [WWW ] [PDF ] [bibtex-entry]
     
21. O. Amini, D. Coudert, and N. Nisse. Some Results on Non-deterministic Graph Searching in Trees. Research Report, 2013. [WWW ] [PDF ] [bibtex-entry]
     
22. D. Coudert, Luc Hogie, A. Lancin, D. Papadimitriou, S. Pérennes, and I. Tahiri. Feasibility study on distributed simulations of BGP. Research Report RR-8283, INRIA, April 2013. [WWW ] [PDF ] [bibtex-entry]
     
23. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing with the star property. Technical report RR-8071, INRIA, September 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
24. N. Cohen, D. Coudert, and A. Lancin. Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs. Technical report RR-8074, INRIA, September 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
25. S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, and I. Tahiri. Reconfiguration with physical constraints in WDM networks. Research Report RR-7850, INRIA, 2011. [WWW ] [PDF ]
    Keywords: Reconfiguration, WDM, NP-complete, Physical Layer Impaiments.. [Abstract] [bibtex-entry]
     
26. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, H. Rivano, I. Sau, and F. Solano Donado. MPLS label stacking on the line network. Technical report RR-6803, INRIA, January 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
27. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau, and F. Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Research Report RR-7071, INRIA, October 2009. [WWW ] [PDF ]
    Keywords: GMPLS, optical networks, label stacking, hypergraph layout, approximation algorithms, dynamic programming.. [Abstract] [bibtex-entry]
     
28. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau, and F. Solano Donado. GMPLS Routing Strategies based on the Design of Hypergraph Layouts. Technical report RR-6842, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
29. J-C. Bermond, D. Coudert, and J. Peters. Online Distributed Traffic Grooming on Path Networks. Technical report RR-6833, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
30. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse. Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks.. Technical report RR-7047, INRIA, September 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
31. D. Coudert, F. Giroire, and I. Sau. Circuit visiting 10 ordered vertices in infinite grids. Technical report RR-6910, INRIA, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
32. D. Coudert, D. Mazauric, and N. Nisse. Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.. Technical report RR-6790, INRIA, January 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
33. J-C. Bermond, I. Caragiannis, D. Coudert, F. Diedrich, L. Hogie, F. Huc, C. Molle, J. Monteiro, P. Leone, H. Rivano, and I. Sau. Algorithmic solutions for critical resource sharing: third year. Technical report Deliverable 2.2.3, IST FET AEOLUS, Integrated Project IST-015964, 2008. [PDF ] [bibtex-entry]
     
34. D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J-S. Sereni. Routing Reconfiguration/Process Number: Coping wih Two Classes of Services. Research Report RR-6698, INRIA, October 2008. [WWW ] [Abstract] [bibtex-entry]
     
35. D. Coudert, F. Huc, and D. Mazauric. A distributed algorithm for computing and updating the process number of a forest. Research Report RR-6560, INRIA, June 2008. [WWW ] [Abstract] [bibtex-entry]
     
36. D. Coudert and D. Mazauric. Network Reconfiguration using Cops-and-Robber Games. Research Report RR-6694, INRIA, August 2008. [WWW ] [Abstract] [bibtex-entry]
     
37. D. Coudert, N. Nepomuceno, and H. Rivano. Wireless Backhaul Networks: Minimizing Energy Consumption by Power Efficient Radio Links Configuration. Technical report RR-6752, INRIA, December 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
38. O. Amini, D. Coudert, and N. Nisse. Some Results on Non-deterministic Graph Searching in Trees. Research Report INRIA-00174965, INRIA, September 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
39. J-C. Bermond, I. Caragiannis, D. Coudert, C. Gomes, I. Guerin-Lassous, G. Huiban, C. Molle, and I. Sau. Algorithmic solutions for critical resource sharing: second year. Technical report Deliverable 2.2.2, IST FET AEOLUS, Integrated Project IST-015964, 2007. [PDF ] [bibtex-entry]
     
40. J-C. Bermond, D. Coudert, and B. Leveque. Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring. Technical report inria-00175795, hal, October 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
41. D. Coudert, F. Huc, F. Peix, and M-E. Voge. On Minimizing the Average Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints. Technical report inria-00175813, hal, October 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
42. D. Coudert, S. Perennes, H. Rivano, and M-E. Voge. Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues. Technical report inria-00175143, HAL, September 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
43. D. Coudert and J-S. Sereni. Characterization of graphs and digraphs with small process number. Research Report 6285, INRIA, September 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
44. J-C. Bermond, D. Coudert, H. Rivano, and M. Syska. Critical resource sharing, State of the art Survey. Technical report Deliverable 2.2.1, IST FET AEOLUS, Integrated Project IST-015964, 2006. [PDF ] [bibtex-entry]
     
45. D. Coudert, P. Datta, S. Pérennes, H. Rivano, and M-E. Voge. Complexity and approximability issues of Shared Risk Resource Group. Technical report, INRIA Research Report 5859 and I3S Research Report I3S/RR-2006-08-FR, 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
46. D. Coudert, F. Huc, and J.S. Sereni. Pathwidth of outerplanar graphs. Technical report, INRIA Research Report 5804 and I3S Research Report I3S/RR-2006-02-FR, January 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
47. J-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. Technical report, INRIA Research Report 5645 (.ps.gz) and I3S Research Report I3S/RR-2005-20-FR (.pdf), 2005. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
48. J-C. Bermond, M. Cosnard, D. Coudert, and S. Perennes. Optimal Solution of the Maximum All Request Path Grooming Problem. Technical report, INRIA Research Report 5627 (.ps.gz) and I3S Research Report I3S/RR-2005-18-FR (.pdf), 2005. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
49. D. Coudert, P. Datta, H. Rivano, and M.-E. Voge. Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks. Research Report, I3S Research Report I3S/RR-2005-37-FR, 2005. [WWW ] [PDF ] [bibtex-entry]
     
50. D. Coudert and H. Rivano. Lightpath assignment for multifibers WDM optical networks with wavelength translators. Research Report, INRIA Research Report 4487, 2002. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
51. J-C. Bermond, D. Coudert, and M-L. Yu. On DRC-Covering of $K_n$ by cycles. Technical report, INRIA Research Report RR-4299, I3S Research Report I3S/RR-2002-30-FR, 2001. [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
52. D. Coudert, A. Ferreira, and S. Perennes. Digraph Isomorphisms and Free Space Optical Networks. Technical report, INRIA Research Report 3817, 1999. [POSTSCRIPT ] [bibtex-entry]
     

Miscellaneous

1. Ali Al Zoobi, David Coudert, and Nicolas Nisse. k shortest simple paths, 2021.
   Note: Software. [WWW ]
   Keywords: k shortest simple paths, Graph algorithms, Space-time trade-off. [bibtex-entry]
    
2. David Coudert, André Nusser, and Laurent Viennot. Hyperbolicity, 2021.
   Note: Software. [WWW ]
   Keywords: Gromov hyperbolicity, Graph algorithms, Algorithm engineering. [bibtex-entry]
    
3. Matteo Frigo, Emilio Cruciani, David Coudert, Rachid Deriche, Emanuele Natale, and Samuel Deslauriers-Gauthier. Network alignment and similarity reveal atlas-based topological differences in structural connectomes.
   Note: Working paper or preprint, December 2020. [WWW ] [PDF ] [bibtex-entry]
    
4. D. Coudert. Etudes sur la faisabilité des réseaux à interconnexions optiques: Des modèles aux conceptions. Master's thesis, LIP -- ENS Lyon, with A. Ferreira, 1997. [POSTSCRIPT ] [bibtex-entry]
    
5. D. Coudert. Simulation de systèmes multi-processeurs à communications électroniques et optiques. Master's thesis, ENS Lyon, UCSD, San Diego (USA), with P. Marchand, 1996. [POSTSCRIPT ] [bibtex-entry]
    
6. D. Coudert. Contribution à l'implantation d'algorithmes géométriques sur machines parallèles. Master's thesis, ENS Lyon, LIP -- ENS Lyon, T. Duboux, Juin 1995. [POSTSCRIPT ] [bibtex-entry]
    

BACK TO COATI PUBLICATION INDEX

---

Last modified: Sat Jan 29 19:00:43 2022