Publications of David Coudert
Books and proceedings
  1. 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]
     
  2. 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.
    Note: Online proceedings (hal). [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, S. Krco, and K. Wrona, editors. PhD workshop (PhD-NOW), Sophia Antipolis, France, September 2008. I3S, CNRS, Université de Nice Sophia, INRIA.
    Note: Online proceedings (hal). [WWW ] [bibtex-entry]
     
  5. G. Chelius and D. Coudert, editors. 9èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07), number 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. [WWW ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
Articles in journal or book's chapters
  1. David Coudert and Guillaume Ducoffe. Data center interconnection networks are not hyperbolic. Theoretical Computer Science, 639:72-90, August 2016. [WWW ] [PDF ] [bibtex-entry]
     
  2. David Coudert, Guillaume Ducoffe, and Nicolas Nisse. To approximate treewidth, use treelength!. SIAM Journal on Discrete Mathematics, 30(3):1424-1436, 2016. [WWW ] [PDF ] [bibtex-entry]
     
  3. David Coudert and Guillaume Ducoffe. On the hyperbolicity of bipartite graphs and intersection graphs. Discrete Applied Mathematics, 2016. [WWW ] [PDF ] [bibtex-entry]
     
  4. 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]
     
  5. David Coudert, Stéphane Pérennes, Hervé Rivano, and Marie-Emilie Voge. Combinatorial optimization in networks with Shared Risk Link Groups. Discrete Mathematics & Theoretical Computer Science, 18(3):25, May 2016. [WWW ] [PDF ] [bibtex-entry]
     
  6. Deepesh Agarwal, Christelle Caillouet, David Coudert, and Frederic Cazals. Unveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems. Molecular and Cellular Proteomics, 2015. [WWW ] [bibtex-entry]
     
  7. O. Amini, D. Coudert, and N. Nisse. Non-deterministic Graph Searching in Trees. Theoretical Computer Science, 580:101--121, 2015. [WWW ] [Abstract] [bibtex-entry]
     
  8. Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, and Fatima Zahra Moataz. Finding disjoint paths in networks with star shared risk link groups. Theoretical Computer Science, 579:74--87, 2015. [WWW ] [bibtex-entry]
     
  9. Nathann Cohen, David Coudert, and Aurélien Lancin. On computing the Gromov hyperbolicity. ACM Journal on Experimental Algorithmics, 20(1.6), 2015. [WWW ] [Abstract] [bibtex-entry]
     
  10. David Coudert, Alvinice Kodjo, and Truong Khoa Phan. Robust Energy-aware Routing with Redundancy Elimination. Computers & Operations Research, 64:71 85, 2015. [WWW ] [Abstract] [bibtex-entry]
     
  11. G. Classen, D. Coudert, A. M.C.A. Koster, and N. Nepomuceno. Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks. INFORMS Journal of Computing, 26(4):893-909, 2014. [WWW ] [Abstract] [bibtex-entry]
     
  12. D. Coudert and G. Ducoffe. On the recognition of $C\_4$-free and $1/2$-hyperbolic graphs. SIAM Journal on Discrete Mathematics (SIDMA), 28(3):1601-1617, 2014. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  13. 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]
     
  14. D. Coudert, F. Huc, and D. Mazauric. A distributed algorithm for computing the process number in trees. Algorithmica, 63(1-2):158-190, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  15. 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]
     
  16. 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]
     
  17. 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]
     
  18. 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]
     
  19. 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]
     
  20. 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]
     
  21. 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]
     
  22. 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. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  23. D. Coudert, F. Huc, and J.-S. Sereni. Pathwidth of outerplanar graphs. Journal of Graph Theory, 55(1):27-41, May 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  24. 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]
     
  25. 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 (SIDMA), 19(2):523-542, 2005. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  26. 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]
     
  27. 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]
     
  28. D. Coudert, A. Ferreira, and S. Pérennes. Isomorphisms of the De Bruijn Digraph and Free-Space Optical Networks. Networks, 40(3):155-164, October 2002. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  29. 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]
     
  30. 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, December 2000. [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
Conference's articles
  1. 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]
     
  2. 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). [bibtex-entry]
     
  3. Alvinice Kodjo, Brigitte Jaumard, Napoleao Nepomuceno, Mejdi Kaddour, and David Coudert. Dimensioning Microwave Wireless Networks. In IEEE International Conference on Communications (ICC), London, UK, pages 1-6, June 2015. [PDF ] [Abstract] [bibtex-entry]
     
  4. 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, 2014. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  5. 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 ] [Abstract] [bibtex-entry]
     
  6. David Coudert, Dorian Mazauric, and Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth. In Symposium on Experimental Algorithms (SEA), volume 8504 of Lecture Notes in Computer Science, Copenhagen, Denmark, pages 46-58, June 2014. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  7. D. Agarwal, J. Araujo, C. Caillouet, F. Cazals, D. Coudert, and S. Pérennes. Connectivity Inference in Mass Spectrometry based Structure Determination. In European Symposium on Algorithms (ESA), volume 8125 of Lecture Notes in Computer Science, Sophia Antipolis, France, pages 289-300, September 2013. [bibtex-entry]
     
  8. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing with Star SRLGs. In Yann Nisse, Nicolas et Rousseau, Franck et Busnel, editor, Actes des 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, France, pages 1-4, May 2013. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  9. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. SRLG-Diverse Routing with the Star Property. In 9th International Conference on Design of Reliable Communication Networks (DRCN), Budapest, Hungary, pages 1-8, March 2013. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  10. C. Caillouet, D. Coudert, and A. Kodjo. Robust Optimization in Multi-Operators Microwave Backhaul Networks. In IEEE Global Information Infrastrusture and Networking Symposium (GIIS), Trento, Italy, pages 1-6, October 2013. [bibtex-entry]
     
  11. N. Cohen, D. Coudert, and A. Lancin. Algorithme exact et approché pour le calcul de l'hyperbolicité d'un graphe. In Yann Nisse, Nicolas et Rousseau, Franck et Busnel, editor, Algorithme exact et approché pour le calcul de l'hyperbolicité d'un graphe, Pornic, France, pages 1-4, May 2013.
    Note: Page 1-4. [WWW ] [PDF ]
    Keywords: Hyperbolicité, algorithme, graphe, approximation. [Abstract] [bibtex-entry]
     
  12. D. Coudert, A. M.C.A Koster, T. K. Phan, and M. Tieves. Robust Redundancy Elimination for Energy-aware Routing. In IEEE International Conference on Green Computing and Communications (IEEE GreenCom), Beijing, China, pages 1-8, August 2013. [Abstract] [bibtex-entry]
     
  13. S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, and I. Tahiri. Reconfiguration with physical constraints in WDM networks. In IEEE ICC Workshop on New Trends in Optical Networks Survivability, Ottawa, Canada, pages 6346-6350, June 2012. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  14. 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 ]
    Keywords: Diverse routing, SRLG. [Abstract] [bibtex-entry]
     
  15. D. Coudert, L. Hogie, A. Lancin, D. Papadimitriou, S. Perennes, and I. Tahiri. Feasibility Study on Distributed Simulations of BGP. In 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation (PADS), Zhangjiajie, China, pages 3, July 2012. IEEE. [Abstract] [bibtex-entry]
     
  16. S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, and I. Tahiri. Reconfiguration avec contraintes physiques dans les réseaux WDM. In 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, May 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  17. 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]
     
  18. 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]
     
  19. 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]
     
  20. 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, May 2011. [WWW ] [Abstract] [bibtex-entry]
     
  21. 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. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  22. D. Coudert. Graph searching games for the WDM reconfiguration problem. In 24th European Conference on Operational Research (EURO), Lisbon, Portugal, July 2010.
    Note: Invited talk. [WWW ] [Abstract] [bibtex-entry]
     
  23. D. Coudert, N. Cohen, D. Mazauric, N. Nepomuceno, and N. Nisse. Tradeoffs in routing reconfiguration problems. In M. Gradinariu Potop-Butucaru and H. Rivano, editors, 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Belle Dune, France, June 2010. [WWW ] [PDF ] [bibtex-entry]
     
  24. 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, June 2010. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  25. 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, 2010. Informs. [WWW ] [PDF ] [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. 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]
     
  27. 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. In 16th International Colloquium on Structural Information and Communication Complexity -- SIROCCO, volume 5869 of Lecture Notes in Computer Science, pages 57--71, May 2009. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  28. 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]
     
  29. 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, February 2009. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  30. 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 25-28, June 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  31. D. Coudert, D. Mazauric, and N. Nisse. On Rerouting Connection Requests in Networks with Shared Bandwidth. In A. Koster and V. Lozin, editors, 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]
     
  32. 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, June 2009. IEEE. [WWW ] [PDF ]
    Keywords: Multicommodity network flows, Capacity assignment problem, Fixed wireless networks. [Abstract] [bibtex-entry]
     
  33. 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 49-52, June 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  34. D. Coudert, F. Huc, and D. Mazauric. Algorithme générique pour les jeux de capture dans les arbres. In D. Simplot-Ryl and S. Tixeuil, editors, 10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), Saint-Malo, pages 37-40, May 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  35. D. Coudert, F. Huc, and D. Mazauric. A distributed algorithm for computing and updating the process number of a forest. 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.
    Note: Brief announcement. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  36. 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 ] [Abstract] [bibtex-entry]
     
  37. 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]
     
  38. J-C. Bermond, M. Cosnard, D. Coudert, and S. Perennes. Optimal Solution of the Maximum All Request Path Grooming Problem. In Advanced International Conference on Telecommunications (AICT), 2006. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  39. J-C. Bermond, D. Coudert, X. Muñoz, and I. Sau Valls. 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]
     
  40. D. Coudert, S. Perennes, 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]
     
  41. J-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. In A. Pelc and M. Raynal, editors, 12th International Colloquium on Structural Information and Communication Complexity -- SIROCCO, volume 3499 of Lecture Notes in Computer Science, Le Mont Saint-Michel, France, pages 34-48, May 2005. Springer. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  42. D. Coudert, S. Perennes, Q-C. Pham, and J-S. Sereni. Rerouting requests in WDM networks. In 7ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05), Presqu'île de Giens, France, pages 17-20, May 2005.
    Note: The algorithm for trees (section 3) proposed in this paper in false. A correct one is given in [CHM08]. [PDF ] [Abstract] [bibtex-entry]
     
  43. 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]
     
  44. 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 ] [Abstract] [bibtex-entry]
     
  45. M. Bouklit, D. Coudert, J-F. Lalande, C. Paul, and H. Rivano. Approximate multicommodity flow for WDM networks design. In J. Sibeyn, editor, 10th International Colloquium on Structural Information and Communication Complexity -- SIROCCO, number 17 of Proceedings in Informatics, Umea, Sweden, pages 43--56, 2003. Carleton Scientific. [PDF ] [Abstract] [bibtex-entry]
     
  46. M. Bouklit, D. Coudert, J-F. Lalande, and H. Rivano. Approximation combinatoire de multiflot fractionnaire : améliorations. In 5ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'03), Banyuls-sur-mer, France, May 2003. [PDF ] [Abstract] [bibtex-entry]
     
  47. 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]
     
  48. D. Coudert and H. Rivano. Routage optique dans les réseaux WDM multifibres avec conversion partielle.. In 4ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'02), Mèze, France, pages 17-24, May 2002. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  49. D. Coudert and H. Rivano. Lightpath assignment for multifibers WDM networks with wavelength translators. In IEEE Global Telecommunications Conference -- GLOBECOM, volume 3, pages 2686--2690, November 2002.
    Note: OPNT-01-5. [PDF ] [Abstract] [bibtex-entry]
     
  50. 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 ] [Abstract] [bibtex-entry]
     
  51. 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. [PDF ] [Abstract] [bibtex-entry]
     
  52. D. Coudert. Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications. In 3ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'01), St-Jean de Luz, France, pages 47-53, May 2001. [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  53. 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]
     
  54. 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]
     
  55. 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]
     
  56. 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]
     
  57. D. Coudert, A. Ferreira, and S. Perennes. Theoretical Aspects of the Optical Transpose Interconnecting System Architecture. In 1ère Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99), Roscoff, France, pages 101-106, May 1999. [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  58. 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. David Coudert and Guillaume Ducoffe. Clique-decomposition revisited. Research Report hal-01266147, INRIA Sophia Antipolis - I3S, February 2016. [WWW ] [PDF ]
    Keywords: planar graphs, treewidth, clique-decomposition, minimal triangulation, clique-number, bounded-degree graphs. [bibtex-entry]
     
  2. 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]
     
  3. David Coudert and Guillaume Ducoffe. On the hyperbolicity of bipartite graphs and intersection graphs. Research Report hal-01220132, INRIA Sophia Antipolis - Méditerranée ; I3S ; Universite Nice Sophia Antipolis ; CNRS, October 2015. [WWW ] [PDF ]
    Keywords: Gromov hyperbolicity, bipartite graph, intersection graph, graph power, line graph, clique graph, biclique graph. [bibtex-entry]
     
  4. 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 ] [bibtex-entry]
     
  5. 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. [Abstract] [bibtex-entry]
     
  6. 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]
     
  7. 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]
     
  8. 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]
     
  9. 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 ] [bibtex-entry]
     
  10. D. Coudert, L. 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 ]
    Keywords: Discrete event Simulation, Distributed Simulation, Network, BGP. [bibtex-entry]
     
  11. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing with the star property. Research Report RR-8071, INRIA, September 2012. [WWW ] [bibtex-entry]
     
  12. N. Cohen, D. Coudert, and A. Lancin. Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs. Rapport de recherche RR-8074, INRIA, September 2012. [WWW ] [PDF ]
    Keywords: Hyperbolicity, algorithm, graph, exact, approximation. [Abstract] [bibtex-entry]
     
  13. 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]
     
  14. 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]
     
  15. 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]
     
  16. J-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, 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]
     
  17. 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]
     
  18. 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]
     
  19. D. Coudert, F. Giroire, and I. Sau. Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids. Technical report RR-6910, INRIA, April 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  20. 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]
     
  21. J.-C. Bermond, I. Caragiannis, D. Coudert, F. Diedrich, L. Hogie, F. Huc, C. Molle, J. Monteiro, P. Leone, H. Rivano, and I. Sau Valls. 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]
     
  22. D. Coudert, F. Huc, and D. Mazauric. A distributed algorithm for computing and updating the process number of a forest. Research Report 6560, INRIA, June 2008. [WWW ] [Abstract] [bibtex-entry]
     
  23. D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J-S. Sereni. Routing Reconfiguration/Process Number: Coping with Two Classes of Services. Technical report RR-6698, INRIA, October 2008. [WWW ] [Abstract] [bibtex-entry]
     
  24. D. Coudert and D. Mazauric. Network Reconfiguration using Cops-and-Robber Games. Technical report inria-00315568, INRIA, August 2008. [WWW ] [Abstract] [bibtex-entry]
     
  25. 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]
     
  26. O. Amini, D. Coudert, and N. Nisse. Some results on non-deterministic graph searching in trees. Technical report inria-00174965, HAL, September 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  27. J.-C. Bermond, I. Caragiannis, D. Coudert, C. Gomes, I. Guerin-Lassous, G. Huiban, C. Molle, and I. Sau Valls. 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]
     
  28. J-C. Bermond, D. Coudert, and B. Lévêque. Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring. Technical report inria-00175795, hal, October 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  29. 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]
     
  30. 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]
     
  31. 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]
     
  32. 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]
     
  33. D. Coudert, P. Datta, S. Perennes, 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]
     
  34. 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]
     
  35. 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]
     
  36. 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]
     
  37. 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]
     
  38. D. Coudert and H. Rivano. Lightpath assignment for multifibers WDM optical networks with wavelength translators. Research Report, INRIA Research Report 4487, 2002. [WWW ] [Abstract] [bibtex-entry]
     
  39. 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]
     
  40. 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. D. Coudert. Etudes sur la faisabilité des réseaux à interconnexions optiques: Des modèles aux conceptions. Master's thesis, ENS Lyon, LIP -- ENS Lyon, with A. Ferreira, 1997. [POSTSCRIPT ] [bibtex-entry]
     
  2. 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]
     
  3. D. Coudert. Contribution à l'implantation d'algorithmes géométriques sur machines parallèles. Master's thesis, ENS Lyon, LIP -- ENS Lyon, with T. Duboux, 1995. [POSTSCRIPT ] [bibtex-entry]
     



This document was translated from BibTEX by bibtex2html