External Links

    Journal: Algorithmica

    Volume 5, Issue 4

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

    Volume 5, Issue 3

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

    Volume 5, Issue 2

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

    Volume 5, Issue 1

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