External Links

    Journal: Algorithmica

    Volume 14, Issue 6

    443 -- 479Bruce Randall Donald, Patrick G. Xavier. Provably Good Approximation Algorithms for Optimal Kinodynamic Planning: Robots with Decoupled Dynamics Bounds
    480 -- 530Bruce Randall Donald, Patrick G. Xavier. Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open-Chain Manipulators

    Volume 14, Issue 5

    367 -- 397Yui-Bin Chen, Doug Ierardi. The Complexity of Oblivious Plans for Orienting and Distinguishing Polygonal Parts
    398 -- 408Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama. An Optimal Parallel Algorithm for Planar Cycle Separators
    409 -- 428Andrew Chi-Chih Yao. Minimean Optimal Key Arrangements in Hash Tables
    429 -- 441Mikhail J. Atallah, Danny Z. Chen, D. T. Lee. An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications

    Volume 14, Issue 4

    291 -- 304Frank Thomson Leighton, Fillia Makedon, Ioannis G. Tollis. A 2n-2 Step Algorithm for Routing in an n*n Array with Constant-Size Queues
    305 -- 321Samir Khuller, Balaji Raghavachari, Neal E. Young. Balancing Minimum Spanning Trees and Shortest-Path Trees
    322 -- 339Sairam Subramanian, Roberto Tamassia, Jeffrey Scott Vitter. An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs
    340 -- 354Wolfgang Panny, Helmut Prodinger. Bottom-Up Mergesort - a Detailed Analysis
    355 -- 366Dany Breslauer, Zvi Galil. Finding All Periods and Initial Palindromes of a String in Parallel

    Volume 14, Issue 3

    203 -- 228Shuo-Yan Chou, R. C. Woo. A Linear-Time Algorithm for Constructing a Circular Visibility Diagram
    229 -- 248Ross M. McConnell. An O(n²) Incremental Algorithm for Modular Decomposition of Graphs and 2-Structures
    249 -- 260Esko Ukkonen. On-Line Construction of Suffix Trees
    261 -- 289Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack. Optimal Parallel Algorithms for Rectilinear Link-Distance Problems

    Volume 14, Issue 2

    123 -- 137Richard B. Borie. Generation of Polynomial-Time Algorithms for Some Optimization Problems on Tree-Decomposable Graphs
    138 -- 153Leizhen Cai, Derek G. Corneil. Isomorphic Tree Spanner Problems
    154 -- 168Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig. Lower Bounds for Set Intersection Queries
    169 -- 182Nancy M. Amato, Franco P. Preparata. A Time-Optimal Parallel Algorithm for Three-Dimensional Convex Hulls
    183 -- 201Nancy M. Amato. Finding a Closest Visible Vertex Pair Between Two Polygons

    Volume 14, Issue 1

    1 -- 26Sven Schuierer, Derick Wood. Staircase Visibility and Computation of Kernels
    27 -- 51Seung-Hak Choi, Sung Yong Shin, Kyung-Yong Chwa. Characterizing and Recognizing the Visibility Graph of a Funnel-Shaped Polygon
    52 -- 69Bogdan S. Chlebus, Krzysztof Diks, Miroslaw Kowaluk. O(log log n)-Time Integer Geometry on the CRCW PRAM
    70 -- 84Sally A. Goldman, Robert H. Sloan. Can PAC Learning Algorithms Tolerate Random Attribute Noise?
    85 -- 121James R. Knight, Eugene W. Myers. Approximate Regular Expression Pattern Matching with Concave Gap Penalties
    runs on