Volume 8, Number 1, 1992

• 
  Jacob T. Schwartz, Micha Sharir: Finding Effective "Force Targets" for Two-Dimensional Multifinger Frictional Grips. 1-20
• 
  Sanguthevar Rajasekaran, Thanasis Tsantilas: Optimal Routing Algorithms for Mesh-Connected Processor Arrays. 21-38
• 
  Robert E. Webber, Hanan Samet: Linear-Time Border-Tracing Algorithms for Quadtrees. 39-54
• 
  Joseph S. B. Mitchell: L_1 Shortest Paths Among Polygonal Obstacles in the Plane. 55-88

Volume 8, Number 2, 1992

• 
  Sun Wu, Udi Manber: Path-Matching Problems. 89-101
• 
  Dan Gusfield, Leonard Pitt: A Bounded Approximation for the Minimum Cost 2-Sat Problem. 103-117
• 
  Christine Rüb: Line-Segment Intersection Reporting in Parallel. 119-144
• 
  Donald Goldfarb, Jianxiu Hao: Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem. 145-160
• 
  Ilan Adler, Renato D. C. Monteiro: A Geometric View of Parametric Linear Programming. 161-176

Volume 8, Number 3, 1992

• 
  Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee: Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs. 177-194
• 
  Amy J. Briggs: An Efficient Algorithm for One-Step Planar Compliant Motion Planning with Uncertainty. 195-208
• 
  Mikhail J. Atallah, Jyh-Jong Tsay: On the Parallel-Decomposability of Geometric Problems. 209-231
• 
  Chung-Kuan Cheng, T. C. Hu: Maximum Concurrent Flows and Minimum Cuts. 233-249
• 
  Christos Levcopoulos, Andrzej Lingas: There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees. 251-256

Volume 8, Number 4, 1992

• 
  Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec: Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. 257-283
• 
  Alberto Apostolico: Optimal Parallel Detection of Squares in Strings. 285-319
• 
  Jean-Daniel Boissonnat, Mariette Yvinec: Probing a Scene of Nonconvex Polyhedra. 321-342

Volume 8, Numbers 5&6, 1992

• 
  Mikhail J. Atallah: Editor's Foreword: Special Issue on the Sixth Annual Symposium on Computational Geometry. 343-344
• 
  Zhenyu Li, Victor Milenkovic: Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic. 345-364
• 
  Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap: Simultaneous Inner and Outer Approximation of Shapes. 365-389
• 
  Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. 391-406
• 
  Bernard Chazelle, Micha Sharir, Emo Welzl: Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. 407-429
• 
  Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger: Minimum-Link Paths Among Obstacles in the Plan. 431-459
• 
  Michael T. Goodrich, Steven B. Shauck, Sumanta Guha: Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. 461-486

last updated on Sun May 26 04:29:07 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page