Algorithmica, Volume 5, 1990

Volume 5, Number 1, 1990

Benny Chor, Oded Goldreich: An Improved Parallel Algorithm for Integer GCD. 1-10 BibTeX
Teofilo F. Gonzalez, Si-Qing Zheng: Approximation Algorithms for Partitioning a Rectangle with Interior Points. 11-42 BibTeX
Clyde P. Kruskal, Larry Rudolph, Marc Snir: Efficient Parallel Algorithms for Graph Problems. 43-64 BibTeX
M. Orlowski: A New Algorithm for the Largest Empty Rectangle Problem. 65-73 BibTeX
Mike Paterson: Improved Sorting Networks with O(log N) Depth. 65-92 BibTeX
Daniel Bienstock, Clyde L. Monma: On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures. 93-109 BibTeX
Ding-Zhu Du, Yanjun Zhang: On Heuristics for Minimum Length Rectilinear Partitions. 111-128 BibTeX
Xin He, Yaacov Yesha: Efficient Parallel Algorithms for r-Dominating Set and p-Center Problems on Trees. 129-145 BibTeX

Shang-Ching Chou, William F. Schelter, Jin-Gen Yang: An Algorithm for Constructing Gröbner Bases from Characteristic Sets and Its Application to Geometry. 147-154 BibTeX
C. S. Jeong, D. T. Lee: Parallel Geometric Algorithms on a Mesh-Connected Computer. 155-177 BibTeX
Carla D. Savage, Matthias F. M. Stallmann, Jo Ellen Perry: Solving Some Combinatorial Problems on Arrays with One-Way Dataflow. 179-199 BibTeX
S. Sudarshan, C. Pandu Rangan: A Fast Algorithm for Computing Sparse Visibility Graphs. 210-214 BibTeX
Kurt Mehlhorn, Stefan Näher: Dynamic Fractional Cascading. 215-241 BibTeX
Ian Parberry: An Optimal Time Bound for Oblivious Routing. 243-250 BibTeX
Gabriele Blankenagel, Ralf Hartmut Güting: Internal and External Algorithms for the Points-in-Regions Problem-the INSIDE Join of Geo-Relational Algebra. 251-276 BibTeX
Israel Cidon, Inder S. Gopal: Dynamic Detection of Subgraphs in Computer Networks. 277-294 BibTeX

Joseph C. Culberson, J. Ian Munro: Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees. 295-311 BibTeX
Esko Ukkonen: A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings. 313-323 BibTeX
Friedemann Mattern: Asynchronous Distributed Termination-Parallel and Symmetric Solutions with Echo Algorithms. 325-340 BibTeX
Ming-Tat Ko, Richard C. T. Lee, Jyun-Sheng Chang: An Optimal Approximation Algorithm for the Rectilinear m-Center Problem. 341-352 BibTeX
Bruce Randall Donald: The Complexity of Planar Compliant Motion Planning Under Uncertainty. 353-382 BibTeX
Michael M. Wu, Michael C. Loui: An Efficient Distributed Algorithm for Maximum Matching in General Graphs. 383-406 BibTeX
Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao: Computing Euclidean Maximum Spanning Trees. 407-419 BibTeX
David P. Dobkin, Diane L. Souvaine: Computational Geometry in a Curved World. 421-457 BibTeX
Bonnie Berger, John Rompel: A Better Performance Guarantee for Approximate Graph Coloring. 459-466 BibTeX

Yen-Tai Lai, Sany M. Leinwand: A Theory of Rectangular Dual Graphs. 467-483 BibTeX
Sang Ho Lee, Kyung-Yong Chwa: Some Chain Visibility Problems in a Simple Polygon. 485-507 BibTeX
Roberto Tamassia, Franco P. Preparata: Dynamic Maintenance of Planar Digraphs, with Applications. 509-527 BibTeX
Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci: A New Scheme for the Deterministic Simulation of PRAMs in VLSI. 529-544 BibTeX
Xin He: Efficient Parallel and Sequential Algorithms for 4-Coloring Perfect Planar Graphs. 545-559 BibTeX
David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars: Searching for Empty Convex Polygons. 561-571 BibTeX
Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata: An Optimal Algorithm for the Boundary of a Cell in a Union of Rays. 573-590 BibTeX
Frank K. Hwang, Y. C. Yao: Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees. 591-598 BibTeX