External Links

    Journal: Algorithmica

    Volume 35, Issue 4

    287 -- 300Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede. Compressing Two-Dimensional Routing Tables
    301 -- 318Lars Engebretsen. An Explicit Lower Bound for TSP with Distances One and Two
    321 -- 345Philip N. Klein, Robert H. B. Netzer, Hsueh-I Lu. Detecting Race Conditions in Parallel Programs that Use Semaphores
    347 -- 369Veli Mäkinen, Esko Ukkonen, Gonzalo Navarro. Approximate Matching of Run-Length Compressed Strings

    Volume 35, Issue 3

    193 -- 193Hon Wai Leong, Hiroshi Imai. Guest Editors Foreword
    194 -- 215Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu. Efficient Parallel Algorithms for Planar ::::st::::-Graphs
    216 -- 224Hiroyuki Kazuyoshi. An Approximation Algorithm for a Large-Scale Facility Location Problem
    225 -- 256Yoshiyuki Takao. Finding a Region with the Minimum Total ::::L::::::1:: Distance from Prescribed Terminals
    257 -- 268Vijaya Chung. A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
    269 -- 285Takeshi Hisao. A Characterization of Planar Graphs by Pseudo-Line Arrangements

    Volume 35, Issue 2

    95 -- 110Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri. The Minimum Range Assignment Problem on Linear Radio Networks
    111 -- 127Abraham P. Punnen, François Margot, Santosh N. Kabadi. TSP Heuristics: Domination Analysis and Complexity
    128 -- 145David Pisinger. Dynamic Programming on the Word RAM
    146 -- 175Claire Kenyon, Nicolas Schabanel. The Data Broadcast Problem with Non-Uniform Transmission Times
    176 -- 191Lene M. Favrholdt, Morten N. Nielsen. On-Line Edge-Coloring with a Fixed Number of Colors

    Volume 35, Issue 1

    1 -- 20Julien Basch, Leonidas J. Guibas, G. D. Ramkumar. Reporting Red - Blue Intersections between Two Sets of Connected Line Segments
    21 -- 55Peter Sanders, Sebastian Egner, Jan H. M. Korst. Fast Concurrent Access to Parallel Disks
    56 -- 74Enrico Nardelli, Guido Proietti, Peter Widmayer. Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast
    75 -- 93Kurt Mehlhorn, Peter Sanders. Scanning Multiple Sequences Via Cache Memory
    runs on