External Links

    Journal: Algorithmica

    Volume 31, Issue 4

    459 -- 478Peter A. Beling. Exact Algorithms for Linear Programming over Algebraic Extensions
    479 -- 500Guoliang Xue, Guo-Hui Lin, Ding-Zhu Du. Grade of Service Steiner Minimum Trees in the Euclidean Plane
    501 -- 512Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer. Relaxed Balance Using Standard Rotations
    513 -- 529Ruy Luiz Milidiú, Eduardo Sany Laber. Bounding the Inefficiency of Length-Restricted Prefix Codes
    530 -- 547B. Das, Michael C. Loui. Reconstructing a Minimum Spanning Tree after Deletion of Any Node

    Volume 31, Issue 3

    240 -- 290Vicky Siu-Ngan Choi, Mordecai J. Golin. Lopsided Trees, I: Analyses
    291 -- 303Luc Devroye. On the Probablistic Worst-Case Time of Find
    304 -- 317Michael Drmota. The Asymptotic Number of Leftist Trees
    318 -- 360Philippe Jacquet, Wojciech Szpankowski, Jing Tang. Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source
    361 -- 377Philippe Flajolet, Guy Louchard. Analytic Variations on the Airy Distribution
    378 -- 402Micha Hofri, Hadas Shachnai. Efficient Reorganization of Binary Search Trees
    403 -- 412Tatsuie Tsukiji, Hosam M. Mahmoud. A Limit Law for Outputs in Random Recursive Circuits
    413 -- 432Daniel Panario, L. Bruce Richmond. Exact Largest and Smallest Size of Components
    433 -- 441Helmut Prodinger. A q-Analogue of the Path Length of Binary Search Trees
    442 -- 457Robert T. Smythe, J. Wellner. Stochastic Analysis of Shell Sort

    Volume 31, Issue 2

    115 -- 138János Csirik, David S. Johnson. Bounded Space On-Line Bin Packing: Best Is Better than First
    139 -- 154Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein. Uniquely Restricted Matchings
    155 -- 178Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau. All-to-All Optical Routing in Chordal Rings of Degree 4
    179 -- 207Neelima Gupta, Sandeep Sen. An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains
    208 -- 236Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda. Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers

    Volume 31, Issue 1

    1 -- 28Alon Efrat, Alon Itai, Matthew J. Katz. Geometry Helps in Bottleneck Matching and Related Problems
    29 -- 43Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén. On-Line Competitive Algorithms for Call Admission in Optical Networks
    44 -- 57J. C. Cogolludo, Sanguthevar Rajasekaran. Permutation Routing on Reconfigurable Meshes
    58 -- 78R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
    79 -- 113Stephan Eidenbenz, Christoph Stamm, Peter Widmayer. Inapproximability Results for Guarding Polygons and Terrains
    runs on