Networks, Volume 37

Volume 37, Number 1, January 2001

• Ivan T. Frisch:
  The early days of Networks. 1-7
  
• Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky:
  An improved approximation scheme for the Group Steiner Problem. 8-20
  
• Andreas Schirmer, Andreas Drexl:
  Allocation of partially renewable resources: Concept, capabilities, and applications. 21-34
  
• Elise Miller-Hooks:
  Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. 35-52
  
• Yang Xiang:
  Cooperative triangulation in MSBNs without revealing subnet structures. 53-65
  

Volume 37, Number 2, March 2001

• Fred S. Roberts, Li Sheng:
  How hard is it to determine if a graph has a 2-role assignment? 67-73
  
• Lou Caccetta, S. P. Hill:
  A branch and cut method for the degree-constrained minimum spanning tree problem. 74-83
  
• Ray-Shang Lo, Gen-Huey Chen:
  Embedding longest fault-free paths in arrangement graphs with faulty vertices. 84-93
  
• Hovhannes A. Harutyunyan, Arthur L. Liestman:
  Improved upper and lower bounds for k-broadcasting. 94-101
  
• Shenggui Zhang, Ziguo Wang:
  Scattering number in graphs. 102-106
  
• Charles J. Colbourn, Peng-Jun Wan:
  Minimizing drop cost for SONET/WDM networks with wavelength requirements. 107-116
  

Volume 37, Number 3, May 2001

• Falk Nicolai, Thomas Szymczak:
  Homogeneous sets and domination: A linear time algorithm for distance - hereditary graphs. 117-128
  
• Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski:
  On the number of spanning trees in directed circulant graphs. 129-133
  
• Gianpaolo Ghiani, Gennaro Improta, Gilbert Laporte:
  The capacitated arc routing problem with intermediate facilities. 134-143
  
• Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
  Multigraph augmentation under biconnectivity and general edge-connectivity requirements. 144-155
  
• Shien-Ching Hwang, Gen-Huey Chen:
  Minimum spanners of butterfly graphs. 156-164
  
• Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
  On the construction of combined k-fault-tolerant Hamiltonian graphs. 165-170
  

Volume 37, Number 4, July 2001

• Dorit S. Hochbaum:
  A new - old algorithm for minimum-cut and maximum-flow in closure graphs. 171-193
  
• Christian Fremuth-Paeger, Dieter Jungnickel:
  Balanced network flows. IV. Duality and structure theory. 194-201
  
• Christian Fremuth-Paeger, Dieter Jungnickel:
  Balanced network flows. V. Cycle-canceling algorithms. 202-209
  
• Christian Fremuth-Paeger, Dieter Jungnickel:
  Balanced network flows. VI. Polyhedral descriptions. 210-218
  
• Ashish Goel:
  Stability of networks and protocols in the adversarial queueing model for packet routing. 219-224
  
• Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
  Characterization results of all shortest paths interval routing schemes. 225-232