default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Coudert
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c46]David Coudert, Andrea D'Ascenzo, Mattia D'Emidio:
Indexing Graphs for Shortest Beer Path Queries. ATMOS 2024: 2:1-2:18- [c45]David Coudert, Mónika Csikós, Guillaume Ducoffe, Laurent Viennot:
Practical Computation of Graph VC-Dimension. SEA 2024: 8:1-8:20 - [i7]David Coudert, Mónika Csikós, Guillaume Ducoffe, Laurent Viennot:
Practical Computation of Graph VC-Dimension. CoRR abs/2405.07588 (2024) - 2023
- [j37]Ali Al Zoobi
, David Coudert, Nicolas Nisse:
Finding the k Shortest Simple Paths: Time and Space Trade-offs. ACM J. Exp. Algorithmics 28: 1.11:1-1.11:23 (2023) - 2022
- [j36]David Coudert, André Nusser, Laurent Viennot:
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. ACM J. Exp. Algorithmics 27: 1.15:1-1.15:29 (2022) - [c44]David Coudert, André Nusser, Laurent Viennot:
Computing Graph Hyperbolicity Using Dominating Sets. ALENEX 2022: 78-90 - [c43]Ali Al Zoobi, David Coudert, Arthur Finkelstein, Jean-Charles Régin:
On Finding k Earliest Arrival Time Journeys in Public Transit Networks. ICORES 2022: 314-325 - 2021
- [j35]Brigitte Jaumard, Yan Wang, David Coudert:
Dantzig-Wolfe decomposition for the design of filterless optical networks. JOCN 13(12): 312-321 (2021) - [j34]Huy Quang Duong, Brigitte Jaumard, David Coudert, Romualdas Armolavicius:
Efficient Make-Before-Break Layer 2 Reoptimization. IEEE/ACM Trans. Netw. 29(5): 1910-1921 (2021) - [c42]Igor Dias Da Silva, Christelle Caillouet, David Coudert:
Optimizing FANET deployment for mobile sensor tracking in disaster management scenario. ICT-DM 2021: 134-141 - [c41]Huy Quang Duong, Brigitte Jaumard, David Coudert:
Minimum Disturbance Rerouting to Optimize Bandwidth Usage. ONDM 2021: 1-6 - [e2]David Coudert, Emanuele Natale:
19th International Symposium on Experimental Algorithms, SEA 2021, June 7-9, 2021, Nice, France. LIPIcs 190, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-185-6 [contents] - [i6]David Coudert, André Nusser, Laurent Viennot:
Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. CoRR abs/2104.12523 (2021) - [i5]David Coudert, André Nusser, Laurent Viennot:
Hyperbolicity Computation through Dominating Sets. CoRR abs/2111.08520 (2021) - 2020
- [c40]Ali Al Zoobi, David Coudert, Nicolas Nisse:
Space and Time Trade-Off for the k Shortest Simple Paths Problem. SEA 2020: 18:1-18:13
2010 – 2019
- 2019
- [j33]Daniela Aguirre-Guerrero, Guillaume Ducoffe, Lluís Fàbrega, Pere Vilà, David Coudert:
Low time complexity algorithms for path computation in Cayley Graphs. Discret. Appl. Math. 259: 218-225 (2019) - [j32]David Coudert, Guillaume Ducoffe, Alexandru Popa:
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs. ACM Trans. Algorithms 15(3): 33:1-33:57 (2019) - [c39]Yann Busnel, Christelle Caillouet, David Coudert:
Self-Organized Disaster Management System by Distributed Deployment of Connected UAVs. ICT-DM 2019: 1-8 - [c38]Yann Busnel, Christelle Caillouet, David Coudert:
Self-organized UAV-based Supervision and Connectivity: Challenges and Opportunities. NCA 2019: 1-5 - 2018
- [j31]David Coudert, Guillaume Ducoffe, Nicolas Nisse, Mauricio Soto:
On distance-preserving elimination orderings in graphs: Complexity and algorithms. Discret. Appl. Math. 243: 140-153 (2018) - [j30]David Coudert, James R. Luedtke, Eduardo Moreno, Konstantinos Priftis:
Computing and maximizing the exact reliability of wireless backhaul networks. Electron. Notes Discret. Math. 64: 85-94 (2018) - [j29]David Coudert, Guillaume Ducoffe:
Revisiting Decomposition by Clique Separators. SIAM J. Discret. Math. 32(1): 682-694 (2018) - [c37]Huy Quang Duong, Brigitte Jaumard, David Coudert, Ron Armolavicius:
Efficient Make Before Break Capacity Defragmentation. HPSR 2018: 1-6 - [c36]Brigitte Jaumard, Hamed Pouya, David Coudert:
Make-Before-Break Wavelength Defragmentation. ICTON 2018: 1-5 - [c35]David Coudert, Guillaume Ducoffe, Alexandru Popa:
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. SODA 2018: 2765-2784 - 2017
- [j28]David Coudert, Guillaume Ducoffe:
A simple approach for lower-bounding the distortion in any Hyperbolic embedding. Electron. Notes Discret. Math. 61: 293-299 (2017) - [j27]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, Didier Colle, Piet Demeester:
Routing at Large Scale: Advances and Challenges for Complex Networks. IEEE Netw. 31(4): 108-118 (2017) - [j26]Nathann Cohen, David Coudert, Guillaume Ducoffe, Aurélien Lancin:
Applying clique-decomposition for computing Gromov hyperbolicity. Theor. Comput. Sci. 690: 114-139 (2017) - [i4]David Coudert, Guillaume Ducoffe, Alexandru Popa:
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. CoRR abs/1707.05016 (2017) - 2016
- [j25]David Coudert, Guillaume Ducoffe:
On the hyperbolicity of bipartite graphs and intersection graphs. Discret. Appl. Math. 214: 187-195 (2016) - [j24]David Coudert, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge:
Combinatorial optimization in networks with Shared Risk Link Groups. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [j23]David Coudert, Dorian Mazauric, Nicolas Nisse:
Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth. ACM J. Exp. Algorithmics 21(1): 1.3:1-1.3:23 (2016) - [j22]David Coudert, Guillaume Ducoffe, Nicolas Nisse:
To Approximate Treewidth, Use Treelength! SIAM J. Discret. Math. 30(3): 1424-1436 (2016) - [j21]David Coudert, Guillaume Ducoffe:
Data center interconnection networks are not hyperbolic. Theor. Comput. Sci. 639: 72-90 (2016) - [c34]Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos:
Bin Packing with Colocations. WAOA 2016: 40-51 - 2015
- [j20]David Coudert, Alvinice Kodjo, Truong Khoa Phan:
Robust energy-aware routing with redundancy elimination. Comput. Oper. Res. 64: 71-85 (2015) - [j19]Nathann Cohen, David Coudert, Aurélien Lancin:
On Computing the Gromov Hyperbolicity. ACM J. Exp. Algorithmics 20: 1.6:1-1.6:18 (2015) - [j18]Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz:
Finding disjoint paths in networks with star shared risk link groups. Theor. Comput. Sci. 579: 74-87 (2015) - [j17]Omid Amini, David Coudert, Nicolas Nisse:
Non-deterministic graph searching in trees. Theor. Comput. Sci. 580: 101-121 (2015) - [c33]Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino:
On Computing the Hyperbolicity of Real-World Graphs. ESA 2015: 215-226 - [c32]Alvinice Kodjo, Brigitte Jaumard, Napoleão Nepomuceno, Mejdi Kaddour, David Coudert:
Dimensioning microwave wireless networks. ICC 2015: 2803-2809 - 2014
- [j16]Grit Claßen, Arie M. C. A. Koster, David Coudert, Napoleão Nepomuceno:
Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks. INFORMS J. Comput. 26(4): 893-909 (2014) - [j15]David Coudert, Guillaume Ducoffe:
Recognition of C4-Free and 1/2-Hyperbolic Graphs. SIAM J. Discret. Math. 28(3): 1601-1617 (2014) - [c31]David Coudert, Dorian Mazauric, Nicolas Nisse:
Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth. SEA 2014: 46-58 - 2013
- [c30]Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz:
SRLG-diverse routing with the star property. DRCN 2013: 163-170 - [c29]Deepesh Agarwal, Júlio César Silva Araújo, Christelle Caillouet, Frédéric Cazals, David Coudert, Stéphane Pérennes:
Connectivity Inference in Mass Spectrometry Based Structure Determination. ESA 2013: 289-300 - [c28]Christelle Caillouet, David Coudert, Alvinice Kodjo:
Robust optimization in multi-operators microwave backhaul networks. GIIS 2013: 1-6 - [c27]David Coudert, Arie M. C. A. Koster, Truong Khoa Phan, Martin Tieves:
Robust Redundancy Elimination for Energy-Aware Routing. GreenCom/iThings/CPScom 2013: 179-186 - [i3]David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, Issam Tahiri:
Feasibility study on distributed simulations of BGP. CoRR abs/1304.4750 (2013) - 2012
- [j14]David Coudert, Florian Huc, Dorian Mazauric:
A Distributed Algorithm for Computing the Node Search Number in Trees. Algorithmica 63(1-2): 158-190 (2012) - [j13]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado:
GMPLS label space minimization through hypergraph layouts. Theor. Comput. Sci. 444: 3-16 (2012) - [c26]Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz:
Diverse routing in networks with star SRLGs. StudentWorkshop@CoNEXT 2012: 23-24 - [c25]Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, Issam Tahiri:
Reconfiguration with physical constraints in WDM networks. ICC 2012: 6257-6261 - [c24]David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, Issam Tahiri:
Feasibility Study on Distributed Simulations of BGP. PADS 2012: 96-98 - [i2]David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, Issam Tahiri:
Feasibility study on distributed simulations of BGP. CoRR abs/1209.0943 (2012) - 2011
- [j12]David Coudert, Jean-Sébastien Sereni:
Characterization of graphs and digraphs with small process numbers. Discret. Appl. Math. 159(11): 1094-1109 (2011) - [j11]Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse:
Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theor. Comput. Sci. 412(35): 4675-4687 (2011) - [c23]Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno:
A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks. INOC 2011: 37-42 - [c22]David Coudert, Napoleão Nepomuceno, Issam Tahiri:
Energy Saving in Fixed Wireless Broadband Networks. INOC 2011: 484-489 - [c21]Grit Classen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno:
Bandwidth assignment for reliable fixed broadband wireless networks. WOWMOM 2011: 1-6 - 2010
- [b2]David Coudert:
Algorithmique et optimisation dans les réseaux de télécommunications. (Algorithmic and optimisation in telecommunication networks). University of Nice Sophia Antipolis, France, 2010 - [j10]David Coudert, David Simplot-Ryl:
Forward. Ad Hoc Sens. Wirel. Networks 9(1-2): 1-2 (2010) - [j9]David Coudert, Napoleão Nepomuceno, Hervé Rivano:
Power-efficient radio configuration in fixed broadband wireless networks. Comput. Commun. 33(8): 898-906 (2010) - [j8]David Coudert, Frédéric Giroire, Ignasi Sau:
Circuits in Graphs through a prescribed Set of Ordered vertices. J. Interconnect. Networks 11(3-4): 121-141 (2010) - [c20]Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse:
Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem. FUN 2010: 121-132 - [c19]Brigitte Jaumard, Nazmun Nahar Bhuiyan, Samir Sebbah, Florian Huc, David Coudert:
A new framework for efficient shared segment protection scheme for WDM networks. HPSR 2010: 189-196 - [p1]Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Traffic Grooming: Combinatorial Results and Practical Resolutions. Graphs and Algorithms in Communication Networks 2010: 63-94
2000 – 2009
- 2009
- [j7]David Coudert, Dorian Mazauric, Nicolas Nisse:
On Rerouting Connection Requests in Networks with Shared Bandwidth. Electron. Notes Discret. Math. 32: 109-116 (2009) - [c18]David Coudert, Frédéric Giroire, Ignasi Sau:
Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. IWOCA 2009: 134-145 - [c17]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, Ignasi Sau, Fernando Solano Donado:
MPLS Label Stacking on the Line Network. Networking 2009: 809-820 - [c16]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado:
Designing Hypergraph Layouts to GMPLS Routing Strategies. SIROCCO 2009: 57-71 - [c15]David Coudert, Napoleão Nepomuceno, Hervé Rivano:
Minimizing energy consumption by power-efficient radio configuration in fixed broadband wireless networks. WOWMOM 2009: 1-6 - 2008
- [j6]Jean-Claude Bermond, David Coudert, Benjamin Lévêque:
Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings. J. Interconnect. Networks 9(4): 471-486 (2008) - [c14]David Coudert, Florian Huc, Fabrice Peix, Marie-Emilie Voge:
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints. ICC 2008: 5170-5174 - [c13]David Coudert, Florian Huc, Dorian Mazauric:
Computing and Updating the Process Number in Trees. OPODIS 2008: 546-550 - [c12]David Coudert, Florian Huc, Dorian Mazauric:
A Distributed Algorithm for Computing and Updating the Process Number of a Forest. DISC 2008: 500-501 - [e1]David Coudert, David Simplot-Ryl, Ivan Stojmenovic:
Ad-hoc, Mobile and Wireless Networks, 7th International Conference, ADHOC-NOW 2008, Sophia-Antipolis, France, September 10-12, 2008, Proceedings. Lecture Notes in Computer Science 5198, Springer 2008, ISBN 978-3-540-85208-7 [contents] - [i1]David Coudert, Florian Huc, Dorian Mazauric:
A distributed algorithm for computing and updating the process number of a forest. CoRR abs/0806.2710 (2008) - 2007
- [j5]David Coudert, Florian Huc, Jean-Sébastien Sereni:
Pathwidth of outerplanar graphs. J. Graph Theory 55(1): 27-41 (2007) - [j4]David Coudert, Pallab Datta, Stephane Perennes, Hervé Rivano, Marie-Emilie Voge:
Shared Risk Resource Group Complexity and Approximability Issues. Parallel Process. Lett. 17(2): 169-184 (2007) - [j3]Jean-Claude Bermond, Laurent Braud, David Coudert:
Traffic grooming on the path. Theor. Comput. Sci. 384(2-3): 139-151 (2007) - 2006
- [c11]Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes:
Optimal Solution of the Maximum All Request Path Grooming Problem. AICT/ICIW 2006: 28 - 2005
- [j2]Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, Xavier Muñoz:
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6. SIAM J. Discret. Math. 19(2): 523-542 (2005) - [c10]Jean-Claude Bermond, Laurent Braud, David Coudert:
Traffic Grooming on the Path. SIROCCO 2005: 34-48 - 2003
- [c9]Jean-Claude Bermond, David Coudert:
Traffic grooming in unidirectional WDM ring networks using design theory. ICC 2003: 1402-1406 - [c8]Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano:
Approximate Multicommodity Flow for WDM Networks Design. SIROCCO 2003: 43-56 - [c7]David Coudert, Hervé Rivano, Xavier Roche:
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem. WAOA 2003: 256-259 - 2002
- [j1]David Coudert, Afonso Ferreira, Stephane Perennes:
Isomorphisms of the De Bruijn digraph and free-space optical networks. Networks 40(3): 155-164 (2002) - [c6]David Coudert, Hervé Rivano:
Lightpath assignment for multifibers WDM networks with wavelength translators. GLOBECOM 2002: 2686-2690 - 2001
- [b1]David Coudert:
Algorithmique et optimisation de réseaux de communications optiques. (Algorithmic and optimisation of optical communication networks). University of Nice Sophia Antipolis, France, 2001 - [c5]Jean-Claude Bermond, Lilian Chacon, David Coudert, François Tillerot:
Cycle Covering. SIROCCO 2001: 21-34 - [c4]Jean-Claude Bermond, David Coudert, Lilian Chacon, François Tillerot:
A note on cycle covering. SPAA 2001: 310-311 - 2000
- [c3]David Coudert, Afonso Ferreira, Stephane Perennes:
De Bruijn Isomorphisms and Free Space Optical Networks. IPDPS 2000: 769-774
1990 – 1999
- 1999
- [c2]David Coudert, Afonso Ferreira, Xavier Muñoz:
OTIS-Based Multi-Hop Multi-OPS Lightwave Networks. IPPS/SPDP Workshops 1999: 897-910 - 1998
- [c1]David Coudert, Afonso Ferreira, Xavier Muñoz:
Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control. IPPS/SPDP 1998: 151-155
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-08 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
