External Links

    Journal: Algorithmica

    Volume 28, Issue 4

    367 -- 389Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis. Improved Algorithms for Dynamic Shortest Paths
    390 -- 421Hsiao-Feng Steven Chen, D. T. Lee. A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion
    422 -- 437Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari. Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem
    438 -- 437Bruce M. Maggs, Berthold Vöcking. Improved Routing and Sorting on Multibutterflies

    Volume 28, Issue 3

    269 -- 270Bala Kalyanasundaram, Kirk Pruhs, Eric Torng. Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks
    271 -- 287John H. Reif. Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input
    288 -- 306Desh Ranjan, Enrico Pontelli, Gopal Gupta, Luc Longpré. The Temporal Precedence Problem
    307 -- 322Jesus Garcia-Lopez, Pedro A. Ramos. A Unified Approach to Conic Visibility
    323 -- 354Lenwood S. Heath, John Paul C. Vergara. Sorting by Short Block-Moves
    353 -- 366Mark de Berg. Linear Size Binary Space Partitions for Uncluttered Scenes

    Volume 28, Issue 2

    173 -- 216Steven S. Seiden. Online Randomized Multiprocessor Scheduling
    217 -- 241Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi. Parallel Algorithms for Partitioning Sorted Sets and Related Problems
    242 -- 254Eric Ruppert. Finding the k Shortest Paths in Parallel
    255 -- 267Teofilo F. Gonzalez. Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems

    Volume 28, Issue 1

    1 -- 0Gerhard J. Woeginger. Introduction
    2 -- 15Johannes Blömer. Denesting by Bounded Degree Radicals
    16 -- 36Ulrik Brandes, Dorothea Wagner. A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
    37 -- 50Krzysztof Diks, Andrzej Pelc. Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes
    51 -- 75Hristo Djidjev. Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications
    76 -- 103Daniele Frigioni, Giuseppe F. Italiano. Dynamically Switching Vertices in Planar Graphs
    104 -- 124Vladimir Grebinski, Gregory Kucherov. Optimal Reconstruction of Graphs under the Additive Model
    125 -- 144Bala Kalyanasundaram, Kirk Pruhs. Fault-Tolerant Real-Time Scheduling
    145 -- 172Luca Trevisan. Approximating Satisfiable Satisfiability Problems
    runs on