Articles in journal or book's chapters
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]
  1. 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]
  2. 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]
  1. 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]
  2. Nathann Cohen and David Coudert. Le défi des 1001 graphes. Interstices, December 2017. [WWW ] [bibtex-entry]
  3. 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]
  4. 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]
  1. 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]
  2. 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]
  3. David Coudert and Guillaume Ducoffe. Data center interconnection networks are not hyperbolic. Theoretical Computer Science, 639:72-90, 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 and Theoretical Computer Science, 18(3):25, May 2016. [WWW ] [PDF ] [bibtex-entry]
  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  1. 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]
  2. 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]
  1. 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]
  2. 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]
  1. 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]
  2. 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]
  3. 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]
  1. 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]
  2. 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]
  1. 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]
  1. 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]
  2. 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]
  3. 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]
  1. 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]
  1. 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]
  1. 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]
  2. 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]
  1. 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]
  1. 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]
  2. 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]