External Links

    Journal: Algorithmica

    Volume 41, Issue 4

    233 -- 244Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal. Geographic Quorum System Approximations
    245 -- 267Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors
    269 -- 287Sorina Dumitrescu, Xiaolin Wu. Optimal Two-Description Scalar Quantizer Design
    289 -- 308Carsten Gutwenger, Petra Mutzel, René Weiskircher. Inserting an Edge into a Planar Graph
    309 -- 341Yi-Jen Chiang. New Approximation Results for the Maximum Scatter TSP

    Volume 41, Issue 3

    147 -- 157Sariel Har-Peled, Soham Mazumdar. Fast Algorithms for Computing the Smallest k-Enclosing Circle
    159 -- 183Vladlen Koltun, Carola Wenk. Matching Polyhedral Terrains Using Overlays of Envelopes
    185 -- 202Sariel Har-Peled, Bardia Sadri. How Fast Is the k-Means Method?
    203 -- 231Heikki Hyyrö, Gonzalo Navarro. Bit-Parallel Witnesses and Their Applications to Approximate String Matching

    Volume 41, Issue 2

    73 -- 87Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle. Graph Searching, Elimination Trees, and a Generalization of Bandwidth
    89 -- 116Gonzalo Navarro, Mathieu Raffinot. New Techniques for Regular Expression Searching
    117 -- 129Jochen Könemann, Asaf Levin, Amitabh Sinha. Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
    131 -- 145Cees Duin. A Branch-Checking Algorithm for All-Pairs Shortest Paths

    Volume 41, Issue 1

    1 -- 23Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri. An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms
    25 -- 41Joan Feigenbaum, Sampath Kannan, Jian Zhang. Computing Diameter in the Streaming and Sliding-Window Models
    43 -- 52Refael Hassin, Asaf Levin. Approximation Algorithms for Quickest Spanning Tree Problems
    53 -- 72Guoliang Xue, Wei Xiao. A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology
    runs on