Algorithmica, Volume 19, 1997

Volume 19, Number 1/2, September/October 1997

• David Baraff, Raju S. Mattikalli, Pradeep K. Khosla:
  Minimal Fixturing of Frictionless Assemblies: Complexity and Algorithms. 4-39
  
• Aaron S. Wallack, John F. Canny:
  Planning for Modular and Hybrid Fixture. 40-60
  
• Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu:
  Feasibility of Design in Stereolithography. 61-83
  
• Prosenjit Bose, David Bremner, Marc J. van Kreveld:
  Determining the Castability of Simple Polyhedra. 84-113
  
• Michael S. Karasick, Derek Lieber, Lee R. Nackman, V. T. Rajan:
  Visualization of Three-Dimensional Delaunay Meshes. 114-128
  
• Daniela Rus:
  Coordinated Manipulation of Objects in a Plane. 129-147
  
• Karen L. Daniels, Victor Milenkovic:
  Multiple Translational Containment. Part I: An Approximate Algorithm. 148-182
  
• Victor Milenkovic:
  Multiple Translational Containment. Part II: Exact Algorithms. 183-218
  
• Ioannis Z. Emiris, John F. Canny, Raimund Seidel:
  Efficient Perturbations for Handling Geometric Degeneracies. 219-242
  
• Chandrajit L. Bajaj, Fausto Bernardini, Guoliang Xu:
  Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data. 243-261
  

Volume 19, Number 3, November 1997

• Martin L. Brady, Donna J. Brown, K. D. Powers:
  Hexagonal Models for Channel Routing. 263-290
  
• Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen:
  Parallel Searching in Generalized Monge Arrays. 291-317
  
• J. F. Weng:
  Expansion of Linear Steiner Trees. 318-330
  
• Robert Giegerich, Stefan Kurtz:
  From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction. 331-353
  
• Zhi-Zhong Chen, Xin He:
  Parallel Algorithms for Maximal Acyclic Sets. 354-368
  

Volume 19, Number 4, December 1997

• Gary L. Miller, Shang-Hua Teng:
  Tree-Based Parallel Algorithm Design. 369-389
  
• Boris V. Cherkassky, Andrew V. Goldberg:
  On Implementing the Push-Relabel Method for the Maximum Flow Problem. 390-410
  
• Shun-Shii Lin, Kwei-Jay Lin:
  A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound. 411-426
  
• Therese C. Biedl, Goos Kant, Michael Kaufmann:
  On Triangulating Planar Graphs Under the Four-Connectivity Constraint. 427-446
  
• Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid:
  On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. 447-460
  

Last update Mon May 20 16:21:45 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page