Algorithmica, Volume 9, 1993

Volume 9, Number 1, 1993

• R. Z. Hwang, Richard C. T. Lee, R. C. Chang: The Slab Dividing Approach To Solve the Euclidean P-Center Problem. 1-22 BibTeX
• Philip N. Klein, Clifford Stein: A Parallel Algorithm for Approximating the Minimum Cycle Cover. 23-31 BibTeX
• Manfred Kunde: Packet Routing on Grids of Processors. 32-46 BibTeX
• Michael Kaufmann, F. Miller Maley: Parity Conditions in Homotopic Knock-Knee Routing. 47-63 BibTeX
• Michael J. Todd, Yufei Wang: On Combined Phase 1-Phase 2 Projective Methods for Linear Programming. 64-83 BibTeX
• Majid Sarrafzadeh, Ruey-Der Lou: Maximum k-Covering of Weighted Transitive Graphs with Applications. 84-100 BibTeX

Volume 9, Number 2, 1993

• T. Berger, A. Hekstra, Alon Orlitsky: Asymptotic Component Densities in Programmable Gate Arrays Realizing All Circuits of a Given Size. 101-127 BibTeX
• Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap: Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. 128-141 BibTeX
• Barry Joe, Cao An Wang: Duality of Constrained Voronoi Diagrams and Delaunay Triangulations. 142-155 BibTeX
• Mikhail J. Atallah: A Faster Parallel Algorithm for a Matrix Searching Problem. 156-167 BibTeX
• Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine: Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. 168-183 BibTeX
• Robert A. Bosch, Kurt M. Anstreicher: On Partial Updating in a Potential Reduction Linear Programming Algorithm of Kojima, Mizuno, and Yoshise. 184-197 BibTeX

Volume 9, Number 3, 1993

• P. B. Ramprasad, C. Pandu Rangan: A Linear Algorithm for the All-Bidirectional-Edges Problem on Planar Graphs. 199-216 BibTeX
• Lin Chen: Efficient Parallel Recognition of Some Circular Arc Graphs, I. 217-238 BibTeX
• Richard J. Lipton, Jeffrey F. Naughton: Clocked Adversaries for Hashing. 239-252 BibTeX
• Edward G. Coffman Jr., Peter W. Shor: Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms. 253-277 BibTeX
• Walter Meyer: Seven Fingers Allow Force-Torque Closure Grasps on Any Convex Polyhedron. 278-292 BibTeX
• Richard Anderson, Simon Kahan, Martine D. F. Schlag: Single-Layer Cylindrical Compaction. 293-312 BibTeX

Volume 9, Number 4, 1993

• Eric Bach, Jonathan Sorenson: Sieve Algorithms for Perfect Power Testing. 313-328 BibTeX
• Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud: A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis. 329-356 BibTeX
• Shaunak Pawagi, Owen Kaser: Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees. 357-381 BibTeX
• Richard Kenyon: Tiling a Polygon with Parallelograms. 382-397 BibTeX
• R. Z. Hwang, R. C. Chang, Richard C. T. Lee: The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time. 398-423 BibTeX

Volume 9, Number 5, 1993

• Mee Yee Chan, Francis Y. L. Chin: Schedulers for Larger Classes of Pinwheel Instances. 425-462 BibTeX
• Alexander Zelikovsky: An 11/6-Approximation Algorithm for the Network Steiner Problem. 463-470 BibTeX
• Marco Pellegrini: Ray Shooting on Triangles in 3-Space. 471-494 BibTeX
• Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri: Selecting Distances in the Plane. 495-514 BibTeX
• Michael T. Goodrich, Steven B. Shauck, Sumanta Guha: An Addendum to Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. 515-516 BibTeX

Volume 9, Number 6, 1993

• David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri: Computing the Intersection-Depth of Polyhedra. 518-533 BibTeX
• Leonidas J. Guibas, David Salesin, Jorge Stolfi: Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives. 534-560 BibTeX
• János Pach, Richard Pollack, Emo Welzl: Weaving Patterns of Lines and Line Segments in Space. 561-571 BibTeX
• Tetsuo Asano, Takeshi Tokuyama: Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing. 572-590 BibTeX
• Feng Gao, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James B. Saxe: Finding Extrema with Unary Predicates. 591-600 BibTeX
• Kuo-Hui Tsai, Wen-Lian Hsu: Fast Algorithms for the Dominating Set Problem on Permutation Graphs. 601-614 BibTeX
• Tak Wah Lam, Kwong-fai Chan: Finding Least-Weight Subsequences with Fewer Processors. 615-628 BibTeX
• Svante Carlsson, Christos Levcopoulos, Ola Petersson: Sublinear Merging and Natural Mergesort. 629-648 BibTeX
• Kazumiti Numata, Takeshi Tokuyama: Splitting a Configuration in a Simplex. 649-668 BibTeX