| 119 | -- | 120 | Frank K. Hwang. Foreword |
| 121 | -- | 135 | Ding-Zhu Du, Frank K. Hwang. A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio |
| 137 | -- | 177 | Warren D. Smith. How To Find Steiner Minimal Trees in Euclidean d-Space |
| 179 | -- | 191 | Zi-Cheng Liu, Ding-Zhu Du. On Steiner Minimal Trees with L_p Distance |
| 193 | -- | 218 | J. H. Rubinstein, D. A. Thomas. Graham s Problem on Shortest Networks for Points on a Circle |
| 219 | -- | 229 | Ernest J. Cockayne, Denton E. Hewgill. Improved Computation of Plane Steiner Minimal Trees |
| 231 | -- | 246 | R. S. Booth, J. F. Weng. Steiner Minimal Trees for a Class of Zigzag Lines |
| 247 | -- | 276 | Dana S. Richards, Jeffrey S. Salowe. A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets |
| 277 | -- | 288 | Sailesh K. Rao, P. Sadayappan, Frank K. Hwang, Peter W. Shor. The Rectilinear Steiner Arborescence Problem |
| 289 | -- | 302 | J. Scott Provan. Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems |
| 303 | -- | 307 | Charles J. Colbourn. A Note on Bounding k-Terminal Reliability |
| 309 | -- | 327 | Pawel Winter, J. MacGregor Smith. Path-Distance Heuristics for the Steiner Problem in Undirected Networks |
| 329 | -- | 332 | Warren D. Smith, Peter W. Shor. Steiner Tree Problems |
| 333 | -- | 335 | Stefan Voß. Problems with Generalized Steiner Problems |
| 337 | -- | 0 | Otfried Schwarzkopf. Parallel Computation of Distance Transforms - Erratum |