Networks, Volume 43

Volume 43, Number 1, January 2004

• Illya V. Hicks:
  Branch decompositions and minor containment. 1-9
  
• Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani:
  Connectivity-splitting models for survivable network design. 10-27
  
• Jung-Sheng Fu, Gen-Huey Chen:
  Fault-tolerant cycle embedding in hierarchical cubic networks. 28-38
  
• Kaj Holmberg, Di Yuan:
  Optimization of Internet Protocol network design and routing. 39-53
  
• Xavier Marcote, Camino Balbuena:
  Edge-superconnectivity of cages. 54-59
  

Volume 43, Number 2, March 2004

• Arthur M. Farley:
  Minimal path broadcast networks. 61-70
  
• Corinne Feremans, Martine Labbé, Gilbert Laporte:
  The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. 71-86
  
• Raffaele Pesenti, Franca Rinaldi, Walter Ukovich:
  An exact algorithm for the min-cost network containment problem. 87-102
  
• Ivo Blöchliger, Dominique de Werra:
  On some properties of suboptimal colorings of graphs. 103-108
  
• Dov Dvir, Gabriel Y. Handler:
  The absolute center of a network. 109-118
  
• Marek Chrobak, Leszek Gasieniec, Wojciech Rytter:
  A randomized algorithm for gossiping in radio networks. 119-124
  

Volume 43, Number 3, May 2004

• Wided Ouaja, Barry Richards:
  A hybrid multicommodity routing algorithm for traffic engineering. 125-140
  
• John Nolan:
  Bisectored unit disk graphs. 141-152
  
• Bettina Klinz, Gerhard J. Woeginger:
  Minimum-cost dynamic flows: The series-parallel case. 153-162
  
• S. Raghavan:
  Low-connectivity network design on series-parallel graphs. 163-176
  
• Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González:
  The Ring Star Problem: Polyhedral analysis and exact algorithm. 177-189
  
• Geir Dahl, Bjarne Johannessen:
  The 2-path network problem. 190-199
  

Volume 43, Number 4, July 2004

• From the editors.
  
• M. G. Karagiannopoulos, Michael N. Vrahatis, Gerasimos C. Meletiou:
  A note on a secure voting system on a public network. 224-225
  
• Natashia Boland, Horst W. Hamacher, Frank Lenzen:
  Minimizing beam-on time in cancer radiation treatment using multileaf collimators. 226-240
  
• Maria Paola Scaparra, Stefano Pallottino, Maria Grazia Scutellà:
  Large-scale local search heuristics for the capacitated vertex p-center problem. 241-255
  
• Vardges Melkonian, Éva Tardos:
  Algorithms for a network design problem with crossing supermodular demands. 256-265
  
• Sheshayya A. Choudum, R. Usha Nandini:
  Complete binary trees in folded and enhanced cubes. 266-272
  
• Tetsuya Fujie:
  The maximum-leaf spanning tree problem: Formulations and facets. 212-223
  
• Deepak Rajan, Alper Atamtürk:
  A directed cycle-based column-and-cut generation method for capacitated survivable network design. 201-211