Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control. - David Coudert; Afonso Ferreira; Xavier Muñoz (IPPS/SPDP, 1998)

OTIS-Based Multi-Hop Multi-OPS Lightwave Networks. - David Coudert; Afonso Ferreira; Xavier Muñoz (IPPS/SPDP Workshops, 1999)

De Bruijn Isomorphisms and Free Space Optical Networks. - David Coudert; Afonso Ferreira; Stephane Perennes (IPDPS, 2000)

Cycle Covering. - Jean-Claude Bermond; Lilian Chacon; David Coudert; François Tillerot (SIROCCO, 2001)

A note on cycle covering. - Jean-Claude Bermond; David Coudert; Lilian Chacon; François Tillerot (SPAA, 2001)

Algorithmique et optimisation de réseaux de communications optiques. (Algorithmic and optimisation of optical communication networks). - David Coudert (2001)

Lightpath assignment for multifibers WDM networks with wavelength translators. - David Coudert; Hervé Rivano (GLOBECOM, 2002)

Isomorphisms of the De Bruijn digraph and free-space optical networks. - David Coudert; Afonso Ferreira; Stephane Perennes (Networks, 2002)

Traffic grooming in unidirectional WDM ring networks using design theory. - Jean-Claude Bermond; David Coudert (ICC, 2003)

Approximate Multicommodity Flow for WDM Networks Design. - Mohamed Bouklit; David Coudert; Jean-François Lalande; Christophe Paul; Hervé Rivano (SIROCCO, 2003)

A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem. - David Coudert; Hervé Rivano; Xavier Roche (WAOA, 2003)

Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6. - Jean-Claude Bermond; Charles J. Colbourn; David Coudert; Gennian Ge; Alan C. H. Ling; Xavier Muñoz (SIAM J. Discret. Math., 2005)

Optimal Solution of the Maximum All Request Path Grooming Problem. - Jean-Claude Bermond; Michel Cosnard; David Coudert; Stéphane Pérennes (AICT/ICIW, 2006)

Pathwidth of outerplanar graphs. - David Coudert; Florian Huc; Jean-Sébastien Sereni (J. Graph Theory, 2007)

Shared Risk Resource Group Complexity and Approximability Issues. - David Coudert; Pallab Datta; Stephane Perennes; Hervé Rivano; Marie-Emilie Voge (Parallel Process. Lett., 2007)

Traffic grooming on the path. - Jean-Claude Bermond; Laurent Braud; David Coudert (Theor. Comput. Sci., 2007)

Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints. - David Coudert; Florian Huc; Fabrice Peix; Marie-Emilie Voge (ICC, 2008)

Computing and Updating the Process Number in Trees. - David Coudert; Florian Huc; Dorian Mazauric (OPODIS, 2008)

A Distributed Algorithm for Computing and Updating the Process Number of a Forest. - David Coudert; Florian Huc; Dorian Mazauric (DISC, 2008)

Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings. - Jean-Claude Bermond; David Coudert; Benjamin Lévêque (J. Interconnect. Networks, 2008)

Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. - David Coudert; Frédéric Giroire; Ignasi Sau (IWOCA, 2009)

MPLS Label Stacking on the Line Network. - Jean-Claude Bermond; David Coudert; Joanna Moulierac; Stéphane Pérennes; Hervé Rivano; Ignasi Sau; Fernando Solano Donado (Networking, 2009)

Designing Hypergraph Layouts to GMPLS Routing Strategies. - Jean-Claude Bermond; David Coudert; Joanna Moulierac; Stéphane Pérennes; Ignasi Sau; Fernando Solano Donado (SIROCCO, 2009)

Minimizing energy consumption by power-efficient radio configuration in fixed broadband wireless networks. - David Coudert; Napoleão Nepomuceno; Hervé Rivano (WOWMOM, 2009)

On Rerouting Connection Requests in Networks with Shared Bandwidth. - David Coudert; Dorian Mazauric; Nicolas Nisse (Electron. Notes Discret. Math., 2009)

Algorithmique et optimisation dans les réseaux de télécommunications. (Algorithmic and optimisation in telecommunication networks). - David Coudert (2010)

Traffic Grooming: Combinatorial Results and Practical Resolutions. - Tibor Cinkler; David Coudert; Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Xavier Muñoz; Ignasi Sau; Mordechai Shalom; Shmuel Zaks (Graphs and Algorithms in Communication Networks, 2010)

A new framework for efficient shared segment protection scheme for WDM networks. - Brigitte Jaumard; Nazmun Nahar Bhuiyan; Samir Sebbah; Florian Huc; David Coudert (HPSR, 2010)

Forward. - David Coudert; David Simplot-Ryl (Ad Hoc Sens. Wirel. Networks, 2010)

Power-efficient radio configuration in fixed broadband wireless networks. - David Coudert; Napoleão Nepomuceno; Hervé Rivano (Comput. Commun., 2010)

Circuits in Graphs through a prescribed Set of Ordered vertices. - David Coudert; Frédéric Giroire; Ignasi Sau (J. Interconnect. Networks, 2010)

A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks. - Grit Claßen; David Coudert; Arie M. C. A. Koster; Napoleão Nepomuceno (INOC, 2011)

Energy Saving in Fixed Wireless Broadband Networks. - David Coudert; Napoleão Nepomuceno; Issam Tahiri (INOC, 2011)

Bandwidth assignment for reliable fixed broadband wireless networks. - Grit Classen; David Coudert; Arie M. C. A. Koster; Napoleão Nepomuceno (WOWMOM, 2011)

Characterization of graphs and digraphs with small process numbers. - David Coudert; Jean-Sébastien Sereni (Discret. Appl. Math., 2011)

Tradeoffs in process strategy games with application in the WDM reconfiguration problem. - Nathann Cohen; David Coudert; Dorian Mazauric; Napoleão Nepomuceno; Nicolas Nisse (Theor. Comput. Sci., 2011)

Diverse routing in networks with star SRLGs. - Jean-Claude Bermond; David Coudert; Gianlorenzo D'Angelo; Fatima Zahra Moataz (StudentWorkshop@CoNEXT, 2012)

Reconfiguration with physical constraints in WDM networks. - Sonia Belhareth; David Coudert; Dorian Mazauric; Nicolas Nisse; Issam Tahiri (ICC, 2012)

Feasibility Study on Distributed Simulations of BGP. - David Coudert; Luc Hogie; Aurélien Lancin; Dimitri Papadimitriou; Stéphane Pérennes; Issam Tahiri (PADS, 2012)

A Distributed Algorithm for Computing the Node Search Number in Trees. - David Coudert; Florian Huc; Dorian Mazauric (Algorithmica, 2012)

GMPLS label space minimization through hypergraph layouts. - Jean-Claude Bermond; David Coudert; Joanna Moulierac; Stéphane Pérennes; Ignasi Sau; Fernando Solano Donado (Theor. Comput. Sci., 2012)

SRLG-diverse routing with the star property. - Jean-Claude Bermond; David Coudert; Gianlorenzo D'Angelo; Fatima Zahra Moataz (DRCN, 2013)

Connectivity Inference in Mass Spectrometry Based Structure Determination. - Deepesh Agarwal; Júlio César Silva Araújo; Christelle Caillouet; Frédéric Cazals; David Coudert; Stéphane Pérennes (ESA, 2013)

Robust optimization in multi-operators microwave backhaul networks. - Christelle Caillouet; David Coudert; Alvinice Kodjo (GIIS, 2013)

Robust Redundancy Elimination for Energy-Aware Routing. - David Coudert; Arie M. C. A. Koster; Truong Khoa Phan; Martin Tieves (GreenCom/iThings/CPScom, 2013)

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth. - David Coudert; Dorian Mazauric; Nicolas Nisse (SEA, 2014)

Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks. - Grit Claßen; Arie M. C. A. Koster; David Coudert; Napoleão Nepomuceno (INFORMS J. Comput., 2014)

Recognition of C4-Free and 1/2-Hyperbolic Graphs. - David Coudert; Guillaume Ducoffe (SIAM J. Discret. Math., 2014)

On Computing the Hyperbolicity of Real-World Graphs. - Michele Borassi; David Coudert; Pierluigi Crescenzi; Andrea Marino 001 (ESA, 2015)

Dimensioning microwave wireless networks. - Alvinice Kodjo; Brigitte Jaumard; Napoleão Nepomuceno; Mejdi Kaddour; David Coudert (ICC, 2015)

Robust energy-aware routing with redundancy elimination. - David Coudert; Alvinice Kodjo; Truong Khoa Phan (Comput. Oper. Res., 2015)

On Computing the Gromov Hyperbolicity. - Nathann Cohen; David Coudert; Aurélien Lancin (ACM J. Exp. Algorithmics, 2015)

Non-deterministic graph searching in trees. - Omid Amini; David Coudert; Nicolas Nisse (Theor. Comput. Sci., 2015)

Finding disjoint paths in networks with star shared risk link groups. - Jean-Claude Bermond; David Coudert; Gianlorenzo D'Angelo; Fatima Zahra Moataz (Theor. Comput. Sci., 2015)

Bin Packing with Colocations. - Jean-Claude Bermond; Nathann Cohen; David Coudert; Dimitrios Letsios; Ioannis Milis; Stéphane Pérennes; Vassilis Zissimopoulos (WAOA, 2016)

On the hyperbolicity of bipartite graphs and intersection graphs. - David Coudert; Guillaume Ducoffe (Discret. Appl. Math., 2016)

Combinatorial optimization in networks with Shared Risk Link Groups. - David Coudert; Stéphane Pérennes; Hervé Rivano; Marie-Emilie Voge (Discret. Math. Theor. Comput. Sci., 2016)

Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth. - David Coudert; Dorian Mazauric; Nicolas Nisse (ACM J. Exp. Algorithmics, 2016)

To Approximate Treewidth, Use Treelength! - David Coudert; Guillaume Ducoffe; Nicolas Nisse (SIAM J. Discret. Math., 2016)

Data center interconnection networks are not hyperbolic. - David Coudert; Guillaume Ducoffe (Theor. Comput. Sci., 2016)

A simple approach for lower-bounding the distortion in any Hyperbolic embedding. - David Coudert; Guillaume Ducoffe (Electron. Notes Discret. Math., 2017)

Routing at Large Scale: Advances and Challenges for Complex Networks. - Sahel Sahhaf; Wouter Tavernier; Dimitri Papadimitriou; Davide Careglio; Alok Kumar; Christian Glacet; David Coudert; Nicolas Nisse; Lluís Fàbrega; Pere Vilà; Miguel Camelo; Pieter Audenaert; et al. (IEEE Netw., 2017)

Applying clique-decomposition for computing Gromov hyperbolicity. - Nathann Cohen; David Coudert; Guillaume Ducoffe; Aurélien Lancin (Theor. Comput. Sci., 2017)

Efficient Make Before Break Capacity Defragmentation. - Huy Quang Duong; Brigitte Jaumard; David Coudert; Ron Armolavicius (HPSR, 2018)

Make-Before-Break Wavelength Defragmentation. - Brigitte Jaumard; Hamed Pouya; David Coudert (ICTON, 2018)

On distance-preserving elimination orderings in graphs: Complexity and algorithms. - David Coudert; Guillaume Ducoffe; Nicolas Nisse; Mauricio Soto (Discret. Appl. Math., 2018)

Computing and maximizing the exact reliability of wireless backhaul networks. - David Coudert; James R. Luedtke; Eduardo Moreno 001; Konstantinos Priftis (Electron. Notes Discret. Math., 2018)

Revisiting Decomposition by Clique Separators. - David Coudert; Guillaume Ducoffe (SIAM J. Discret. Math., 2018)

Self-Organized Disaster Management System by Distributed Deployment of Connected UAVs. - Yann Busnel; Christelle Caillouet; David Coudert (ICT-DM, 2019)

Self-organized UAV-based Supervision and Connectivity: Challenges and Opportunities. - Yann Busnel; Christelle Caillouet; David Coudert (NCA, 2019)

Low time complexity algorithms for path computation in Cayley Graphs. - Daniela Aguirre-Guerrero; Guillaume Ducoffe; Lluís Fàbrega; Pere Vilà; David Coudert (Discret. Appl. Math., 2019)

Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs. - David Coudert; Guillaume Ducoffe; Alexandru Popa 001 (ACM Trans. Algorithms, 2019)

Space and Time Trade-Off for the k Shortest Simple Paths Problem. - Ali Al Zoobi; David Coudert; Nicolas Nisse (SEA, 2020)

Optimizing FANET deployment for mobile sensor tracking in disaster management scenario. - Igor Dias Da Silva; Christelle Caillouet; David Coudert (ICT-DM, 2021)

Minimum Disturbance Rerouting to Optimize Bandwidth Usage. - Huy Quang Duong; Brigitte Jaumard; David Coudert (ONDM, 2021)

Hyperbolicity Computation through Dominating Sets. - David Coudert; André Nusser; Laurent Viennot (CoRR, 2021)

Dantzig-Wolfe decomposition for the design of filterless optical networks. - Brigitte Jaumard; Yan Wang; David Coudert (JOCN, 2021)

Efficient Make-Before-Break Layer 2 Reoptimization. - Huy Quang Duong; Brigitte Jaumard; David Coudert; Romualdas Armolavicius (IEEE/ACM Trans. Netw., 2021)

Computing Graph Hyperbolicity Using Dominating Sets. - David Coudert; André Nusser; Laurent Viennot (ALENEX, 2022)

On Finding k Earliest Arrival Time Journeys in Public Transit Networks. - Ali Al Zoobi; David Coudert; Arthur Finkelstein; Jean-Charles Régin (ICORES, 2022)

Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. - David Coudert; André Nusser; Laurent Viennot (ACM J. Exp. Algorithmics, 2022)

Finding the k Shortest Simple Paths: Time and Space Trade-offs. - Ali Al Zoobi; David Coudert; Nicolas Nisse (ACM J. Exp. Algorithmics, 2023)

Indexing Graphs for Shortest Beer Path Queries. - David Coudert; Andrea D'Ascenzo; Mattia D'Emidio (ATMOS, 2024)

Practical Computation of Graph VC-Dimension. - David Coudert; Mónika Csikós; Guillaume Ducoffe; Laurent Viennot (SEA, 2024)

Leanness Computation: Small Values and Special Graph Classes. - David Coudert; Samuel Coulomb; Guillaume Ducoffe (Discret. Math. Theor. Comput. Sci., 2024)

D-hash/ShortestBeerDistanceQueries. - David Coudert; Andrea D'Ascenzo; Mattia D'Emidio (DROPS Artifacts, 2024)

New lower bounds on the cutwidth of graphs. - Jean-Claude Bermond; Michel Cosnard; David Coudert; Frédéric Havet (Comput. Oper. Res., 2025)

k-shortest simple paths in bounded treewidth graphs. - David Coudert; Andrea D'Ascenzo; Clément Rambaud (Theor. Comput. Sci., 2025)