Volume 7, Number 1, 1992

• 
  Alok Aggarwal: Editor's Foreword. 1-2
• 
  Richard Cole, Michael T. Goodrich: Optimal Parallel Algorithms for Point-Set and Polygon Problems. 3-23
• 
  Sharat Chandran, Sung Kwon Kim, David M. Mount: Parallel Computational Geometry of Rectangles. 25-49
• 
  Ed Cohen, Russ Miller, Elias M. Sarraf, Quentin F. Stout: Efficient Convexity and Domination Algorithms for Fine-and Medium-Grain Hypercube Computers. 51-75
• 
  Jorge L. C. Sanz, Robert Cypher: Data Reduction and Fast Routing: A Strategy for Efficient Algorithms for Message-Passing Parallel Computers. 77-89
• 
  John H. Reif, Sandeep Sen: Optimal Randomized Parallel Algorithms for Computational Geometry. 91-117

Volume 7, Numbers 2&3, 1992

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

Volume 7, Number 4, 1992

• 
  John E. Hopcroft, Peter J. Kahn: A Paradigm for Robust Geometric Algorithms. 339-380
• 
  Leonidas J. Guibas, Donald E. Knuth, Micha Sharir: Randomized Incremental Construction of Delaunay and Voronoi Diagrams. 381-413
• 
  Andrew M. Liao: Three Priority Queue Applications Revisited. 415-427

Volume 7, Numbers 5&6, 1992

• 
  Greg N. Frederickson: Editor's Foreword Special Issue on Graph Algorithms. 429-431
• 
  Jeffery Westbrook, Robert Endre Tarjan: Maintaining Bridge-Connected and Biconnected Components On-Line. 433-464
• 
  Harold N. Gabow, Herbert H. Westermann: Forests, Frames, and Games: Algorithms for Matroid Sums and Applications. 465-497
• 
  Dan Gusfield, Charles U. Martel: A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications. 499-519
• 
  Bhubaneswar Mishra, Robert Endre Tarjan: A Linear-Time Algorithm for Finding an Ambitus. 521-554
• 
  Richard B. Borie, R. Gary Parker, Craig A. Tovey: Automatic Generation of Linear-Time Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph Families. 555-581
• 
  Hiroshi Nagamochi, Toshihide Ibaraki: A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. 583-596
• 
  John H. Reif, Paul G. Spirakis: Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems. 597-630
• 
  Joan M. Lucas, Marian Gunsher Sackrowitz: Efficient Parallel Algorithms for Path Problems in Directed Graphs. 631-648

last updated on Tue May 21 02:37:58 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page