Nombre de documents

140


Article dans une revue29 documents

  • Sahel Sahhaf, Wouter Tavernier, Dimitri Papadimitriou, Davide Careglio, Alok Kumar, et al.. Routing at Large Scale: Advances and Challenges for Complex Networks. IEEE Network, Institute of Electrical and Electronics Engineers, 2017, pp.12 - 22. 〈10.1109/MNET.2017.1600203〉. 〈hal-01547511〉
  • Nathann Cohen, David Coudert, Guillaume Ducoffe, Aurélien Lancin. Applying clique-decomposition for computing Gromov hyperbolicity. Theoretical Computer Science, Elsevier, 2017, 〈10.1016/j.tcs.2017.06.001〉. 〈hal-01540756〉
  • David Coudert, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge. Combinatorial optimization in networks with Shared Risk Link Groups. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, Vol. 18, no 3, pp.25. 〈hal-01053859v4〉
  • David Coudert, Guillaume Ducoffe, Nicolas Nisse. To Approximate Treewidth, Use Treelength!. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2016, 30 (3), pp.13. 〈10.1137/15M1034039〉. 〈hal-01348965〉
  • David Coudert, Guillaume Ducoffe. Data center interconnection networks are not hyperbolic. Theoretical Computer Science, Elsevier, 2016, 639, pp.72-90. 〈10.1016/j.tcs.2016.05.025〉. 〈hal-01323301〉
  • David Coudert, Guillaume Ducoffe. On the hyperbolicity of bipartite graphs and intersection graphs. Discrete Applied Mathematics, Elsevier, 2016, 214, pp.187-195. 〈10.1016/j.dam.2016.06.017〉. 〈hal-01220132v2〉
  • David Coudert, Dorian Mazauric, Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth. ACM Journal of Experimental Algorithmics, 2016, 21 (1), pp.23. 〈10.1145/2851494〉. 〈hal-01266496〉
  • David Coudert, Alvinice Kodjo, Truong Khoa Phan. Robust Energy-aware Routing with Redundancy Elimination. Computers and Operations Research, Elsevier, 2015, 64, pp.21. 〈10.1016/j.cor.2015.05.008〉. 〈hal-01155639〉
  • Deepesh Agarwal, Christelle Caillouet, David Coudert, Frédéric Cazals. Unveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems. Molecular and Cellular Proteomics, American Society for Biochemistry and Molecular Biology, 2015, 14, pp.2274-2284. 〈http://mcponline.org〉. 〈10.1074/mcp.M114.047779〉. 〈hal-01245401v2〉
  • Omid Amini, David Coudert, Nicolas Nisse. Non-deterministic graph searching in trees. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 580, pp.101-121. 〈10.1016/j.tcs.2015.02.038〉. 〈hal-01132032〉
  • Nathann Cohen, David Coudert, Aurélien Lancin. On computing the Gromov hyperbolicity. ACM Journal on Experimental Algorithmics, Association for Computing Machinery, 2015, 20 (1), pp.18. 〈10.1145/2780652〉. 〈hal-01182890〉
  • Jean-Claude Bermond, David Coudert, Gianlorenzo D 'Angelo, Fatima Zahra Moataz. Finding disjoint paths in networks with star shared risk link groups. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 579, pp.74-87. 〈10.1016/j.tcs.2015.02.012〉. 〈hal-01132216〉
  • Grit Classen, David Coudert, Arie Koster, Napoleao Nepomuceno. Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks. INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2014, 26 (4), pp.893-909. 〈10.1287/ijoc.2014.0605〉. 〈hal-01070780〉
  • David Coudert, Guillaume Ducoffe. Recognition of C4-free and 1/2-hyperbolic graphs. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2014, 28 (3), pp.1601-1617. 〈10.1137/140954787〉. 〈hal-01070768〉
  • Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, et al.. GMPLS Label Space Minimization through Hypergraph Layouts. Theoretical Computer Science, Elsevier, 2012, 444, pp.3-16. 〈10.1016/j.tcs.2012.01.033〉. 〈hal-00706260〉
  • David Coudert, Florian Huc, Dorian Mazauric. A Distributed Algorithm for Computing the Node Search Number in Trees. Algorithmica, Springer Verlag, 2012, 63 (1), pp.158-190. 〈10.1007/s00453-011-9524-3〉. 〈inria-00587819〉
  • David Coudert, Jean-Sébastien Sereni. Characterization of graphs and digraphs with small process number. Discrete Applied Mathematics, Elsevier, 2011, 159 (11), pp.1094-1109. 〈10.1016/j.dam.2011.03.010〉. 〈inria-00587717〉
  • David Coudert, Frédéric Giroire, Ignasi Sau. Circuits in graphs through a prescribed set of ordered vertices. Journal of Interconnection Networks, World Scientific Publishing, 2011, 11 (3-4), pp.121-141. 〈10.1142/S0219265910002763〉. 〈inria-00585561〉
  • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno, Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theoretical Computer Science, Elsevier, 2011, 412 (35), pp.4675-4687. 〈10.1016/j.tcs.2011.05.002〉. 〈inria-00592507〉
  • David Coudert, Napoleão Nepomuceno, Hervé Rivano. Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks. Computer Communications, Elsevier, 2010, 33 (8), pp.898-906. 〈10.1016/j.comcom.2010.01.006〉. 〈inria-00466477〉
  • Jean-Claude Bermond, David Coudert, Benjamin Lévêque. Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring. Journal of Interconnection Networks, World Scientific Publishing, 2008, 9 (4), pp.471-486. 〈10.1142/S0219265908002394〉. 〈inria-00429217〉
  • David Coudert, Florian Huc, Jean-Sébastien Sereni. Pathwidth of outerplanar graphs. Journal of Graph Theory, Wiley, 2007, 55 (1), pp.27 - 41. 〈10.1002/jgt.20218〉. 〈inria-00429216〉
  • David Coudert, P. Datta, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge. Shared Risk Resource Group: Complexity and Approximability issues. Parallel Processing Letters, World Scientific Publishing, 2007, 17 (2), pp.169-184. 〈hal-00371100〉
  • Jean-Claude Bermond, Laurent Braud, David Coudert. Traffic Grooming on the Path. Theoretical Computer Science, Elsevier, 2007, Structural Information and Communication Complexity (SIROCCO 2005), 384 (2-3), pp.139-151. 〈10.1016/j.tcs.2007.04.028〉. 〈inria-00308716〉
  • Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, et al.. Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2005, 19 (2), pp.523-542. 〈10.1137/S0895480104444314〉. 〈inria-00429214〉
  • Jean-Claude Bermond, David Coudert, Min-Li Yu. On DRC-covering of Kn by cycles. Journal of Combinatorial Designs, Wiley, 2003, 11 (2), pp.100 - 112. 〈10.1002/jcd.10040〉. 〈inria-00429205〉
  • David Coudert, Afonso Ferreira, Stéphane Pérennes. Isomorphisms of the De Bruijn digraph and free-space optical networks. Networks, Wiley, 2002, 40 (3), pp.155 - 164. 〈10.1002/net.10043〉. 〈inria-00429201〉
  • David Coudert, Afonso Ferreira, Xavier Munoz. Topologies for Optical Interconnection Networks Based on the Optical Transpose Interconnection System. OSA Applied Optics -- Information Processing, Optical Society of America (OSA), 2000, 39 (17), pp.2965-2974. 〈inria-00429198〉
  • David Coudert, Afonso Ferreira, Xavier Munoz. A multihop multi-OPS optical interconnection network. Journal of Lightwave Technology, Institute of Electrical and Electronics Engineers (IEEE)/Optical Society of America(OSA), 2000, 18 (12), pp.2076 - 2085. 〈10.1109/50.908818〉. 〈inria-00429200〉

Communication dans un congrès63 documents

  • David Coudert, Guillaume Ducoffe. A simple approach for lower-bounding the distortion in any Hyperbolic embedding. EUROCOMB'17 -- The European Conference on Combinatorics, Graph Theory and Applications, Aug 2017, Vienna, Austria. Elsevier, Electronic Notes in Discrete Mathematics, 61, pp.293 - 299, 2017, 〈10.1016/j.endm.2017.06.051〉. 〈hal-01573042〉
  • David Coudert, James Luedtke, Eduardo Moreno, Konstantinos Priftis. Computing and maximizing the exact reliability of wireless backhaul networks. International Network Optimization Conference, Feb 2017, Lisbon, Portugal. 〈hal-01593041〉
  • Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, et al.. Bin Packing with Colocations. Klaus Jansen; Monaldo Mastrolilli. 14th International Workshop on Approximation and Online Algorithms (WAOA), Aug 2016, Aarhus, Denmark. Springer, Lecture Notes in Computer Science, 10138, pp.40-51, 2017, 〈http://conferences.au.dk/algo16/waoa/〉. 〈10.1007/978-3-319-51741-4_4〉. 〈hal-01435614〉
  • David Coudert, Guillaume Ducoffe. Liens entre symétries et étirements de routages dans les réseaux d'interconnexions de centres de données. ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France. 〈hal-01302470〉
  • Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino. On Computing the Hyperbolicity of Real-World Graphs. 23rd Annual European Symposium on Algorithms (ESA), Sep 2015, Patras, Greece. Springer, 9294, pp.215-226, 2015, Lecture Notes in Computer Science. 〈10.1007/978-3-662-48350-3_19〉. 〈hal-01199860〉
  • David Coudert, Guillaume Ducoffe, Nicolas Nisse. Structure vs métrique dans les graphes. ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France. 〈hal-01144694〉
  • Alvinice Kodjo, Brigitte Jaumard, Napoleão Nepomuceno, Mejdi Kaddour, David Coudert. Dimensioning microwave wireless networks. ICC 2015 : IEEE International Conference on Communications, Jun 2015, London, United Kingdom. IEEE, pp.2803 - 2809, 2015, 〈10.1109/ICC.2015.7248751〉. 〈hal-01198461〉
  • David Coudert, Dorian Mazauric, Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth. 13th International Symposium on Experimental Algorithms, 2014, Copenhagen, Denmark. 8504, pp.46-58, 2014, Lecture Notes in Computer Science. 〈hal-00966851〉
  • Alvinice Kodjo, David Coudert, Christelle Caillouet. Optimisation robuste pour le partage de réseaux d'accès micro-ondes entre opérateurs. ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France. 〈hal-00946419〉
  • David Coudert, Brigitte Jaumard, Fatima Zahra Moataz. Dynamic Routing and Spectrum Assignment with Non-Disruptive Defragmentation. ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4, 2014. 〈hal-00983492〉
  • David Coudert, Alvinice Kodjo, Khoa Phan. Robust Optimization for Energy-aware Routing with Redundancy Elimination. ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le-Bois-Plage-en-Ré, France. pp.1-4, 2014. 〈hal-00982366〉
  • Nathann Cohen, David Coudert, Aurélien Lancin. Algorithme exact et approché pour le calcul de l'hyperbolicité d'un graphe. Nisse, Nicolas and Rousseau, Franck and Busnel, Yann. 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.1-4, 2013. 〈hal-00818441〉
  • David Coudert, Arie Koster, Khoa Phan, Tieves Martin. Robust Redundancy Elimination for Energy-aware Routing. The 2013 IEEE International Conference on Green Computing and Communications (GreenCom 2013), Aug 2013, Beijing, China. IEEE, 2013. 〈hal-00862018〉
  • Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz. SRLG-Diverse Routing with the Star Property. Design of Reliable Communication Networks, DRCN, Mar 2013, Budapest, Hungary. 2013. 〈hal-00794638〉
  • Christelle Caillouet, David Coudert, Alvinice Kodjo. Robust optimization in multi-operators microwave backhaul networks. 4th Global Information Infrastructure and Networking Symposium, Oct 2013, Trento, Italy. IEEE, pp.1-6, 2013. 〈hal-00870931〉
  • Deepesh Agarwal, Julio Araujo, Christelle Caillouet, Frédéric Cazals, David Coudert, et al.. Connectivity Inference in Mass Spectrometry based Structure Determination. Bodlaender, H.L. and Italiano, G.F. European Symposium on Algorithms, Sep 2013, Sophia-Antipolis, France, France. Springer, 8125, pp.289-300, 2013, Lecture Notes in Computer Science - LNCS. 〈http://link.springer.com/chapter/10.1007%2F978-3-642-40450-4_25〉. 〈10.1007/978-3-642-40450-4_25〉. 〈hal-00849873〉
  • Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz. Diverse Routing with Star SRLGs. Nisse, Nicolas and Rousseau, Franck and Busnel, Yann. 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.1-4, 2013. 〈hal-00817992〉
  • David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, et al.. Feasibility study on distributed simulations of BGP. PADS - 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation - 2012, Jul 2012, Zhangjiajie, China. IEEE, 2012. 〈hal-00706415〉
  • Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, Issam Tahiri. Reconfiguration with physical constraints in WDM networks. Workshop on New Trends in Optical Networks Survivability, 2012, Canada. pp.5, 2012. 〈hal-00704199〉
  • Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz. Diverse Routing in Networks with Star SRLGs. ACM CoNEXT Student Workshop, Dec 2012, Nice, France. pp.1-2, 2012. 〈hal-00747757〉
  • David Coudert, Napoleão Nepomuceno, Issam Tahiri. Optimisation de la consommation énergétique dans les réseaux sans fil fixes. Ducourthial, Bertrand et Felber, Pascal. 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 2011. 〈inria-00588129〉
  • Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, Issam Tahiri. Reconfiguration avec contraintes physiques dans les réseaux WDM. Ducourthial, Bertrand et Felber, Pascal. 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 2011. 〈inria-00583829v2〉
  • Grit Classen, David Coudert, Arie Koster, Napoleao Nepomuceno. A Chance-Constrained Model & Cutting Planes for Fixed Broadband Wireless Networks. Internationale Network Optimization Conference (INOC), Jun 2011, Hamburg, Germany. Springer, 6701, pp.37-42, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-21527-8_5〉. 〈inria-00587669〉
  • David Coudert, Napoleao Nepomuceno, Issam Tahiri. Energy saving in fixed wireless broadband networks. Internationale Network Optimization Conference (INOC), Jun 2011, Hamburg, Germany. Springer, 6701, pp.484-489, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-21527-8_53〉. 〈inria-00587685〉
  • Grit Classen, David Coudert, Arie Koster, Napoleao Nepomuceno. Bandwidth assignment for reliable fixed broadband wireless networks. 12th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), Jun 2011, Lucca, Italy. IEEE, pp.1-6, 2011, 〈10.1109/WoWMoM.2011.5986471〉. 〈inria-00587698〉
  • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse. Tradeoffs in routing reconfiguration problems. Maria Gradinariu Potop-Butucaru et Hervé Rivano. 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. pp.0, 2010. 〈inria-00477413〉
  • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno, Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Paola Boldi and Luisa Gargano. Fifth International conference on Fun with Algorithms (FUN 2010), Jun 2010, Ischia, Italy. Springer, 6099, pp.121-132, 2010, Lecture Notes in Computer Science. 〈10.1007/978-3-642-13122-6_14〉. 〈inria-00495443〉
  • David Coudert. Graph searching games for the WDM reconfiguration problem. 24th European Conference on Operational Research (EURO), Jul 2010, Lisbon, Portugal. 2010. 〈inria-00482113〉
  • Brigitte Jaumard, Nazmun Nahar Bhuiyan, Samir Sebbah, Florian Huc, David Coudert. A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks. 11th International Conference on High Performance Switching and Routing (HPSR), Jun 2010, Richardson, Texas, USA, Canada. IEEE, pp.8, 2010, 〈10.1109/HPSR.2010.5580274〉. 〈inria-00482119〉
  • Brigitte Jaumard, Nazmun Nahar Bhuiyan, Samir Sebbah, Florian Huc, David Coudert. A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks. 10th INFORMS Telecommunications Conference, May 2010, Montréal, Canada. 2010. 〈inria-00482121〉
  • David Coudert, Napoleao Nepomuceno, Hervé Rivano. Minimizing Energy Consumption by Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks. 1st IEEE WoWMoM Workshop on Hot Topics in Mesh Networking (HotMESH), Jun 2009, Kos, Greece. IEEE, 2009, 〈10.1109/WOWMOM.2009.5282434〉. 〈inria-00429148〉
  • Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, et al.. MPLS label stacking on the line network. Springer. IFIP Networking, May 2009, Aachen, Germany. pp.809-820, 2009, LNCS 5550/2009. 〈10.1007/978-3-642-01399-7〉. 〈hal-00371115v2〉
  • David Coudert, Dorian Mazauric, Nicolas Nisse. On Rerouting Connection Requests in Networks with Shared Bandwidth. DIMAP Workshop on Algorithmic Graph Theory (AGT), 2009, Warwick, United Kingdom. 32, 2009, Electronic Note Discrete Maths. 〈10.1016/j.endm.2009.02.015〉. 〈inria-00423452〉
  • David Coudert, Frédéric Giroire, Ignasi Sau. Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids. International Workshop on Combinatorial Algorithms -- IWOCA, Jun 2009, Hradec nad Moravicì, Czech Republic. Springer, 5874, 2009, Lecture Notes in Computer Science. 〈inria-00429146〉
  • David Coudert, Napoleão Nepomuceno, Hervé Rivano. Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks. Chaintreau, Augustin and Magnien, Clemence. AlgoTel, 2009, Carry-Le-Rouet, France. 2009. 〈inria-00384968〉
  • David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse, Jean-Sébastien Sereni. Reconfiguration dans les réseaux optiques. Chaintreau, Augustin and Magnien, Clemence. 11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2009, Carry-Le-Rouet, France. 2009. 〈inria-00383206〉
  • David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse, Jean-Sébastien Sereni. Reconfiguration of the Routing in WDM Networks with Two Classes of Services. Conference on Optical Network Design and Modeling (ONDM), 2009, Braunschweig, Germany. 2009. 〈inria-00423453〉
  • Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Fernando Solano Donado. Designing Hypergraph Layouts to GMPLS Routing Strategies. SIROCCO, May 2009, Piran, Slovenia. 2009. 〈inria-00428685〉
  • David Coudert, Florian Huc, Fabrice Peix, Marie-Emilie Voge. Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints. IEEE International Conference on Communications (ICC '08), May 2008, Beijing, China. IEEE, pp.5170 - 5174, 2008, 〈10.1109/ICC.2008.971〉. 〈inria-00429150〉
  • David Coudert, Florian Huc, Dorian Mazauric. Computing and updating the process number in trees. Baker, Theodore P. and Bui, Alain and Tixeuil, Sébastien. 12th International Conference On Principles Of DIstributed Systems (OPODIS), Dec 2008, Luxor, Egypt. Springer, 5401, 2008, Lecture Notes in Computer Science. 〈10.1007/978-3-540-92221-6_37〉. 〈inria-00429149〉
  • David Coudert, Florian Huc, Dorian Mazauric. A distributed algorithm for computing and updating the process number of a forest. Gabi Taubenfeld. 22nd International Symposium on Distributed Computing (DISC), 2008, Arcachon, France, France. Springer, 5218, pp.500-501, 2008. 〈inria-00373850〉
  • David Coudert, Florian Huc, Dorian Mazauric. Algorithme générique pour les jeux de capture dans les arbres. David and Sebastien Tixeuil. 10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), 2008, Saint-Malo, France. pp.37-40, 2008. 〈inria-00374452〉
  • Jean-Claude Bermond, David Coudert, Xavier Munoz, Ignasi Sau. Traffic Grooming in Bidirectional WDM Ring Networks. International Conference on Transparent Optical Networks (ICTON), Jun 2006, Nottingham, United Kingdom. IEEE / LEOS, 3, pp.19 - 22, 2006, 〈10.1109/ICTON.2006.248390〉. 〈inria-00429168〉
  • David Coudert, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge. Shared Risk Resource Groups and Survivability in Multilayer Networks. International Conference on Transparent Optical Networks (ICTON), Jun 2006, Nottingham, United Kingdom. IEEE / LEOS, 3, pp.235 - 238, 2006, 〈10.1109/ICTON.2006.248442〉. 〈inria-00429170〉
  • Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes. Optimal Solution of the Maximum All Request Path Grooming Problem. Advanced International Conference on Telecommunications (AICT), Feb 2006, Le Gosier, Guadeloupe, France. IEEE, 2006, 〈10.1109/AICT-ICIW.2006.144〉. 〈inria-00429167〉
  • Jean-Claude Bermond, Laurent Braud, David Coudert. Traffic Grooming on the Path. 12th International Colloquium on Structural Information and Communication Complexity (SIROCCO), May 2005, Mont Saint-Michel, France. Springer, pp.34-48, 2005, Lecture Notes in Computer Science. 〈10.1007/11429647_5〉. 〈inria-00429172〉
  • David Coudert, Stéphane Pérennes, Quang-Cuong Pham, Jean-Sébastien Sereni. Rerouting requests in WDM networks. 7eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), May 2005, Presqu'île de Giens, France. pp.17-20, 2005. 〈inria-00429173〉
  • David Coudert, Hervé Rivano, Xavier Roche. A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem. International Workshop on Approximation and Online Algorithms (WAOA'03), 2003, Budapest, Hungary. Springer, 2909, pp.193-230, 2003, Lecture Notes in Computer Science. 〈10.1007/b95598〉. 〈inria-00429176〉
  • Jean-Claude Bermond, David Coudert. Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory. IEEE International Conference on Communications (ICC '03)., May 2003, Anchorage, United States. IEEE, 2, pp.1402 - 1406, 2003, 〈10.1109/ICC.2003.1204621〉. 〈inria-00429174〉
  • Jean-Claude Bermond, David Coudert, Xavier Munoz. Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case. 7th IFIP Working Conference on Optical Network Design & Modelling (ONDM), 2003, Budapest, Hungary. IFIP TC6, pp.1135-1153, 2003. 〈inria-00429175〉
  • Mohamed Bouklit, David Coudert, Jean-François Lalande, Hervé Rivano. Approximation Combinatoire de Multiflot Factionnaire : Améliorations. AlgoTel'03 : 5ièmes Rencontres Francophones sur les Aspects ALGOrithmiques des TELécommunications, May 2003, Banyuls-sur-Mer, France. 2003, 〈http://dept-info.labri.fr/~gavoille/algotel03/〉. 〈lirmm-00269814〉
  • Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano. Approximate Multicommodity Flow for WDM Networks Design. SIROCCO: Structural Information and Communication Complexity, Jun 2003, Umeä, Sweden. Carleton Scientific, 10th (17), pp.43-56, 2003. 〈lirmm-00269524〉
  • David Coudert, Hervé Rivano. Routage optique dans les réseaux WDM multifibres avec conversion partielle. Quatrièmes Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), May 2002, Mèze, France. pp.17-24, 2002. 〈inria-00429178〉
  • David Coudert, Hervé Rivano. Lightpath assignment for multifibers WDM networks with wavelength translators. IEEE Global Telecommunications Conference (Globecom'02), 2002, Taipei, Taiwan. IEEE, 3, pp.2686 - 2690, 2002, 〈10.1109/GLOCOM.2002.1189117〉. 〈inria-00429177〉
  • David Coudert. Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications. 3eme Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2001, Saint Jean de Luz, France. pp.47-53, 2001. 〈inria-00429185〉
  • Jean-Claude Bermond, David Coudert, Lilian Chacon, Francois Tillerot. A note on cycle covering. ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2001, Hersonissos, Greece. ACM, pp.310-311, 2001, 〈http://doi.acm.org/10.1145/378580.378716〉. 〈10.1145/378580.378716〉. 〈inria-00429182〉
  • David Coudert, Xavier Munoz. How Graph Theory can help Communications Engineering. D.K. Gautam. Broad band optical fiber communications technology (BBOFCT), Dec 2001, Jalgaon, India. pp.47-61, 2001. 〈inria-00429187〉
  • Jean-Claude Bermond, Lilian Chacon, David Coudert, Francois Tillerot. Cycle Covering. 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Jun 2001, Vall de Nuria, Spain. Carleton Scientific, pp.21-34, 2001, Proceedings in Informatics. 〈inria-00429183〉
  • Jean-Claude Bermond, Lilian Chacon, David Coudert, Francois Tillerot. Conception d'un réseau WDM protégé par sous-réseaux. Eric Fleury. 2ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'00), May 2000, La Rochelle, France. INRIA, ISBN 2-7261-1157-2, pp.83-88, 2000. 〈inria-00429292〉
  • David Coudert, Afonso Ferreira, Stéphane Pérennes. De Bruijn isomorphisms and free space optical networks. 14th International Parallel and Distributed Processing Symposium (IPDPS 2000), May 2000, Cancun, Mexico. IEEE, pp.769 - 774, 2000, 〈10.1109/IPDPS.2000.846063〉. 〈inria-00429190〉
  • David Coudert, Afonso Ferreira, Xavier Munoz. OTIS-Based Multi-Hop Multi-OPS Lightwave Networks. 3rd Workshop on Optics and Computer Science (WOCS), Apr 1999, San Juan, Puerto Rico. Springer, 1586, pp.897-910, 1999, Lecture Notes in Computer Science. 〈10.1007/BFb0097975〉. 〈inria-00429192〉
  • David Coudert, Afonso Ferreira, Stéphane Pérennes. Theoretical Aspects of the Optical Transpose Interconnecting System Architecture. Première Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), May 1999, Roscoff, France. pp.101-106, 1999. 〈inria-00429194〉
  • David Coudert, Afonso Ferreira, Xavier Munoz. Multiprocessor Architectures Using Multi-hops Multi-OPS Lightwave Networks and Distributed Control. First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (IPPS/SPDP 1998), Mar 1998, Orlanda, United States. IEEE, pp.151 - 155, 1998, 〈http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=669903&isnumber=14764〉. 〈10.1109/IPPS.1998.669903〉. 〈inria-00429196〉

Ouvrage (y compris édition critique et traduction)1 document

  • David Coudert, David Simplot-Ryl. Ad Hoc & Sensor Wireless Networks, an International Journal -- Special issue on Ad hoc, Mobile and Wireless Networks. Coudert, D. and Simplot-Ryl, D. Old City Publishing, 9, pp.137, 2010. 〈inria-00531585〉

Chapitre d'ouvrage3 documents

  • Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, et al.. Traffic Grooming: Combinatorial Results and Practical Resolutions.. Arie Koster and Xavier Muñoz. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks., XXVII, Springer, pp.63-94, 2010, EATCS Texts in Theoretical Computer Science, 978-3-642-02249-4. 〈10.1007/978-3-642-02250-0〉. 〈inria-00530964〉
  • Jean-Claude Bermond, David Coudert. Grooming. Charles J. Colbourn and Jeffrey H. Dinitz. Handbook of Combinatorial Designs (2nd edition), 42, Chapman & Hall- CRC Press, pp.494-496, 2006, Discrete mathematics and Applications, 1584885068. 〈inria-00429215〉
  • David Coudert, Xavier Munoz. Graph Theory and Traffic Grooming in WDM Rings. S.G. Pandalai. Recent Research Developments in Optics, 3, Research Signpost, pp.759-778, 2003, 81-271-0028-5. 〈inria-00429212〉

Brevet1 document

  • Luc Hogie, Issam Tahiri, Aurélien Lancin, Nathann Cohen, David Coudert. GRPH: The high performance graph library for Java. France, Patent n° : FR.001.310007.000.S.P.2011.000.31235. 2011. 〈hal-01355741〉

Rapport41 documents

  • David Coudert, Guillaume Ducoffe, 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. 2017. 〈hal-01562413v1〉
  • Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, et al.. Bin packing with colocations. [Research Report] Inria; I3S. 2016. 〈hal-01381333〉
  • David Coudert, James Luedtke, Eduardo Moreno, Konstantinos Priftis. Computing and maximizing the exact reliability of wireless backhaul networks. [Research Report] Inria Sophia Antipolis; I3S. 2016, pp.9. 〈hal-01394593〉
  • David Coudert. A note on Integer Linear Programming formulations for linear ordering problems on graphs. [Research Report] Inria; I3S; Universite Nice Sophia Antipolis; CNRS. 2016, pp.33. 〈hal-01271838〉
  • David Coudert, Guillaume Ducoffe. Clique-decomposition revisited. [Research Report] INRIA Sophia Antipolis - I3S. 2016. 〈hal-01266147〉
  • David Coudert, Guillaume Ducoffe. Data center interconnection networks are not hyperbolic. [Research Report] Inria Sophia Antipolis; I3S; Université Nice Sophia Antipolis; CNRS. 2015, pp.23. 〈hal-01149203〉
  • David Coudert, Dorian Mazauric, Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth. [Research Report] RR-8470, INRIA. 2014, pp.301. 〈hal-00943549〉
  • David Coudert, Guillaume Ducoffe. On the recognition of $C_4$-free and $1/2$-hyperbolic graphs. [Research Report] RR-8458, INRIA. 2014, pp.20. 〈hal-00937935v2〉
  • Nathann Cohen, David Coudert, Guillaume Ducoffe, Aurélien Lancin. Applying clique-decomposition for computing Gromov hyperbolicity. [Research Report] RR-8535, INRIA. 2014, pp.33. 〈hal-00989024v2〉
  • David Coudert, Guillaume Ducoffe, Nicolas Nisse. Diameter of Minimal Separators in Graphs. [Research Report] RR-8639, Inria Sophia Antipolis; I3S; INRIA. 2014, pp.16. 〈hal-01088423v2〉
  • David Coudert, Alvinice Kodjo, Khoa Phan. Robust Energy-aware Routing with Redundancy Elimination. [Research Report] RR-8457, INRIA. 2014. 〈hal-00936745〉
  • Deepesh Agarwal, Christelle Caillouet, David Coudert, Frédéric Cazals. Unveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems. [Research Report] RR-8622, Inria. 2014. 〈hal-01078378v2〉
  • Deepesh Agarwal, Julio Araujo, Christelle Caillouet, Frédéric Cazals, David Coudert, et al.. Connectivity Inference in Mass Spectrometry based Structure Determination. [Research Report] RR-8320, INRIA. 2013, pp.23. 〈hal-00837496〉
  • David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, et al.. Feasibility study on distributed simulations of BGP. [Research Report] RR-8283, 2013, pp.24. 〈hal-00813481〉
  • Omid Amini, David Coudert, Nicolas Nisse. Some Results on Non-deterministic Graph Searching in Trees. [Research Report] 2013, pp.27. 〈inria-00174965v3〉
  • Nathann Cohen, David Coudert, Aurélien Lancin. Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs. [Research Report] RR-8074, INRIA. 2012. 〈hal-00735481v4〉
  • Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz. Diverse Routing with the star property. [Research Report] RR-8071, INRIA. 2012. 〈hal-00733869〉
  • Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, Issam Tahiri. Reconfiguration with physical constraints in WDM networks. [Research Report] RR-7850, INRIA. 2011. 〈hal-00654111〉
  • Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Fernando Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. [Research Report] RR-7071, INRIA. 2009. 〈inria-00426681〉
  • David Coudert, Frédéric Giroire, Ignasi Sau. Circuit visiting 10 ordered vertices in infinite grids. [Research Report] RR-6910, INRIA. 2009. 〈inria-00378586〉
  • Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, et al.. MPLS label stacking on the line network. [Research Report] RR-6803, INRIA. 2009. 〈inria-00354267〉
  • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse. Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks. [Research Report] RR-7047, INRIA. 2009. 〈inria-00421140v4〉
  • Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, et al.. GMPLS Routing Strategies based on the Design of Hypergraph Layouts. [Research Report] RR-6842, INRIA. 2009. 〈inria-00360576〉
  • Jean-Claude Bermond, David Coudert, Joseph Peters. Online Distributed Traffic Grooming on Path Networks. [Research Report] RR-6833, INRIA. 2009. 〈inria-00359810v2〉
  • David Coudert, Dorian Mazauric, Nicolas Nisse. Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.. [Research Report] RR-6790, INRIA. 2009, pp.12. 〈inria-00350025〉
  • David Coudert, Dorian Mazauric. Network Reconfiguration using Cops-and-Robber Games. [Research Report] RR-6694, INRIA. 2008. 〈inria-00315568v3〉
  • David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse, Jean-Sébastien Sereni. Routing Reconfiguration/Process Number: Coping wih Two Classes of Services. [Research Report] RR-6698, INRIA. 2008, pp.15. 〈inria-00331807〉
  • David Coudert, Jean-Sébastien Sereni. Characterization of graphs and digraphs with small process number. [Research Report] RR-6285, INRIA. 2008, pp.26. 〈inria-00171083v4〉
  • David Coudert, Florian Huc, Dorian Mazauric. A distributed algorithm for computing and updating the process number of a forest. [Research Report] RR-6560, INRIA. 2008. 〈inria-00288304v3〉
  • David Coudert, Napoleão Nepomuceno, Hervé Rivano. Wireless Backhaul Networks: Minimizing Energy Consumption by Power-Efficient Radio Links Configuration. [Research Report] RR-6752, INRIA. 2008. 〈inria-00344344v2〉
  • Jean-Claude Bermond, David Coudert, Benjamin Lévêque. Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring. [Research Report] 2007, pp.11. 〈inria-00175795〉
  • David Coudert, Florian Huc, Fabrice Peix, Marie-Emilie Voge. On Minimizing the Average Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints. [Research Report] 2007, pp.12. 〈inria-00175813〉
  • David Coudert, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge. Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues. [Research Report] 2007, pp.17. 〈inria-00175143〉
  • Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes. Optimal Solution of the Maximum All Request Path Grooming Problem. [Research Report] RR-5627, INRIA. 2006, pp.12. 〈inria-00070381〉
  • David Coudert, Florian Huc, Jean-Sébastien Sereni. Pathwidth of outerplanar graphs. [Research Report] RR-5804, INRIA. 2006, pp.12. 〈inria-00070220〉
  • Jean-Claude Bermond, Laurent Braud, David Coudert. Traffic Grooming on the Path. [Research Report] RR-5645, INRIA. 2006, pp.29. 〈inria-00070363〉
  • David Coudert, Pallab Datta, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge. Complexity and approximability issues of Shared Risk Resource Group. [Research Report] RR-5859, INRIA. 2006, pp.20. 〈inria-00070167〉
  • David Coudert, P. Datta, Hervé Rivano, 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. 〈inria-00466486〉
  • David Coudert, Hervé Rivano. Lightpath assignment for multifibers wdm optical networks with wavelength translators. RR-4487, INRIA. 2002. 〈inria-00072101〉
  • Jean-Claude Bermond, David Coudert, Min-Li Yu. On DRC-Covering of K_n by Cycles. [Research Report] RR-4299, INRIA. 2001. 〈inria-00072288〉
  • David Coudert, Afonso Ferreira, Stéphane Pérennes. Digraph Isomorphisms and Free Space Optical Networks. [Research Report] RR-3817, INRIA. 1999. 〈inria-00072841〉

Thèse1 document

  • David Coudert. Algorithmique et optimisation de réseaux de communications optiques. Modélisation et simulation. Université Nice Sophia Antipolis, 2001. Français. 〈tel-00008087〉

HDR1 document

  • David Coudert. Algorithmique et optimisation dans les réseaux de télécommunications. Réseaux et télécommunications [cs.NI]. Université Nice Sophia Antipolis, 2010. 〈tel-00466400〉