External Links

    Journal: Algorithmica

    Volume 18, Issue 4

    461 -- 485William R. Burley, Sandy Irani. On Algorithm Design for Metrical Task Systems
    486 -- 511Shlomi Dolev, Jennifer L. Welch. Wait-Free Clock Synchronization
    512 -- 520S. Muthukrishnan. Detecting False Matches in String-Matching Algorithms
    521 -- 523Robert Beals. Equivalence of Binary and Ternary Algebraic Decision Trees
    524 -- 529Sergei Bespamyatnikh. On Constructing Minimum Spanning Trees in R:::k:::::l::
    530 -- 543T. Matsui. A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs
    544 -- 559Celina Imielinska, Bahman Kalantari. A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors
    560 -- 574Peichen Pan, Sai-keung Dong, C. L. Liu. Optimal Graph Constraint Reduction for Symbolic Layout Compaction

    Volume 18, Issue 3

    283 -- 305Susanne Albers. On the Influence of Lookahead in Competitive Paging Algorithms
    306 -- 323Mark de Berg, Marc J. van Kreveld. Trekking in the Alps Without Freezing or Getting Tired
    324 -- 362Robert F. Cohen, Roberto Tamassia. Combine and Conquer
    363 -- 383Karsten Weihe. Multicommodity Flows in Even, Planar Networks
    384 -- 404Vijaya Ramachandran, Honghua Yang. An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem
    405 -- 416Ornan Ori Gerstel, Shmuel Zaks. The Bit Complexity of Distributed Sorting
    417 -- 444Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn. Routing on Meshes with Buses
    445 -- 460Ernst W. Mayr, Ralph Werchner. Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks

    Volume 18, Issue 2

    165 -- 197Yui-Bin Chen, Doug Ierardi. Time-Optimal Trajectories of a Rod in the Plane Subject to Velocity Constraints
    198 -- 216Kuo-Hui Tsai, D. T. Lee. k Best Cuts for Circular-Arc Graphs
    217 -- 228L. Paul Chew, Steven Fortune. Sorting Helps for Voronoi Diagrams
    229 -- 245Takeshi Tokuyama. Orthogonal Queries in Segments
    246 -- 262Mark H. Overmars, Nicola Santoro. Improved Bounds for Electing a Leader in a Synchronous Ring
    263 -- 270Valerie King. A Simpler Minimum Spanning Tree Verification Algorithm
    271 -- 280Stephen V. Rice, Horst Bunke, Thomas A. Nartker. Classes of Cost Functions for String Edit Distance

    Volume 18, Issue 1

    3 -- 20Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees
    21 -- 43R. Ravi, David P. Williamson. An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems
    44 -- 66David Peleg, Gideon Schechtman, Avishai Wool. Randomized Approximation of Bounded Multicovering Problems
    67 -- 81Alan M. Frieze, Mark Jerrum. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION
    82 -- 98David R. Karger, Rajeev Motwani, G. D. S. Ramkumar. On Approximating the Longest Path in a Graph
    99 -- 110Alexander Zelikovsky. A Series of Approximation Algorithms for the Acyclic Directed Steiner Tree Problem
    111 -- 121Naveen Garg, Dorit S. Hochbaum. An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane
    122 -- 144Flávio Keidi Miyazawa, Yoshiko Wakabayashi. An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis
    145 -- 163Magnús M. Halldórsson, Jaikumar Radhakrishnan. Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs
    runs on