David Coudert
- Combinatorics, Optimization and Algorithms for Telecommunications (COATI)
Publications
Publications
|
|
Fast Landmark Reconfiguration for Highway Cover IndexesEDBT 2026 - 29th International Conference on Extending Database Technology, Mar 2026, Tampere, Finland. pp.208--220, ⟨10.48786/edbt.2026.18⟩ |
|
|
Indexing Graphs for Shortest Beer Path QueriesATMOS 2024 - 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Sep 2024, London, United Kingdom. ⟨10.4230/OASIcs.ATMOS.2024.2⟩ |
|
|
Practical Computation of Graph VC-DimensionSEA 2024 - Symposium on Experimental Algorithms, Jul 2024, Vienne, Austria. pp.20, ⟨10.4230/LIPIcs.SEA.2024.8⟩ |
|
|
Groupage sur le chemin pour borner la largeur de coupeAlgoTel 2023 - 25èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2023, Cargese, France. pp.4 |
|
|
On Finding k Earliest Arrival Time Journeys in Public Transit NetworksICORES 2022 - 11th International Conference on Operations Research and Enterprise Systems, Feb 2022, Virtual event, France. pp.314-325, ⟨10.5220/0010977200003117⟩ |
|
|
Hyperbolicity Computation through Dominating SetsALENEX 2022 - SIAM Symposium on Algorithm Engineering and Experiments, Jan 2022, Alexandria, VA, United States. pp.78-90, ⟨10.1137/1.9781611977042.7⟩ |
|
|
Dominer pour calculer l'hyperbolicité des graphesAlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2022, Saint-Rémy-Lès-Chevreuse, France |
|
|
De la difficulté de trouver des chemins dissimilairesALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2021, La Rochelle, France |
|
|
Minimum Disturbance Rerouting to Optimize Bandwidth UsageONDM 2021 - International Conference on Optical Network Design and Modeling, Jun 2021, Gothenburg, Sweden. pp.1-6, ⟨10.23919/ONDM51796.2021.9492388⟩ |
|
|
Optimizing FANET deployment for mobile sensor tracking in disaster management scenarioICT-DM 2021 - 7th International Conference on Information and Communication Technologies for Disaster Management, Dec 2021, Hangzhou, China. pp.134-141, ⟨10.1109/ICT-DM52643.2021.9664204⟩ |
|
|
Compromis espace-temps pour le problème de k plus courts chemins simplesALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France. pp.4 |
|
|
VESPA, ou l'art de coordonner une flotte de drone sans leaderALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France. pp.1-4 |
|
|
Space and Time Trade-Off for the k Shortest Simple Paths ProblemSEA 2020 - 18th International Symposium on Experimental Algorithms, Jun 2020, Catania, Italy. pp.13, ⟨10.4230/LIPIcs.SEA.2020.18⟩ |
|
|
Self-organized UAV-based Supervision and Connectivity: Challenges and OpportunitiesNCA 2019 - 18th IEEE International Symposium on Network Computing and Applications, Sep 2019, Cambridge, United States. pp.1-5, ⟨10.1109/NCA.2019.8935060⟩ |
|
|
Self-organized Disaster Management System by Distributed Deployment of Connected UAVsICT-DM 2019 - 6th International Conference on Information and Communication Technologies for Disaster Management, Dec 2019, Paris, France. pp.1-8, ⟨10.1109/ICT-DM47966.2019.9032964⟩ |
|
|
Efficient Make Before Break Capacity DefragmentationIEEE International Conference on High Performance Switching and Routing, Jun 2018, Bucharest, Romania. pp.6, ⟨10.1109/HPSR.2018.8850754⟩ |
|
|
Make-Before-Break Wavelength Defragmentation20th International Conference on Transparent Optical Networks (ICTON), Jul 2018, Bucharest, Romania. pp.5, ⟨10.1109/ICTON.2018.8473893⟩ |
|
|
Fully polynomial FPT algorithms for some classes of bounded clique-width graphsACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.20, ⟨10.1137/1.9781611975031.176⟩ |
|
|
Computing and maximizing the exact reliability of wireless backhaul networksInternational Network Optimization Conference, Feb 2017, Lisbon, Portugal. pp.85-94, ⟨10.1016/j.endm.2018.01.010⟩ |
|
|
Modèle d'optimisation pour la défragmentation de la capacitéALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2018, Roscoff, France |
|
|
Bin Packing with Colocations14th International Workshop on Approximation and Online Algorithms (WAOA), Aug 2016, Aarhus, Denmark. pp.40-51, ⟨10.1007/978-3-319-51741-4_4⟩ |
|
|
A simple approach for lower-bounding the distortion in any Hyperbolic embeddingEUROCOMB'17 -- The European Conference on Combinatorics, Graph Theory and Applications, Aug 2017, Vienna, Austria. pp.293 - 299, ⟨10.1016/j.endm.2017.06.051⟩ |
|
|
Liens entre symétries et étirements de routages dans les réseaux d'interconnexions de centres de donnéesALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France |
|
|
Structure vs métrique dans les graphesALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France |
|
|
On Computing the Hyperbolicity of Real-World Graphs23rd Annual European Symposium on Algorithms (ESA), Sep 2015, Patras, Greece. pp.215-226, ⟨10.1007/978-3-662-48350-3_19⟩ |
|
|
Dimensioning microwave wireless networksICC 2015 : IEEE International Conference on Communications, Jun 2015, London, United Kingdom. pp.2803 - 2809, ⟨10.1109/ICC.2015.7248751⟩ |
|
|
Robust Optimization for Energy-aware Routing with Redundancy EliminationALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le-Bois-Plage-en-Ré, France. pp.1-4 |
Optimisation robuste pour le partage de réseaux d'accès micro-ondes entre opérateursROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France |
|
|
|
Dynamic Routing and Spectrum Assignment with Non-Disruptive DefragmentationALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4 |
|
|
Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth13th International Symposium on Experimental Algorithms, 2014, Copenhagen, Denmark. pp.46-58 |
|
|
Algorithme exact et approché pour le calcul de l'hyperbolicité d'un grapheAlgoTel 2013 - 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2013, Pornic, France. pp.1-4 |
|
|
SRLG-Diverse Routing with the Star PropertyDesign of Reliable Communication Networks, DRCN, Mar 2013, Budapest, Hungary |
|
|
Diverse Routing with Star SRLGs15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.1-4 |
|
|
Robust optimization in multi-operators microwave backhaul networks4th Global Information Infrastructure and Networking Symposium, Oct 2013, Trento, Italy. pp.1-6 |
Connectivity Inference in Mass Spectrometry based Structure DeterminationEuropean Symposium on Algorithms, Sep 2013, Sophia-Antipolis, France, France. pp.289-300, ⟨10.1007/978-3-642-40450-4_25⟩ |
|
|
|
Robust Redundancy Elimination for Energy-aware RoutingThe 2013 IEEE International Conference on Green Computing and Communications (GreenCom 2013), Aug 2013, Beijing, China |
|
|
Diverse Routing in Networks with Star SRLGsACM CoNEXT Student Workshop, Dec 2012, Nice, France. pp.1-2 |
|
|
Feasibility study on distributed simulations of BGPPADS 2012 - 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation, Jul 2012, Zhangjiajie, China |
|
|
Reconfiguration with physical constraints in WDM networksWorkshop on New Trends in Optical Networks Survivability, 2012, Canada. pp.5 |
|
|
Energy saving in fixed wireless broadband networksInternationale Network Optimization Conference (INOC), Jun 2011, Hamburg, Germany. pp.484-489, ⟨10.1007/978-3-642-21527-8_53⟩ |
|
|
A Chance-Constrained Model & Cutting Planes for Fixed Broadband Wireless NetworksInternationale Network Optimization Conference (INOC), Jun 2011, Hamburg, Germany. pp.37-42, ⟨10.1007/978-3-642-21527-8_5⟩ |
|
|
Reconfiguration avec contraintes physiques dans les réseaux WDM13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France |
|
|
Optimisation de la consommation énergétique dans les réseaux sans fil fixes13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France |
|
|
Bandwidth assignment for reliable fixed broadband wireless networks12th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), Jun 2011, Lucca, Italy. pp.1-6, ⟨10.1109/WoWMoM.2011.5986471⟩ |
|
|
Tradeoffs in process strategy games with application in the WDM reconfiguration problemFifth International conference on Fun with Algorithms (FUN 2010), Jun 2010, Ischia, Italy. pp.121-132, ⟨10.1007/978-3-642-13122-6_14⟩ |
Graph searching games for the WDM reconfiguration problem24th European Conference on Operational Research (EURO), Jul 2010, Lisbon, Portugal |
|
|
|
A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks11th International Conference on High Performance Switching and Routing (HPSR), Jun 2010, Richardson, Texas, USA, Canada. pp.8, ⟨10.1109/HPSR.2010.5580274⟩ |
A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks10th INFORMS Telecommunications Conference, May 2010, Montréal, Canada |
|
|
|
Tradeoffs in routing reconfiguration problems12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. pp.0 |
|
|
Edge-Simple Circuits Through 10 Ordered Vertices in Square GridsInternational Workshop on Combinatorial Algorithms -- IWOCA, Jun 2009, Hradec nad Moravicì, Czech Republic |
On Rerouting Connection Requests in Networks with Shared BandwidthDIMAP Workshop on Algorithmic Graph Theory (AGT), 2009, Warwick, United Kingdom. ⟨10.1016/j.endm.2009.02.015⟩ |
|
|
|
Minimizing Energy Consumption by Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks1st IEEE WoWMoM Workshop on Hot Topics in Mesh Networking (HotMESH), Jun 2009, Kos, Greece. ⟨10.1109/WOWMOM.2009.5282434⟩ |
|
|
MPLS label stacking on the line networkIFIP Networking, May 2009, Aachen, Germany. pp.809-820, ⟨10.1007/978-3-642-01399-7⟩ |
|
|
Reconfiguration dans les réseaux optiques11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2009, Carry-Le-Rouet, France |
|
|
Designing Hypergraph Layouts to GMPLS Routing StrategiesSIROCCO, May 2009, Piran, Slovenia |
|
|
Reconfiguration of the Routing in WDM Networks with Two Classes of ServicesConference on Optical Network Design and Modeling (ONDM), 2009, Braunschweig, Germany |
|
|
Joint Optimization of Routing and Radio Configuration in Fixed Wireless NetworksAlgoTel, 2009, Carry-Le-Rouet, France |
|
|
Computing and updating the process number in trees12th International Conference On Principles Of DIstributed Systems (OPODIS), Dec 2008, Luxor, Egypt. ⟨10.1007/978-3-540-92221-6_37⟩ |
|
|
Algorithme générique pour les jeux de capture dans les arbres10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), 2008, Saint-Malo, France. pp.37-40 |
|
|
A distributed algorithm for computing and updating the process number of a forest22nd International Symposium on Distributed Computing (DISC), 2008, Arcachon, France, France. pp.500-501 |
|
|
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs ConstraintsIEEE International Conference on Communications (ICC '08), May 2008, Beijing, China. pp.5170 - 5174, ⟨10.1109/ICC.2008.971⟩ |
|
|
Traffic Grooming in Bidirectional WDM Ring NetworksInternational Conference on Transparent Optical Networks (ICTON), Jun 2006, Nottingham, United Kingdom. pp.19 - 22, ⟨10.1109/ICTON.2006.248390⟩ |
|
|
Optimal Solution of the Maximum All Request Path Grooming ProblemAdvanced International Conference on Telecommunications (AICT), Feb 2006, Le Gosier, Guadeloupe, France. ⟨10.1109/AICT-ICIW.2006.144⟩ |
|
|
Shared Risk Resource Groups and Survivability in Multilayer NetworksInternational Conference on Transparent Optical Networks (ICTON), Jun 2006, Nottingham, United Kingdom. pp.235 - 238, ⟨10.1109/ICTON.2006.248442⟩ |
|
|
Rerouting requests in WDM networks7eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), May 2005, Presqu'île de Giens, France. pp.17-20 |
|
|
Traffic Grooming on the Path12th International Colloquium on Structural Information and Communication Complexity (SIROCCO), May 2005, Mont Saint-Michel, France. pp.34-48, ⟨10.1007/11429647_5⟩ |
|
|
Approximate Multicommodity Flow for WDM Networks DesignSIROCCO: Structural Information and Communication Complexity, Jun 2003, Umeä, Sweden. pp.43-56 |
|
|
Approximation Combinatoire de Multiflot Factionnaire : AméliorationsAlgoTel: Aspects Algorithmiques des Télécommunications, May 2003, Banyuls-sur-Mer, France |
|
|
Traffic Grooming in Unidirectional WDM Ring Networks using Design TheoryIEEE International Conference on Communications (ICC '03)., May 2003, Anchorage, United States. pp.1402 - 1406, ⟨10.1109/ICC.2003.1204621⟩ |
|
|
Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case7th IFIP Working Conference on Optical Network Design & Modelling (ONDM), 2003, Budapest, Hungary. pp.1135-1153 |
|
|
A Combinatorial Approximation Algorithm for the Multicommodity Flow ProblemInternational Workshop on Approximation and Online Algorithms (WAOA'03), 2003, Budapest, Hungary. pp.193-230, ⟨10.1007/b95598⟩ |
|
|
Routage optique dans les réseaux WDM multifibres avec conversion partielleQuatrièmes Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), May 2002, Mèze, France. pp.17-24 |
|
|
Lightpath assignment for multifibers WDM networks with wavelength translatorsIEEE Global Telecommunications Conference (Globecom'02), 2002, Taipei, Taiwan. pp.2686 - 2690, ⟨10.1109/GLOCOM.2002.1189117⟩ |
|
|
How Graph Theory can help Communications EngineeringBroad band optical fiber communications technology (BBOFCT), Dec 2001, Jalgaon, India. pp.47-61 |
|
|
Cycle Covering8th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Jun 2001, Vall de Nuria, Spain. pp.21-34 |
|
|
Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications3eme Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2001, Saint Jean de Luz, France. pp.47-53 |
|
|
A note on cycle coveringACM Symposium on Parallel Algorithms and Architectures (SPAA), 2001, Hersonissos, Greece. pp.310-311, ⟨10.1145/378580.378716⟩ |
|
|
De Bruijn isomorphisms and free space optical networks14th International Parallel and Distributed Processing Symposium (IPDPS 2000), May 2000, Cancun, Mexico. pp.769 - 774, ⟨10.1109/IPDPS.2000.846063⟩ |
|
|
Conception d'un réseau WDM protégé par sous-réseaux2ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'00), Karell Bertet and Isabelle Chrisment and Eric Fleury, May 2000, La Rochelle, France. pp.83-88 |
|
|
OTIS-Based Multi-Hop Multi-OPS Lightwave Networks3rd Workshop on Optics and Computer Science (WOCS), Apr 1999, San Juan, Puerto Rico. pp.897-910, ⟨10.1007/BFb0097975⟩ |
|
|
Theoretical Aspects of the Optical Transpose Interconnecting System ArchitecturePremière Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), May 1999, Roscoff, France. pp.101-106 |
|
|
Multiprocessor Architectures Using Multi-hops Multi-OPS Lightwave Networks and Distributed ControlFirst Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (IPPS/SPDP 1998), Mar 1998, Orlanda, United States. pp.151 - 155, ⟨10.1109/IPPS.1998.669903⟩ |
Ad Hoc & Sensor Wireless Networks, an International Journal -- Special issue on Ad hoc, Mobile and Wireless NetworksCoudert, D. and Simplot-Ryl, D. Old City Publishing, 9, pp.137, 2010 |
|
|
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⟩ |
|
|
GroomingCharles 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 |
|
|
Graph Theory and Traffic Grooming in WDM RingsS.G. Pandalai. Recent Research Developments in Optics, 3, Research Signpost, pp.759-778, 2003, 81-271-0028-5 |
19th International Symposium on Experimental Algorithms (SEA 2021)Leibniz International Proceedings in Informatics , 190, pp.434, 2021, ⟨10.4230/LIPIcs.SEA.2021⟩ |
GRPHFrance, Patent n° : FR.001.310007.000.S.P.2011.000.31235. 2011 |
|
|
Colouring the interference digraph of a set of requests in a bidirected tree2026 |
|
|
New lower bounds on the cutwidth of graphsInria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2024 |
|
|
Maximum number of requests on a path with a given grooming factorInria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2024, pp.20 |
|
|
On the complexity of finding $k$ shortest dissimilar paths in a graph[Research Report] Inria; CNRS; I3S; Université Côte d’Azur. 2021, pp.9 |
|
|
Enumeration of far-apart pairs by decreasing distance for faster hyperbolicity computation[Research Report] Inria; I3S, Université Côte d'Azur. 2021 |
|
|
On finding $k$ earliest arrival time journeys in public transit networks[Research Report] Inria. 2021 |
|
|
Space and time trade-off for the k shortest simple paths problem[Research Report] Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2020 |
|
|
VESPA: Constrained target coverage by distributed deployment of connected UAVs[Research Report] Inria; I3S, Université Côte d'Azur; IMT Atlantique. 2019 |
|
|
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, pp.1-60 |
|
|
Distance-preserving orderings in graphs[Research Report] RR-8973, Inria Sophia Antipolis. 2016, pp.1-23 |
|
|
Bin packing with colocations[Research Report] Inria; I3S. 2016 |
|
|
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 |
|
|
Computing and maximizing the exact reliability of wireless backhaul networks[Research Report] Inria Sophia Antipolis; I3S. 2016, pp.9 |
|
|
Clique-decomposition revisited[Research Report] INRIA Sophia Antipolis - I3S. 2016 |
|
|
Data center interconnection networks are not hyperbolic[Research Report] Inria Sophia Antipolis; I3S; Université Nice Sophia Antipolis; CNRS. 2015, pp.23 |
|
|
On the recognition of $C_4$-free and $1/2$-hyperbolic graphs[Research Report] RR-8458, INRIA. 2014, pp.20 |
|
|
Unveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems[Research Report] RR-8622, Inria. 2014 |
|
|
Robust Energy-aware Routing with Redundancy Elimination[Research Report] RR-8457, INRIA. 2014 |
|
|
Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth[Research Report] RR-8470, INRIA. 2014, pp.301 |
|
|
Diameter of Minimal Separators in Graphs[Research Report] RR-8639, Inria Sophia Antipolis; I3S; INRIA. 2014, pp.16 |
|
|
Applying clique-decomposition for computing Gromov hyperbolicity[Research Report] RR-8535, INRIA. 2014, pp.33 |
|
|
Some Results on Non-deterministic Graph Searching in Trees[Research Report] 2013, pp.27 |
|
|
Connectivity Inference in Mass Spectrometry based Structure Determination[Research Report] RR-8320, INRIA. 2013, pp.23 |
|
|
Feasibility study on distributed simulations of BGP[Research Report] RR-8283, 2013, pp.24 |
|
|
Diverse Routing with the star property[Research Report] RR-8071, INRIA. 2012 |
|
|
Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs[Research Report] RR-8074, INRIA. 2012 |
|
|
Reconfiguration with physical constraints in WDM networks[Research Report] RR-7850, INRIA. 2011 |
|
|
Circuit visiting 10 ordered vertices in infinite grids[Research Report] RR-6910, INRIA. 2009 |
|
|
GMPLS Routing Strategies based on the Design of Hypergraph Layouts[Research Report] RR-6842, INRIA. 2009 |
|
|
GMPLS Label Space Minimization through Hypergraph Layouts[Research Report] RR-7071, INRIA. 2009 |
|
|
Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.[Research Report] RR-6790, INRIA. 2009, pp.12 |
|
|
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks[Research Report] RR-7047, INRIA. 2009 |
|
|
MPLS label stacking on the line network[Research Report] RR-6803, INRIA. 2009 |
|
|
Online Distributed Traffic Grooming on Path Networks[Research Report] RR-6833, INRIA. 2009 |
|
|
Routing Reconfiguration/Process Number: Coping wih Two Classes of Services[Research Report] RR-6698, INRIA. 2008, pp.15 |
|
|
Wireless Backhaul Networks: Minimizing Energy Consumption by Power-Efficient Radio Links Configuration[Research Report] RR-6752, INRIA. 2008 |
|
|
Network Reconfiguration using Cops-and-Robber Games[Research Report] RR-6694, INRIA. 2008 |
|
|
A distributed algorithm for computing and updating the process number of a forest[Research Report] RR-6560, INRIA. 2008 |
|
|
Characterization of graphs and digraphs with small process number[Research Report] RR-6285, INRIA. 2008, pp.26 |
|
|
On Minimizing the Average Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints[Research Report] 2007, pp.12 |
|
|
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring[Research Report] 2007, pp.11 |
|
|
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues[Research Report] 2007, pp.17 |
|
|
Optimal Solution of the Maximum All Request Path Grooming Problem[Research Report] RR-5627, INRIA. 2006, pp.12 |
|
|
Pathwidth of outerplanar graphs[Research Report] RR-5804, INRIA. 2006, pp.12 |
|
|
Traffic Grooming on the Path[Research Report] RR-5645, INRIA. 2006, pp.29 |
|
|
Complexity and approximability issues of Shared Risk Resource Group[Research Report] RR-5859, INRIA. 2006, pp.20 |
Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks[Research Report] I3S Research Report I3S/RR-2005-37-FR, 2005 |
|
|
|
Lightpath assignment for multifibers wdm optical networks with wavelength translatorsRR-4487, INRIA. 2002 |
|
|
On DRC-Covering of K_n by Cycles[Research Report] RR-4299, INRIA. 2001 |
|
|
Digraph Isomorphisms and Free Space Optical Networks[Research Report] RR-3817, INRIA. 1999 |
|
|
Algorithmique et optimisation de réseaux de communications optiquesModélisation et simulation. Université Nice Sophia Antipolis, 2001. Français. ⟨NNT : ⟩ |
|
|
Algorithmique et optimisation dans les réseaux de télécommunicationsRéseaux et télécommunications [cs.NI]. Université Nice Sophia Antipolis, 2010 |
k shortest simple pathsLogiciel hal-03438331v1 |
|
HyperbolicityLogiciel hal-03438325v1 |