David Coudert

Orcid: 0000-0002-3306-8314

Affiliations:
  • INRIA, France


According to our database1, David Coudert authored at least 84 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Practical Computation of Graph VC-Dimension.
Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

Indexing Graphs for Shortest Beer Path Queries.
Proceedings of the 24th Symposium on Algorithmic Approaches for Transportation Modelling, 2024

2023
Finding the <i>k</i> Shortest Simple Paths: Time and Space Trade-offs.
ACM J. Exp. Algorithmics, December, 2023

2022
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation.
ACM J. Exp. Algorithmics, 2022

On Finding k Earliest Arrival Time Journeys in Public Transit Networks.
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022

Computing Graph Hyperbolicity Using Dominating Sets.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021
Efficient Make-Before-Break Layer 2 Reoptimization.
IEEE/ACM Trans. Netw., 2021

Dantzig-Wolfe decomposition for the design of filterless optical networks.
JOCN, 2021

Hyperbolicity Computation through Dominating Sets.
CoRR, 2021

Minimum Disturbance Rerouting to Optimize Bandwidth Usage.
Proceedings of the International Conference on Optical Network Design and Modeling, 2021

Optimizing FANET deployment for mobile sensor tracking in disaster management scenario.
Proceedings of the International Conference on Information and Communication Technologies for Disaster Management, 2021

2020
Space and Time Trade-Off for the k Shortest Simple Paths Problem.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

2019
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs.
ACM Trans. Algorithms, 2019

Low time complexity algorithms for path computation in Cayley Graphs.
Discret. Appl. Math., 2019

Self-organized UAV-based Supervision and Connectivity: Challenges and Opportunities.
Proceedings of the 18th IEEE International Symposium on Network Computing and Applications, 2019

Self-Organized Disaster Management System by Distributed Deployment of Connected UAVs.
Proceedings of the 5th International Conference on Information and Communication Technologies for Disaster Management, 2019

2018
Revisiting Decomposition by Clique Separators.
SIAM J. Discret. Math., 2018

Computing and maximizing the exact reliability of wireless backhaul networks.
Electron. Notes Discret. Math., 2018

On distance-preserving elimination orderings in graphs: Complexity and algorithms.
Discret. Appl. Math., 2018

Make-Before-Break Wavelength Defragmentation.
Proceedings of the 2018 20th International Conference on Transparent Optical Networks (ICTON), 2018

Efficient Make Before Break Capacity Defragmentation.
Proceedings of the IEEE 19th International Conference on High Performance Switching and Routing, 2018

2017
Applying clique-decomposition for computing Gromov hyperbolicity.
Theor. Comput. Sci., 2017

Routing at Large Scale: Advances and Challenges for Complex Networks.
IEEE Netw., 2017

A simple approach for lower-bounding the distortion in any Hyperbolic embedding.
Electron. Notes Discret. Math., 2017

2016
Data center interconnection networks are not hyperbolic.
Theor. Comput. Sci., 2016

To Approximate Treewidth, Use Treelength!
SIAM J. Discret. Math., 2016

Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth.
ACM J. Exp. Algorithmics, 2016

Combinatorial optimization in networks with Shared Risk Link Groups.
Discret. Math. Theor. Comput. Sci., 2016

On the hyperbolicity of bipartite graphs and intersection graphs.
Discret. Appl. Math., 2016

Bin Packing with Colocations.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

2015
Finding disjoint paths in networks with star shared risk link groups.
Theor. Comput. Sci., 2015

Non-deterministic graph searching in trees.
Theor. Comput. Sci., 2015

On Computing the Gromov Hyperbolicity.
ACM J. Exp. Algorithmics, 2015

Robust energy-aware routing with redundancy elimination.
Comput. Oper. Res., 2015

Dimensioning microwave wireless networks.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

On Computing the Hyperbolicity of Real-World Graphs.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Recognition of C<sub>4</sub>-Free and 1/2-Hyperbolic Graphs.
SIAM J. Discret. Math., 2014

Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks.
INFORMS J. Comput., 2014

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

2013
Robust Redundancy Elimination for Energy-Aware Routing.
Proceedings of the 2013 IEEE International Conference on Green Computing and Communications (GreenCom) and IEEE Internet of Things (iThings) and IEEE Cyber, 2013

Robust optimization in multi-operators microwave backhaul networks.
Proceedings of the Global Information Infrastructure Symposium, 2013

Connectivity Inference in Mass Spectrometry Based Structure Determination.
Proceedings of the Algorithms - ESA 2013, 2013

SRLG-diverse routing with the star property.
Proceedings of the 9th International Conference on the Design of Reliable Communication Networks, 2013

2012
GMPLS label space minimization through hypergraph layouts.
Theor. Comput. Sci., 2012

A Distributed Algorithm for Computing the Node Search Number in Trees.
Algorithmica, 2012

Feasibility Study on Distributed Simulations of BGP.
Proceedings of the 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation, 2012

Reconfiguration with physical constraints in WDM networks.
Proceedings of IEEE International Conference on Communications, 2012

Diverse routing in networks with star SRLGs.
Proceedings of the 2012 ACM conference on CoNEXT student workshop, 2012

2011
Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
Theor. Comput. Sci., 2011

Characterization of graphs and digraphs with small process numbers.
Discret. Appl. Math., 2011

Bandwidth assignment for reliable fixed broadband wireless networks.
Proceedings of the 12th IEEE International Symposium on a World of Wireless, 2011

Energy Saving in Fixed Wireless Broadband Networks.
Proceedings of the Network Optimization - 5th International Conference, 2011

A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
Circuits in Graphs through a prescribed Set of Ordered vertices.
J. Interconnect. Networks, 2010

Power-efficient radio configuration in fixed broadband wireless networks.
Comput. Commun., 2010

Forward.
Ad Hoc Sens. Wirel. Networks, 2010

A new framework for efficient shared segment protection scheme for WDM networks.
Proceedings of the 11th IEEE International Conference on High Performance Switching and Routing, 2010

Traffic Grooming: Combinatorial Results and Practical Resolutions.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

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

2009
On Rerouting Connection Requests in Networks with Shared Bandwidth.
Electron. Notes Discret. Math., 2009

Minimizing energy consumption by power-efficient radio configuration in fixed broadband wireless networks.
Proceedings of the 10th IEEE International Symposium on a World of Wireless, 2009

Designing Hypergraph Layouts to GMPLS Routing Strategies.
Proceedings of the Structural Information and Communication Complexity, 2009

MPLS Label Stacking on the Line Network.
Proceedings of the NETWORKING 2009, 2009

Edge-Simple Circuits through 10 Ordered Vertices in Square Grids.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings.
J. Interconnect. Networks, 2008

A Distributed Algorithm for Computing and Updating the Process Number of a Forest.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Computing and Updating the Process Number in Trees.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints.
Proceedings of IEEE International Conference on Communications, 2008

2007
Traffic grooming on the path.
Theor. Comput. Sci., 2007

Shared Risk Resource Group Complexity and Approximability Issues.
Parallel Process. Lett., 2007

Pathwidth of outerplanar graphs.
J. Graph Theory, 2007

2006
Optimal Solution of the Maximum All Request Path Grooming Problem.
Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW 2006), 2006

2005
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio <i>C</i> = 6.
SIAM J. Discret. Math., 2005

2003
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Approximate Multicommodity Flow for WDM Networks Design.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Traffic grooming in unidirectional WDM ring networks using design theory.
Proceedings of IEEE International Conference on Communications, 2003

2002
Isomorphisms of the De Bruijn digraph and free-space optical networks.
Networks, 2002

Lightpath assignment for multifibers WDM networks with wavelength translators.
Proceedings of the Global Telecommunications Conference, 2002

2001
Algorithmique et optimisation de réseaux de communications optiques. (Algorithmic and optimisation of optical communication networks).
PhD thesis, 2001

A note on cycle covering.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Cycle Covering.
Proceedings of the SIROCCO 8, 2001

2000
De Bruijn Isomorphisms and Free Space Optical Networks.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999
OTIS-Based Multi-Hop Multi-OPS Lightwave Networks.
Proceedings of the Parallel and Distributed Processing, 1999

1998
Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control.
Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998


  Loading...