Networks, Volume 32

Volume 32, Number 1, August 1998

• Jean-Claude König, David W. Krumme, Emmanuel Lazard:
  Diameter-preserving orientations of the torus. 1-11
  Electronic Edition (link) BibTeX
• Ewa Malesinska, Steffen Piskorz, Gerhard Weißenfels:
  On the chromatic number of disk graphs. 13-22
  Electronic Edition (link) BibTeX
• Ming-Yang Su, Gen-Huey Chen, Dyi-Rong Duh:
  Topological properties of incomplete WK-recursive networks. 23-45
  Electronic Edition (link) BibTeX
• Ralf Klasing, Reinhard Lüling, Burkhard Monien:
  Compressing cube-connected cycles and butterfly networks. 47-65
  Electronic Edition (link) BibTeX
• Raanan Manor, Michal Penn:
  An extended planar algorithm for maximum integral two-flow. 67-76
  Electronic Edition (link) BibTeX

Volume 32, Number 2, September 1998

• Yiu Kwok Tham:
  Routing in asymmetrical multiconnection three-stage Clos networks. 77-83
  Electronic Edition (link) BibTeX
• Alf Kimms, Andreas Drexl:
  Proportional lot sizing and scheduling: Some extensions. 85-101
  Electronic Edition (link) BibTeX
• Lata Narayanan, Sunil M. Shende:
  Partial characterizations of networks supporting shortest path interval labeling schemes. 103-113
  Electronic Edition (link) BibTeX
• Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone:
  Max-min partitioning of grid graphs into connected components. 115-125
  Electronic Edition (link) BibTeX
• Hans-Jürgen Bandelt, Victor Chepoi:
  Embedding into the rectilinear grid. 127-132
  Electronic Edition (link) BibTeX
• D. Frank Hsu, Xiao-Dong Hu:
  On shortest two-connected Steiner networks with Euclidean distance. 133-140
  Electronic Edition (link) BibTeX
• Byung-Wook Wie, Roger L. Tobin:
  On the relationship between dynamic Nash and instantaneous user equilibria. 141-163
  Electronic Edition (link) BibTeX

Volume 32, Number 3, October 1998

• Paola Flocchini, Bernard Mans, Nicola Santoro:
  Sense of direction: Definitions, properties, and classes. 165-180
  Electronic Edition (link) BibTeX
• Toshinori Yamada, Shuichi Ueno:
  Fault-tolerant graphs for tori. 181-188
  Electronic Edition (link) BibTeX
• Andrew B. Kahng, Gabriel Robins, Elizabeth A. Walkup:
  How to test a tree. 189-197
  Electronic Edition (link) BibTeX
• Teresa W. Haynes, Peter J. Slater:
  Paired-domination in graphs. 199-206
  Electronic Edition (link) BibTeX
• Thorsten Koch, Alexander Martin:
  Solving Steiner tree problems in graphs to optimality. 207-232
  Electronic Edition (link) BibTeX

Volume 32, Number 4, December 1998

• Nicholas G. Hall, Wei-Ping Liu, Jeffrey B. Sidney:
  Scheduling in broadcast networks. 233-253
  Electronic Edition (link) BibTeX
• Arie Tamir, Dionisio Pérez-Brito, José A. Moreno-Pérez:
  A polynomial algorithm for the p-centdian problem on a tree. 255-262
  Electronic Edition (link) BibTeX
• Michel Gendreau, Gilbert Laporte, Frédéric Semet:
  A branch-and-cut algorithm for the undirected selective traveling salesman problem. 263-273
  Electronic Edition (link) BibTeX
• Michael R. Fellows, Pavol Hell, Karen Seyffarth:
  Constructions of large planar networks with given degree and diameter. 275-281
  Electronic Edition (link) BibTeX
• Sönke Hartmann, Andreas Drexl:
  Project scheduling with multiple modes: A comparison of exact algorithms. 283-297
  Electronic Edition (link) BibTeX
• Khee Meng Koh, Eng Guan Tay:
  On optimal orientations of Cartesian products of even cycles. 299-306
  Electronic Edition (link) BibTeX
• Jung-Sing Jwo, Tai-Ching Tuan:
  On container length and connectivity in unidirectional hypercubes. 307-317
  Electronic Edition (link) BibTeX