Networks, Volume 29

Volume 29, Number 1, January 1997

• Amotz Bar-Noy, Shlomo Kipnis:
  Multiple message broadcasting in the postal model. 1-10
  Electronic Edition (link) BibTeX
• Ariel Orda, Raphael Rom:
  Optimal packet fragmentation and routing in computer networks. 11-28
  Electronic Edition (link) BibTeX
• Ramesh S. Sankaranarayana:
  Tracking the P-NP boundary for well-covered graphs. 29-37
  Electronic Edition (link) BibTeX
• Toru Hasunuma, Yukio Shibata:
  Counting small cycles in generalized de Bruijn digraphs. 39-47
  Electronic Edition (link) BibTeX
• Savio S. H. Tse, Francis C. M. Lau:
  A lower bound for interval routing in general networks. 49-53
  Electronic Edition (link) BibTeX
• Matteo Fischetti, Daniele Vigo:
  A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. 55-67
  Electronic Edition (link) BibTeX
• Konstantinos Kalpakis, Yaacov Yesha:
  On the bisection width of the transposition network. 69-76
  Electronic Edition (link) BibTeX

Volume 29, Number 2, March 1997

• Stephen G. Penrice:
  Balanced graphs and network flows. 77-80
  Electronic Edition (link) BibTeX
• Chin-Chen Chang, Wen-Bin Wu:
  A secure voting system on a public network. 81-87
  Electronic Edition (link) BibTeX
• Cees Duin, Stefan Voß:
  Efficient path and vertex exchange in steiner tree algorithms. 89-105
  Electronic Edition (link) BibTeX
• Akiyoshi Shioura, Maiko Shigeno:
  The tree center problems and the relationship with the bottleneck knapsack problems. 107-110
  Electronic Edition (link) BibTeX
• Zhi-Long Chen, Warren B. Powell:
  A note on Bertsekas' small-label-first strategy. 111-116
  Electronic Edition (link) BibTeX
• Hosam M. F. AboElFotoh:
  Algorithms for computing message delay for wireless networks. 117-124
  Electronic Edition (link) BibTeX
• Stefano Pallottino, Maria Grazia Scutellà:
  Dual algorithms for the shortest path tree problem. 125-133
  Electronic Edition (link) BibTeX

Volume 29, Number 3, May 1997

• Yixun Lin:
  Minimum bandwidth problem for embedding graphs in cycles. 135-140
  Electronic Edition (link) BibTeX
• X. Cai, Ton Kloks, C. K. Wong:
  Time-varying shortest path problems with constraints. 141-150
  Electronic Edition (link) BibTeX
• Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner:
  Minimum-weight cycles in 3-separable graphs. 151-160
  Electronic Edition (link) BibTeX
• Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman:
  A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem. 161-171
  Electronic Edition (link) BibTeX
• Mauricio G. C. Resende, Celso C. Ribeiro:
  A GRASP for graph planarization. 173-189
  Electronic Edition (link) BibTeX

Volume 29, Number 4, July 1997

• Dilip Chhajed:
  Edge coloring a k-tree into two smaller trees. 191-194
  Electronic Edition (link) BibTeX
• De-Ron Liang, Rong-Hong Jan, Satish K. Tripathi:
  Reliability analysis of replicated and-or graphs. 195-203
  Electronic Edition (link) BibTeX
• Esther M. Arkin, Refael Hassin, Limor Klein:
  Restricted delivery problems on a network. 205-216
  Electronic Edition (link) BibTeX
• Daniel Gagliardi, Marty Lewinter:
  An infinite class of reach-preservable graphs. 217-218
  Electronic Edition (link) BibTeX
• Shimon Even, Ami Litman:
  Layered cross product - A technique to construct interconnection networks. 219-223
  Electronic Edition (link) BibTeX
• Shin-Yeu Lin, Ch'i-Hsin Lin:
  A computationally efficient method for nonlinear multicommodity network flow problems. 225-244
  Electronic Edition (link) BibTeX
• Takao Asano:
  Constructing a bipartite graph of maximum connectivity with prescribed degrees. 245-263
  Electronic Edition (link) BibTeX