Volume 2,
1987
- Naoki Katoh, Tiko Kameda, Toshihide Ibaraki:
A Cautious Scheduler for Multistep Transactions.
1-26
- Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap:
Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram.
27-59
- Mark Shand:
Algorithms for Corner Stitched Data-Structures.
61-80
- Eitan Zemel:
A Linear Time Randomizing Algorithm for Searching Ranked Functions.
81-90
- Daniel S. Hirschberg, Lawrence L. Larmore:
The Set LCS Problem.
91-95
- Scot W. Hornick, Majid Sarrafzadeh:
On Problem Transformability in VLSI.
97-111
- Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani:
Global Wire Routing in Two-Dimensional Arrays.
113-129
- Claire Mathieu:
Some Problems in Computational Geometry.
131-134
- Bernard Chazelle:
Editor's Foreword.
135-136
- Rex A. Dwyer:
A Faster Divide-and-Conquer Algorithm for Constructing Delaunay Triangulations.
137-151
- Steven Fortune:
A Sweepline Algorithm for Voronoi Diagrams.
153-174
- Christos Levcopoulos, Andrzej Lingas:
On Approximation Behavior of the Greedy Triangulation for Convex Polygons.
15-193
- Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber:
Geometric Applications of a Matrix-Searching Algorithm.
195-208
- Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan:
Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons.
209-233
- Francis Y. L. Chin, H. F. Ting:
An Improved Algorithm for Finding the Median Distributively.
235-249
- Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto:
A Minimum-Area Circuit for l-Selection.
251-265
- Jean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit:
Minimizing Channel Density in Standard Cell Layout.
267-282
- Anna R. Karlin, Howard Trickey, Jeffrey D. Ullman:
Algorithms for the Compilation of Regular Expressions into PLAs.
283-314
- Alberto Apostolico, Concettina Guerra:
The Longest Common Subsequence Problem Revisited.
316-336
- Bernard Chazelle:
Computing on a Free Tree via Complexity-Preserving Mappings.
337-361
- Chee-Keng Yap:
Preface Special Issue on Robotics.
363-365
- Shmuel Sifrony, Micha Sharir:
A New Efficient Motion-Planning Algorithm for a Rod in Two-Dimensional Polygonal Space.
367-402
- Vladimir J. Lumelsky, Alexander A. Stepanov:
Path-Planning Strategies for a Point Mobile Automaton Moving Amidst Unknown Obstacles of Arbitrary Shape.
403-430
- Colm Ó'Dúnlaing:
Motion Planning with Inertial Constraints.
431-475
- Michael Erdmann, Tomás Lozano-Pérez:
On Multiple Moving Objects.
477-521
- Christos H. Papadimitriou, Ellen B. Silverberg:
Optimal Piecewise Linear Motion of an Object Among Obstacles.
523-539
- Bhubaneswar Mishra, Jacob T. Schwartz, Micha Sharir:
On the Existence and Synthesis of Multifinger Positive Grips.
541-558
Copyright © Mon Nov 2 21:24:08 2009
by Michael Ley (ley@uni-trier.de)
