Publications of David Coudert
Books and proceedings
  1. David Coudert and David Simplot-Ryl. 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. David Coudert, Valérie Issarny, and Nikolaos 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. David Coudert, David Simplot-Ryl, and Ivan 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. David Coudert, Srdjan Krco, and Konrad 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. Guillaume Chelius and David 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. David Coudert. Algorithmic and optimisation in telecommunication networks. Habilitation à diriger des recherches, Université Nice Sophia Antipolis, March 2010. [WWW ] [PDF ] [bibtex-entry]
     
  2. David Coudert. Algorithmic and optimisation of optical communication networks. Theses, Université Nice Sophia Antipolis, December 2001. [WWW ] [PDF ] [bibtex-entry]
     
Articles in journal or book's chapters
  1. 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 ] [bibtex-entry]
     
  2. 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]
     
  3. Brigitte Jaumard, Hamed Pouya, and David Coudert. Wavelength Defragmentation for Seamless Migration. Journal of Lightwave Technology, 37(17):4382-4393, September 2019. [WWW ] [PDF ] [bibtex-entry]
     
  4. 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 ] [bibtex-entry]
     
  5. David Coudert and Guillaume Ducoffe. Revisiting Decomposition by Clique Separators. SIAM Journal on Discrete Mathematics, 32(1):682 - 694, January 2018. [WWW ] [PDF ] [bibtex-entry]
     
  6. 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 ] [bibtex-entry]
     
  7. Nathann Cohen and David Coudert. Le défi des 1001 graphes. Interstices, December 2017. [WWW ] [bibtex-entry]
     
  8. 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 ] [bibtex-entry]
     
  9. 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 ] [bibtex-entry]
     
  10. David Coudert and Guillaume Ducoffe. On the hyperbolicity of bipartite graphs and intersection graphs. Discrete Applied Mathematics, 214:187-195, 2016. [WWW ] [PDF ] [bibtex-entry]
     
  11. David Coudert, Guillaume Ducoffe, and Nicolas Nisse. To Approximate Treewidth, Use Treelength!. SIAM Journal on Discrete Mathematics, 30(3):13, 2016. [WWW ] [PDF ] [bibtex-entry]
     
  12. David Coudert and Guillaume Ducoffe. Data center interconnection networks are not hyperbolic. Theoretical Computer Science, 639:72-90, 2016. [WWW ] [PDF ] [bibtex-entry]
     
  13. 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]
     
  14. 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, 18(3):25, May 2016. [WWW ] [PDF ] [bibtex-entry]
     
  15. 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 ] [bibtex-entry]
     
  16. Omid Amini, David Coudert, and Nicolas Nisse. Non-deterministic graph searching in trees. Theoretical Computer Science, 580:101-121, May 2015. [WWW ] [PDF ] [bibtex-entry]
     
  17. 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, May 2015. [WWW ] [PDF ] [bibtex-entry]
     
  18. Nathann Cohen, David Coudert, and Aurélien Lancin. On computing the Gromov hyperbolicity. ACM Journal of Experimental Algorithmics, 20(1):18, 2015. [WWW ] [PDF ] [bibtex-entry]
     
  19. 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 ] [bibtex-entry]
     
  20. 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 ] [bibtex-entry]
     
  21. 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 ] [bibtex-entry]
     
  22. Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau Valls, and Fernando Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Theoretical Computer Science, 444:3-16, July 2012. [WWW ] [PDF ] [bibtex-entry]
     
  23. David Coudert, Florian Huc, and Dorian Mazauric. A Distributed Algorithm for Computing the Node Search Number in Trees. Algorithmica, 63(1):158-190, 2012. [WWW ] [PDF ] [bibtex-entry]
     
  24. Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno, and Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theoretical Computer Science, 412(35):4675-4687, 2011. [WWW ] [PDF ] [bibtex-entry]
     
  25. David Coudert, Frédéric Giroire, and Ignasi Sau Valls. Circuits in graphs through a prescribed set of ordered vertices. Journal of Interconnection Networks, 11(3-4):121-141, 2011. [WWW ] [PDF ] [bibtex-entry]
     
  26. David Coudert and Jean-Sébastien Sereni. Characterization of graphs and digraphs with small process number. Discrete Applied Mathematics, 159(11):1094-1109, July 2011. [WWW ] [PDF ] [bibtex-entry]
     
  27. Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau Valls, Mordechai Shalom, and Shmuel Zaks. Traffic Grooming: Combinatorial Results and Practical Resolutions.. In Arie Koster and Xavier Muñoz, editors,Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks., volume XXVII of EATCS Texts in Theoretical Computer Science, pages 63-94. Springer, January 2010. [WWW ] [bibtex-entry]
     
  28. David Coudert, Napoleão Nepomuceno, and Hervé Rivano. Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks. Computer Communications, 33(8):898-906, 2010. [WWW ] [bibtex-entry]
     
  29. Jean-Claude Bermond, David Coudert, and Benjamin Lévêque. Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring. Journal of Interconnection Networks, 9(4):471-486, 2008. [WWW ] [PDF ] [bibtex-entry]
     
  30. Jean-Claude Bermond, Laurent Braud, and David Coudert. Traffic Grooming on the Path. Theoretical Computer Science, 384(2-3):139-151, 2007. [WWW ] [PDF ] [bibtex-entry]
     
  31. David Coudert, P. Datta, Stéphane Pérennes, Hervé Rivano, and Marie-Emilie Voge. Shared Risk Resource Group: Complexity and Approximability issues. Parallel Processing Letters, 17(2):169-184, 2007. [WWW ] [PDF ] [bibtex-entry]
     
  32. David Coudert, Florian Huc, and Jean-Sébastien Sereni. Pathwidth of outerplanar graphs. Journal of Graph Theory, 55(1):27 - 41, 2007. [WWW ] [PDF ] [bibtex-entry]
     
  33. Jean-Claude Bermond and David Coudert. Grooming. In Charles J. Colbourn and Jeffrey H. Dinitz, editors,Handbook of Combinatorial Designs (2nd edition), volume 42 of Discrete mathematics and Applications, pages 494-496. Chapman & Hall- CRC Press, 2006.
    Note: Chapter VI.27. [WWW ] [PDF ] [bibtex-entry]
     
  34. Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, and Xavier Munoz. Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6. SIAM Journal on Discrete Mathematics, 19(2):523-542, 2005. [WWW ] [PDF ] [bibtex-entry]
     
  35. Jean-Claude Bermond, David Coudert, and Min-Li Yu. On DRC-covering of Kn by cycles. Journal of Combinatorial Designs, 11(2):100 - 112, 2003. [WWW ] [PDF ] [bibtex-entry]
     
  36. David Coudert and Xavier Munoz. Graph Theory and Traffic Grooming in WDM Rings. In S.G. Pandalai, editor,Recent Research Developments in Optics, volume 3, pages 759-778. Research Signpost, 2003. [WWW ] [PDF ] [bibtex-entry]
     
  37. David Coudert, Afonso Ferreira, and Stéphane Pérennes. Isomorphisms of the De Bruijn digraph and free-space optical networks. Networks, 40(3):155 - 164, October 2002. [WWW ] [PDF ] [bibtex-entry]
     
  38. David Coudert, Afonso Ferreira, and Xavier Munoz. Topologies for Optical Interconnection Networks Based on the Optical Transpose Interconnection System. OSA Applied Optics -- Information Processing, 39(17):2965-2974, June 2000. [WWW ] [PDF ] [bibtex-entry]
     
  39. David Coudert, Afonso Ferreira, and Xavier Munoz. A multihop multi-OPS optical interconnection network. Journal of Lightwave Technology, 18(12):2076 - 2085, December 2000. [WWW ] [PDF ] [bibtex-entry]
     
Conference's articles
  1. 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, June 2021. [WWW ] [PDF ] [bibtex-entry]
     
  2. 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 ] [bibtex-entry]
     
  3. 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 ] [bibtex-entry]
     
  4. 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 ] [bibtex-entry]
     
  5. 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]
     
  6. 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]
     
  7. 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]
     
  8. 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 ] [bibtex-entry]
     
  9. 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 ] [bibtex-entry]
     
  10. 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 ] [bibtex-entry]
     
  11. 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 ] [bibtex-entry]
     
  12. 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 ] [bibtex-entry]
     
  13. 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]
     
  14. 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 ] [bibtex-entry]
     
  15. 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 ] [bibtex-entry]
     
  16. 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 ] [bibtex-entry]
     
  17. 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 ] [bibtex-entry]
     
  18. 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]
     
  19. 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]
     
  20. 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]
     
  21. 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 ] [bibtex-entry]
     
  22. Deepesh Agarwal, Julio Araujo, Christelle Caillouet, Frédéric Cazals, David Coudert, and Stéphane Perennes. Connectivity Inference in Mass Spectrometry based Structure Determination. In Bodlaender, H.L., Italiano, and G.F., editors, European Symposium on Algorithms, volume 8125 of Lecture Notes in Computer Science - LNCS, Sophia-Antipolis, France, France, pages 289-300, September 2013. Springer. [WWW ] [bibtex-entry]
     
  23. Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, and Fatima Zahra Moataz. Diverse Routing with Star SRLGs. In Nisse, Nicolas, Rousseau, Franck, Busnel, and Yann, 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]
     
  24. Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, and Fatima Zahra Moataz. SRLG-Diverse Routing with the Star Property. In Design of Reliable Communication Networks, DRCN, Budapest, Hungary, March 2013. [WWW ] [PDF ] [bibtex-entry]
     
  25. Christelle Caillouet, David Coudert, and Alvinice Kodjo. Robust optimization in multi-operators microwave backhaul networks. In 4th Global Information Infrastructure and Networking Symposium, Trento, Italy, pages 1-6, October 2013. IEEE. [WWW ] [PDF ] [bibtex-entry]
     
  26. Nathann Cohen, David Coudert, and Aurélien Lancin. Algorithme exact et approché pour le calcul de l'hyperbolicité d'un graphe. In Nisse, Nicolas, Rousseau, Franck, Busnel, and Yann, editors, AlgoTel 2013 - 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Pornic, France, pages 1-4, May 2013.
    Note: Page 1-4. [WWW ] [PDF ] [bibtex-entry]
     
  27. David Coudert, Arie Koster, Khoa Phan, and Tieves Martin. 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]
     
  28. Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, and Issam Tahiri. Reconfiguration with physical constraints in WDM networks. In Workshop on New Trends in Optical Networks Survivability, Canada, pages 5, 2012. [WWW ] [PDF ] [bibtex-entry]
     
  29. Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, and Fatima Zahra Moataz. Diverse Routing in Networks with Star SRLGs. In ACM CoNEXT Student Workshop, Nice, France, pages 1-2, December 2012. [WWW ] [PDF ] [bibtex-entry]
     
  30. David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, and Issam Tahiri. Feasibility study on distributed simulations of BGP. In PADS 2012 - 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation, Zhangjiajie, China, July 2012. IEEE.
    Note: Https://arxiv.org/abs/1209.0943. [WWW ] [PDF ] [bibtex-entry]
     
  31. Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, and Issam Tahiri. Reconfiguration avec contraintes physiques dans les réseaux WDM. In Ducourthial, Bertrand et Felber, and Pascal, editors, 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, 2011. [WWW ] [PDF ] [bibtex-entry]
     
  32. Grit Classen, David Coudert, Arie Koster, and Napoleao Nepomuceno. A Chance-Constrained Model & Cutting Planes for Fixed Broadband Wireless Networks. In Internationale Network Optimization Conference (INOC), volume 6701 of Lecture Notes in Computer Science, Hamburg, Germany, pages 37-42, June 2011. Springer. [WWW ] [PDF ] [bibtex-entry]
     
  33. Grit Classen, David Coudert, Arie Koster, and Napoleao 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. [WWW ] [PDF ] [bibtex-entry]
     
  34. David Coudert, Napoleão Nepomuceno, and Issam Tahiri. Optimisation de la consommation énergétique dans les réseaux sans fil fixes. In Ducourthial, Bertrand et Felber, and Pascal, editors, 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, 2011. [WWW ] [PDF ] [bibtex-entry]
     
  35. David Coudert, Napoleao Nepomuceno, and Issam Tahiri. Energy saving in fixed wireless broadband networks. In Internationale Network Optimization Conference (INOC), volume 6701 of Lecture Notes in Computer Science, Hamburg, Germany, pages 484-489, June 2011. Springer. [WWW ] [PDF ] [bibtex-entry]
     
  36. Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, and Nicolas 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 0, 2010. [WWW ] [PDF ] [bibtex-entry]
     
  37. Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno, and Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. In Paola Boldi and Luisa Gargano, editors, Fifth International conference on Fun with Algorithms (FUN 2010), volume 6099 of Lecture Notes in Computer Science, Ischia, Italy, pages 121-132, June 2010. Springer. [WWW ] [PDF ] [bibtex-entry]
     
  38. David Coudert. Graph searching games for the WDM reconfiguration problem. In 24th European Conference on Operational Research (EURO), Lisbon, Portugal, July 2010. [WWW ] [bibtex-entry]
     
  39. Brigitte Jaumard, Nazmun Nahar Bhuiyan, Samir Sebbah, Florian Huc, and David Coudert. A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks. In 10th INFORMS Telecommunications Conference, Montréal, Canada, May 2010. [WWW ] [bibtex-entry]
     
  40. Brigitte Jaumard, Nazmun Nahar Bhuiyan, Samir Sebbah, Florian Huc, and David Coudert. A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks. In 11th International Conference on High Performance Switching and Routing (HPSR), Richardson, Texas, USA, Canada, pages 8, June 2010. IEEE. [WWW ] [PDF ] [bibtex-entry]
     
  41. Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, and Fernando Solano Donado. MPLS label stacking on the line network. In Springer, editor, IFIP Networking, LNCS 5550/2009, Aachen, Germany, pages 809-820, May 2009. [WWW ] [PDF ] [bibtex-entry]
     
  42. Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, and Fernando Solano Donado. Designing Hypergraph Layouts to GMPLS Routing Strategies. In SIROCCO, Piran, Slovenia, May 2009. [WWW ] [PDF ] [bibtex-entry]
     
  43. David Coudert, Frédéric Giroire, and Ignasi Sau Valls. Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids. In International Workshop on Combinatorial Algorithms -- IWOCA, volume 5874 of Lecture Notes in Computer Science, Hradec nad Moravici, Czech Republic, June 2009. Springer. [WWW ] [PDF ] [bibtex-entry]
     
  44. David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse, and Jean-Sébastien Sereni. Reconfiguration dans les réseaux optiques. In Chaintreau, Augustin, Magnien, and Clemence, editors, 11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Carry-Le-Rouet, France, 2009. [WWW ] [PDF ] [bibtex-entry]
     
  45. David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse, and Jean-Sébastien Sereni. Reconfiguration of the Routing in WDM Networks with Two Classes of Services. In Conference on Optical Network Design and Modeling (ONDM), Braunschweig, Germany, 2009. [WWW ] [PDF ] [bibtex-entry]
     
  46. David Coudert, Dorian Mazauric, and Nicolas Nisse. On Rerouting Connection Requests in Networks with Shared Bandwidth. In DIMAP Workshop on Algorithmic Graph Theory (AGT), volume 32 of Electronic Note Discrete Maths., Warwick, United Kingdom, 2009. [WWW ] [bibtex-entry]
     
  47. David Coudert, Napoleão Nepomuceno, and Hervé Rivano. Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks. In Chaintreau, Augustin, Magnien, and Clemence, editors, AlgoTel, Carry-Le-Rouet, France, 2009. [WWW ] [PDF ] [bibtex-entry]
     
  48. David Coudert, Napoleao Nepomuceno, and Hervé Rivano. Minimizing Energy Consumption by Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks. In 1st IEEE WoWMoM Workshop on Hot Topics in Mesh Networking (HotMESH), Kos, Greece, June 2009. IEEE. [WWW ] [PDF ] [bibtex-entry]
     
  49. David Coudert, Florian Huc, and Dorian Mazauric. Computing and updating the process number in trees. In Baker, Theodore P., Bui, Alain, Tixeuil, and Sébastien, editors, 12th International Conference On Principles Of DIstributed Systems (OPODIS), volume 5401 of Lecture Notes in Computer Science, Luxor, Egypt, December 2008. Springer. [WWW ] [PDF ] [bibtex-entry]
     
  50. David Coudert, Florian Huc, and Dorian Mazauric. A distributed algorithm for computing and updating the process number of a forest. In Gabi Taubenfeld, editor, 22nd International Symposium on Distributed Computing (DISC), volume 5218, Arcachon, France, France, pages 500-501, 2008. Springer. [WWW ] [PDF ] [bibtex-entry]
     
  51. David Coudert, Florian Huc, and Dorian Mazauric. Algorithme générique pour les jeux de capture dans les arbres. In David Simplot-Ryl and Sebastien Tixeuil, editors, 10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), Saint-Malo, France, pages 37-40, 2008. [WWW ] [PDF ] [bibtex-entry]
     
  52. David Coudert, Florian Huc, Fabrice Peix, and Marie-Emilie Voge. Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints. In IEEE International Conference on Communications (ICC '08), Beijing, China, pages 5170 - 5174, May 2008. IEEE. [WWW ] [PDF ] [bibtex-entry]
     
  53. Jean-Claude Bermond, Michel Cosnard, David Coudert, and Stéphane Pérennes. Optimal Solution of the Maximum All Request Path Grooming Problem. In Advanced International Conference on Telecommunications (AICT), Le Gosier, Guadeloupe, France, February 2006. IEEE. [WWW ] [PDF ] [bibtex-entry]
     
  54. Jean-Claude Bermond, David Coudert, Xavier Munoz, and Ignasi Sau Valls. Traffic Grooming in Bidirectional WDM Ring Networks. In International Conference on Transparent Optical Networks (ICTON), volume 3, Nottingham, United Kingdom, pages 19 - 22, June 2006. IEEE / LEOS. [WWW ] [PDF ] [bibtex-entry]
     
  55. David Coudert, Stéphane Pérennes, Hervé Rivano, and Marie-Emilie Voge. Shared Risk Resource Groups and Survivability in Multilayer Networks. In International Conference on Transparent Optical Networks (ICTON), volume 3, Nottingham, United Kingdom, pages 235 - 238, June 2006. IEEE / LEOS. [WWW ] [PDF ] [bibtex-entry]
     
  56. Jean-Claude Bermond, Laurent Braud, and David Coudert. Traffic Grooming on the Path. In 12th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science, Mont Saint-Michel, France, pages 34-48, May 2005. Springer. [WWW ] [PDF ] [bibtex-entry]
     
  57. David Coudert, Stéphane Pérennes, Quang-Cuong Pham, and Jean-Sébastien Sereni. Rerouting requests in WDM networks. In 7eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Presqu'île de Giens, France, pages 17-20, May 2005. [WWW ] [PDF ] [bibtex-entry]
     
  58. Jean-Claude Bermond, David Coudert, and Xavier Munoz. Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case. In 7th IFIP Working Conference on Optical Network Design & Modelling (ONDM), Budapest, Hungary, pages 1135-1153, 2003. IFIP TC6. [WWW ] [PDF ] [bibtex-entry]
     
  59. Jean-Claude Bermond and David Coudert. Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory. In IEEE International Conference on Communications (ICC '03)., volume 2, Anchorage, United States, pages 1402 - 1406, May 2003. IEEE. [WWW ] [PDF ] [bibtex-entry]
     
  60. Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, and Hervé Rivano. Approximate Multicommodity Flow for WDM Networks Design. In SIROCCO: Structural Information and Communication Complexity, volume 10th, Umeä, Sweden, pages 43-56, June 2003. Carleton Scientific. [WWW ] [PDF ] [bibtex-entry]
     
  61. Mohamed Bouklit, David Coudert, Jean-François Lalande, and Hervé Rivano. Approximation Combinatoire de Multiflot Factionnaire : Améliorations. In AlgoTel: Aspects Algorithmiques des Télécommunications, Banyuls-sur-Mer, France, May 2003. [WWW ] [PDF ] [bibtex-entry]
     
  62. David Coudert, Hervé Rivano, and Xavier Roche. A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem. In International Workshop on Approximation and Online Algorithms (WAOA'03), volume 2909 of Lecture Notes in Computer Science, Budapest, Hungary, pages 193-230, 2003. Springer. [WWW ] [PDF ] [bibtex-entry]
     
  63. David Coudert and Hervé Rivano. Routage optique dans les réseaux WDM multifibres avec conversion partielle. In Quatrièmes Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Mèze, France, pages 17-24, May 2002. [WWW ] [PDF ] [bibtex-entry]
     
  64. David Coudert and Hervé Rivano. Lightpath assignment for multifibers WDM networks with wavelength translators. In IEEE Global Telecommunications Conference (Globecom'02), volume 3, Taipei, Taiwan, pages 2686 - 2690, 2002. IEEE. [WWW ] [PDF ] [bibtex-entry]
     
  65. Jean-Claude Bermond, Lilian Chacon, David Coudert, and Francois Tillerot. Cycle Covering. In 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Proceedings in Informatics, Vall de Nuria, Spain, pages 21-34, June 2001. Carleton Scientific. [WWW ] [PDF ] [bibtex-entry]
     
  66. Jean-Claude Bermond, David Coudert, Lilian Chacon, and Francois Tillerot. A note on cycle covering. In ACM Symposium on Parallel Algorithms and Architectures (SPAA), Hersonissos, Greece, pages 310-311, 2001. ACM. [WWW ] [PDF ] [bibtex-entry]
     
  67. David Coudert. Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications. In 3eme Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Saint Jean de Luz, France, pages 47-53, May 2001. [WWW ] [PDF ] [bibtex-entry]
     
  68. David Coudert and Xavier Munoz. 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. [WWW ] [PDF ] [bibtex-entry]
     
  69. Jean-Claude Bermond, Lilian Chacon, David Coudert, and Francois Tillerot. Conception d'un réseau WDM protégé par sous-réseaux. In Eric Fleury, editor, 2ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'00), volume ISBN 2-7261-1157-2, La Rochelle, France, pages 83-88, May 2000. Karell Bertet and Isabelle Chrisment and Eric Fleury, INRIA. [WWW ] [PDF ] [bibtex-entry]
     
  70. David Coudert, Afonso Ferreira, and Stéphane Pérennes. De Bruijn isomorphisms and free space optical networks. In 14th International Parallel and Distributed Processing Symposium (IPDPS 2000), Cancun, Mexico, pages 769 - 774, May 2000. IEEE. [WWW ] [PDF ] [bibtex-entry]
     
  71. David Coudert, Afonso Ferreira, and Xavier Munoz. OTIS-Based Multi-Hop Multi-OPS Lightwave Networks. In 3rd Workshop on Optics and Computer Science (WOCS), volume 1586 of Lecture Notes in Computer Science, San Juan, Puerto Rico, pages 897-910, April 1999. Springer. [WWW ] [PDF ] [bibtex-entry]
     
  72. David Coudert, Afonso Ferreira, and Stéphane Pérennes. 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, May 1999. [WWW ] [PDF ] [bibtex-entry]
     
  73. David Coudert, Afonso Ferreira, and Xavier Munoz. Multiprocessor Architectures Using Multi-hops Multi-OPS Lightwave Networks and Distributed Control. In First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (IPPS/SPDP 1998), Orlanda, United States, pages 151 - 155, March 1998. IEEE. [WWW ] [PDF ] [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 ] [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 ; UCA, 2021. [WWW ] [PDF ] [bibtex-entry]
     
  3. 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 ] [bibtex-entry]
     
  4. 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]
     
  5. 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]
     
  6. 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.
    Note: Https://arxiv.org/abs/1707.05016. [WWW ] [PDF ] [bibtex-entry]
     
  7. 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]
     
  8. David Coudert and Guillaume Ducoffe. Clique-decomposition revisited. Research Report, INRIA Sophia Antipolis - I3S, February 2016. [WWW ] [PDF ] [bibtex-entry]
     
  9. David Coudert, Guillaume Ducoffe, Nicolas Nisse, and Mauricio Soto. Distance-preserving orderings in graphs. Research Report RR-8973, Inria Sophia Antipolis, 2016. [WWW ] [PDF ] [bibtex-entry]
     
  10. 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]
     
  11. 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 ] [bibtex-entry]
     
  12. 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]
     
  13. 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 ] [bibtex-entry]
     
  14. 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 ] [bibtex-entry]
     
  15. 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]
     
  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, Alvinice Kodjo, and Khoa Phan. Robust Energy-aware Routing with Redundancy Elimination. Research Report RR-8457, INRIA, January 2014. [WWW ] [PDF ] [bibtex-entry]
     
  18. 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 ] [bibtex-entry]
     
  19. Deepesh Agarwal, Julio Araujo, Christelle Caillouet, Frédéric Cazals, David Coudert, and Stéphane Pérennes. Connectivity Inference in Mass Spectrometry based Structure Determination. Research Report RR-8320, INRIA, June 2013. [WWW ] [PDF ] [bibtex-entry]
     
  20. Omid Amini, David Coudert, and Nicolas Nisse. Some Results on Non-deterministic Graph Searching in Trees. Research Report, 2013. [WWW ] [PDF ] [bibtex-entry]
     
  21. David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, and Issam Tahiri. Feasibility study on distributed simulations of BGP. Research Report RR-8283, April 2013.
    Note: Https://arxiv.org/abs/1304.4750. [WWW ] [PDF ] [bibtex-entry]
     
  22. Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, and Fatima Zahra Moataz. Diverse Routing with the star property. Research Report RR-8071, INRIA, September 2012. [WWW ] [PDF ] [bibtex-entry]
     
  23. Nathann Cohen, David Coudert, and Aurélien Lancin. Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs. Research Report RR-8074, INRIA, September 2012. [WWW ] [PDF ] [bibtex-entry]
     
  24. Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, and Issam Tahiri. Reconfiguration with physical constraints in WDM networks. Research Report RR-7850, INRIA, 2011. [WWW ] [PDF ] [bibtex-entry]
     
  25. Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, Ignasi Sau Valls, and Fernando Solano Donado. MPLS label stacking on the line network. Research Report RR-6803, INRIA, 2009. [WWW ] [PDF ] [bibtex-entry]
     
  26. Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau Valls, and Fernando Solano Donado. GMPLS Routing Strategies based on the Design of Hypergraph Layouts. Research Report RR-6842, INRIA, 2009. [WWW ] [PDF ] [bibtex-entry]
     
  27. Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, and Fernando Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Research Report RR-7071, INRIA, 2009. [WWW ] [PDF ] [bibtex-entry]
     
  28. Jean-Claude Bermond, David Coudert, and Joseph Peters. Online Distributed Traffic Grooming on Path Networks. Research Report RR-6833, INRIA, 2009. [WWW ] [PDF ] [bibtex-entry]
     
  29. Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, and Nicolas Nisse. Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks. Research Report RR-7047, INRIA, 2009. [WWW ] [PDF ] [bibtex-entry]
     
  30. David Coudert, Frédéric Giroire, and Ignasi Sau Valls. Circuit visiting 10 ordered vertices in infinite grids. Research Report RR-6910, INRIA, 2009. [WWW ] [PDF ] [bibtex-entry]
     
  31. David Coudert, Dorian Mazauric, and Nicolas Nisse. Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.. Research Report RR-6790, INRIA, 2009. [WWW ] [PDF ] [bibtex-entry]
     
  32. David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse, and Jean-Sébastien Sereni. Routing Reconfiguration/Process Number: Coping wih Two Classes of Services. Research Report RR-6698, INRIA, 2008. [WWW ] [PDF ] [bibtex-entry]
     
  33. David Coudert, Florian Huc, and Dorian Mazauric. A distributed algorithm for computing and updating the process number of a forest. Research Report RR-6560, INRIA, 2008.
    Note: Https://arxiv.org/abs/0806.2710. [WWW ] [PDF ] [bibtex-entry]
     
  34. David Coudert and Dorian Mazauric. Network Reconfiguration using Cops-and-Robber Games. Research Report RR-6694, INRIA, 2008. [WWW ] [PDF ] [bibtex-entry]
     
  35. David Coudert, Napoleão Nepomuceno, and Hervé Rivano. Wireless Backhaul Networks: Minimizing Energy Consumption by Power-Efficient Radio Links Configuration. Research Report RR-6752, INRIA, 2008. [WWW ] [PDF ] [bibtex-entry]
     
  36. David Coudert and Jean-Sébastien Sereni. Characterization of graphs and digraphs with small process number. Research Report RR-6285, INRIA, 2008. [WWW ] [PDF ] [bibtex-entry]
     
  37. Jean-Claude Bermond, David Coudert, and Benjamin Lévêque. Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring. Research Report, 2007. [WWW ] [PDF ] [bibtex-entry]
     
  38. David Coudert, Florian Huc, Fabrice Peix, and Marie-Emilie Voge. On Minimizing the Average Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints. Research Report, 2007. [WWW ] [PDF ] [bibtex-entry]
     
  39. David Coudert, Stéphane Pérennes, Hervé Rivano, and Marie-Emilie Voge. Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues. Research Report, 2007. [WWW ] [PDF ] [bibtex-entry]
     
  40. Jean-Claude Bermond, Laurent Braud, and David Coudert. Traffic Grooming on the Path. Research Report RR-5645, INRIA, 2006. [WWW ] [PDF ] [bibtex-entry]
     
  41. Jean-Claude Bermond, Michel Cosnard, David Coudert, and Stéphane Pérennes. Optimal Solution of the Maximum All Request Path Grooming Problem. Research Report RR-5627, INRIA, 2006. [WWW ] [PDF ] [bibtex-entry]
     
  42. David Coudert, Pallab Datta, Stéphane Pérennes, Hervé Rivano, and Marie-Emilie Voge. Complexity and approximability issues of Shared Risk Resource Group. Research Report RR-5859, INRIA, 2006. [WWW ] [PDF ] [bibtex-entry]
     
  43. David Coudert, Florian Huc, and Jean-Sébastien Sereni. Pathwidth of outerplanar graphs. Research Report RR-5804, INRIA, 2006. [WWW ] [PDF ] [bibtex-entry]
     
  44. David Coudert, P. Datta, Hervé Rivano, and Marie-Emilie Voge. Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks. Research Report I3S Research Report I3S/RR-2005-37-FR, 2005.
    Note: Http://www.i3s.unice.fr/ mh/RR/2005/liste-2005.shtml. [WWW ] [bibtex-entry]
     
  45. David Coudert and Hervé Rivano. Lightpath assignment for multifibers wdm optical networks with wavelength translators. Technical report RR-4487, INRIA, June 2002. [WWW ] [PDF ] [bibtex-entry]
     
  46. Jean-Claude Bermond, David Coudert, and Min-Li Yu. On DRC-Covering of K_n by Cycles. Research Report RR-4299, INRIA, October 2001. [WWW ] [PDF ] [bibtex-entry]
     
  47. David Coudert, Afonso Ferreira, and Stéphane Pérennes. Digraph Isomorphisms and Free Space Optical Networks. Research Report RR-3817, INRIA, November 1999. [WWW ] [PDF ] [bibtex-entry]
     
Miscellaneous
  1. 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]
     
  2. Luc Hogie, Issam Tahiri, Aurélien Lancin, Nathann Cohen, and David Coudert. GRPH : The high performance graph library for Java, August 2011. [WWW ] [bibtex-entry]
     
  3. 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]
     
  4. 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]
     
  5. 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