Journals in DBLP

Networks
2003, volume: 41, number: 2

1. Ján Plesník
   Towards minimum k-geodetically connected graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:41, n:2, pp:73-82 [Journal]
   
2. Jean-Claude Bermond, Stéphan Ceroi
   Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:41, n:2, pp:83-86 [Journal]
   
3. G. Brightwell, G. Oriolo, F. Bruce Shepherd
   Reserving resilient capacity for a single commodity with upper-bound constraints. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:41, n:2, pp:87-96 [Journal]
   
4. Igor Averbakh, Oded Berman
   An improved algorithm for the minmax regret median problem on a tree. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:41, n:2, pp:97-103 [Journal]
   
5. Mauricio G. C. Resende, Celso C. Ribeiro
   A GRASP with path-relinking for private virtual circuit routing. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:41, n:2, pp:104-114 [Journal]
   
6. J. Scott Provan
   A polynomial-time algorithm to find shortest paths with recourse. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:41, n:2, pp:115-125 [Journal]