Search the dblp DataBase

Publications of Author

1. Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes
   Optimal Solution of the Maximum All Request Path Grooming Problem. [Citation Graph (0, 0)][DBLP]
   AICT/ICIW, 2006, pp:28- [Conf]
   
2. David Coudert, Afonso Ferreira, Xavier Muñoz
   Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control. [Citation Graph (0, 0)][DBLP]
   IPPS/SPDP, 1998, pp:151-155 [Conf]
   
3. David Coudert, Afonso Ferreira, Xavier Muñoz
   OTIS-Based Multi-Hop Multi-OPS Lightwave Networks. [Citation Graph (0, 0)][DBLP]
   IPPS/SPDP Workshops, 1999, pp:897-910 [Conf]
   
4. David Coudert, Afonso Ferreira, Stephane Perennes
   De Bruijn Isomorphisms and Free Space Optical Networks. [Citation Graph (0, 0)][DBLP]
   IPDPS, 2000, pp:769-0 [Conf]
   
5. Jean-Claude Bermond, Laurent Braud, David Coudert
   Traffic Grooming on the Path. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2005, pp:34-48 [Conf]
   
6. Jean-Claude Bermond, Lilian Chacon, David Coudert, François Tillerot
   Cycle Covering. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2001, pp:21-34 [Conf]
   
7. Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano
   Approximate Multicommodity Flow for WDM Networks Design. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2003, pp:43-56 [Conf]
   
8. Jean-Claude Bermond, David Coudert, Lilian Chacon, François Tillerot
   A note on cycle covering. [Citation Graph (0, 0)][DBLP]
   SPAA, 2001, pp:310-311 [Conf]
   
9. David Coudert, Hervé Rivano, Xavier Roche
   A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem. [Citation Graph (0, 0)][DBLP]
   WAOA, 2003, pp:256-259 [Conf]
   
10. David Coudert, Afonso Ferreira, Stephane Perennes
    Isomorphisms of the De Bruijn digraph and free-space optical networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:40, n:3, pp:155-164 [Journal]
    
11. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:2, pp:523-542 [Journal]
    
12. Jean-Claude Bermond, Laurent Braud, David Coudert
    Traffic grooming on the path. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:2-3, pp:139-151 [Journal]
    
13. 
    Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints. [Citation Graph (, )][DBLP]
    
    
14. 
    MPLS Label Stacking on the Line Network. [Citation Graph (, )][DBLP]
    
    
15. 
    Computing and Updating the Process Number in Trees. [Citation Graph (, )][DBLP]
    
    
16. 
    Designing Hypergraph Layouts to GMPLS Routing Strategies. [Citation Graph (, )][DBLP]
    
    
17. 
    A Distributed Algorithm for Computing and Updating the Process Number of a Forest. [Citation Graph (, )][DBLP]
    
    
18. 
    Minimizing energy consumption by power-efficient radio configuration in fixed broadband wireless networks. [Citation Graph (, )][DBLP]
    
    
19. 
    Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem. [Citation Graph (, )][DBLP]
    
    
20. 
    Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. [Citation Graph (, )][DBLP]
    
    
21. 
    Power-efficient radio configuration in fixed broadband wireless networks. [Citation Graph (, )][DBLP]
    
    
22. 
    A distributed algorithm for computing and updating the process number of a forest [Citation Graph (, )][DBLP]