Networks, Volume 36

Volume 36, Number 1, August 2000

• Geir Dahl, Bjørnar Realfsen:
  The cardinality-constrained shortest path problem in 2-graphs. 1-8
  Electronic Edition (link) BibTeX
• S. Trilochan Sastry:
  A characterization of the two-commodity network design problem. 9-16
  Electronic Edition (link) BibTeX
• Walid Ben-Ameur:
  Constrained length connectivity and survivable networks. 17-33
  Electronic Edition (link) BibTeX
• Egon Balas, Maarten Oosten:
  On the cycle polytope of a directed graph. 34-46
  Electronic Edition (link) BibTeX
• Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann:
  Minimizing the complexity of an activity network. 47-52
  Electronic Edition (link) BibTeX
• P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin:
  New polynomial-time cycle-canceling algorithms for minimum-cost flows. 53-63
  Electronic Edition (link) BibTeX
• D. DiMarco:
  Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree. 64-67
  Electronic Edition (link) BibTeX

Volume 36, Number 2, September 2000

• Norbert Ascheuer, Matteo Fischetti, Martin Grötschel:
  A polyhedral study of the asymmetric traveling salesman problem with time windows. 69-79
  Electronic Edition (link) BibTeX
• Mark E. T. Horn:
  Efficient modeling of travel in networks with time-varying link speeds. 80-90
  Electronic Edition (link) BibTeX
• Guy Even, Shimon Even:
  Embedding interconnection networks in grids via the layered cross product. 91-95
  Electronic Edition (link) BibTeX
• Petrisor Panaite, Andrzej Pelc:
  Impact of topographic information on graph exploration efficiency. 96-103
  Electronic Edition (link) BibTeX
• Konrad J. Swanepoel:
  The local Steiner problem in normed planes. 104-113
  Electronic Edition (link) BibTeX
• Colin McDiarmid, Bruce A. Reed:
  Channel assignment and weighted coloring. 114-117
  Electronic Edition (link) BibTeX
• Guillaume Fertin, Roger Labahn:
  Compounding of gossip graphs. 126-137
  Electronic Edition (link) BibTeX
• Celso C. Ribeiro, Maurício C. Souza:
  Tabu search for the Steiner problem in graphs. 138-146
  Electronic Edition (link) BibTeX

Volume 36, Number 3, October 2000

• Esther M. Arkin, Refael Hassin:
  Minimum-diameter covering problems. 147-155
  Electronic Edition (link) BibTeX
• Martin Erwig:
  The graph Voronoi diagram with applications. 156-163
  Electronic Edition (link) BibTeX
• José Gómez, Eduardo A. Canale, Xavier Muñoz:
  On the unilateral (Delta, D*)-problem. 164-171
  Electronic Edition (link) BibTeX
• Zeev Nutov:
  Approximating multiroot 3-outconnected subgraphs. 172-179
  Electronic Edition (link) BibTeX
• Lali Barrière, Josep Fàbrega, Ester Simó, Marisa Zaragozá:
  Fault-tolerant routings in chordal ring networks. 180-190
  Electronic Edition (link) BibTeX
• Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
  Low-congested interval routing schemes for hypercubelike networks. 191-201
  Electronic Edition (link) BibTeX

Volume 36, Number 4, December 2000

• Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann:
  The full-degree spanning tree problem. 203-209
  Electronic Edition (link) BibTeX
• Steven Chamberland, Brunilde Sansò:
  Topological expansion of multiple-ring metropolitan area networks. 210-224
  Electronic Edition (link) BibTeX
• Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho:
  Hamiltonian-laceability of star graphs. 225-232
  Electronic Edition (link) BibTeX
• Peiwu Zhao, Rajan Batta:
  An aggregation approach to solving the network p-median problem with link demands. 233-241
  Electronic Edition (link) BibTeX