Networks, Volume 28

Volume 28, Number 1, August 1996

• Oded Berman, Zvi Drezner, George O. Wesolowsky:
  Minimum covering criterion for obnoxious facility location on a network. 1-5
  Electronic Edition (link) BibTeX
• Qiao Li, Dominique Sotteau, Junming Xu:
  2-diameter of de Bruijn graphs. 7-14
  Electronic Edition (link) BibTeX
• Si-Qing Zheng:
  Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs. 15-19
  Electronic Edition (link) BibTeX
• Geng Lin, Nicholas Pippenger:
  Routing algorithms for switching networks with probabilistic traffic. 21-29
  Electronic Edition (link) BibTeX
• Enrique Castillo, José Manuel Gutiérrez, Ali S. Hadi:
  A new method for efficient symbolic propagation in discrete Bayesian networks. 31-43
  Electronic Edition (link) BibTeX
• J. Ghoshal, Renu Laskar, D. Pillone:
  Minimal rankings. 45-53
  Electronic Edition (link) BibTeX
• J. MacGregor Smith:
  Topological network design of state-dependent queueing networks. 55-68
  Electronic Edition (link) BibTeX

Volume 28, Number 2, September 1996

• Ram Swaminathan:
  Divide-and-conquer algorithms for graph-layout problems. 69-85
  Electronic Edition (link) BibTeX
• Keith E. Humenik, Peter Matthews, A. B. Stephens, Yelena Yesha:
  Minimizing message complexity of partially replicated data on hypercubes. 87-95
  Electronic Edition (link) BibTeX
• Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
  On the connectivity and the conditional diameter of graphs and digraphs. 97-105
  Electronic Edition (link) BibTeX
• Anna Nagurney, June Dong:
  Network decomposition of general financial equilibria with transaction costs. 107-116
  Electronic Edition (link) BibTeX
• Pierre Chardaire, Alain Sutter, Marie-Christine Costa:
  Solving the dynamic facility location problem. 117-124
  Electronic Edition (link) BibTeX

Volume 28, Number 3, October 1996

• Kenneth A. Berman:
  Vulnerability of scheduled networks and a generalization of Menger's Theorem. 125-134
  Electronic Edition (link) BibTeX
• James A. Knisely, Renu Laskar:
  Cyclic gossiping times for some classes of graphs. 135-141
  Electronic Edition (link) BibTeX
• Andrzej Pelc:
  Fault-tolerant broadcasting and gossiping in communication networks. 143-156
  Electronic Edition (link) BibTeX
• Mokhtar Aboelaze:
  MLH: A hierarchical hypercube network. 157-165
  Electronic Edition (link) BibTeX
• Tae Ung Kim, Timothy J. Lowe, Arie Tamir, James E. Ward:
  On the location of a tree-shaped facility. 167-175
  Electronic Edition (link) BibTeX

Volume 28, Number 4, December 1996

• Yannis Manoussakis, Zsolt Tuza:
  Optimal routings in communication networks with linearly bounded forwarding index. 177-180
  Electronic Edition (link) BibTeX
• Gary Chartrand, Michelle Schultz, Steven J. Winters:
  On eccentric vertices in graphs. 181-186
  Electronic Edition (link) BibTeX
• Lusheng Wang, Tao Jiang:
  An approximation scheme for some Steiner tree problems in the plane. 187-193
  Electronic Edition (link) BibTeX
• Yao-Min Chen, Galen H. Sasaki:
  Routing in quasi torus networks. 195-209
  Electronic Edition (link) BibTeX
• B. Kalantari, Gholamreza B. Khosrovshahi:
  Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP. 211-219
  Electronic Edition (link) BibTeX
• Dorit S. Hochbaum, Anu Pathria:
  The bottleneck graph partition problem. 221-225
  Electronic Edition (link) BibTeX