Journals in DBLP

Networks
2002, volume: 39, number: 3

1. Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wilson
   Degree- and time-constrained broadcast networks. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:3, pp:121-129 [Journal]
   
2. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
   Light graphs with small routing cost. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:3, pp:130-138 [Journal]
   
3. Richard L. Francis, Timothy J. Lowe, Arie Tamir
   Worst-case incremental analysis for a class of p-facility location problems. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:3, pp:139-143 [Journal]
   
4. Sergei Bespamyatnikh, Binay K. Bhattacharya, Mark Keil, J. David Kirkpatrick, Michael Segal
   Efficient algorithms for centers and medians in interval and circular-arc graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:3, pp:144-152 [Journal]
   
5. Camino Balbuena, Josep Fàbrega, Xavier Marcote, Ignacio M. Pelayo
   Superconnected digraphs and graphs with small conditional diameters. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:3, pp:153-160 [Journal]
   
6. Matteo Fischetti, Giuseppe Lancia, Paolo Serafini
   Exact algorithms for minimum routing cost trees. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:3, pp:161-173 [Journal]