External Links

    Journal: Algorithmica

    Volume 11, Issue 6

    501 -- 524Mordecai J. Golin. A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm
    525 -- 541Neal E. Young. The k-Server Dual and Loose Competitiveness for Paging
    542 -- 571Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki. Competitive Randomized Algorithms for Nonuniform Problems
    572 -- 578Amos Fiat, Yuval Rabani, Yiftach Ravid, Baruch Schieber. A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle

    Volume 11, Issue 5

    429 -- 442Thomas H. Spencer. Provably Good Pattern Generators for a Random Pattern Test
    443 -- 468Vijaya Ramachandran, Honghua Yang. Finding the Closed Partition of a Planar Graph
    469 -- 484Mark H. Overmars, Micha Sharir. An Improved Technique for Output-Sensitive Hidden Surface Removal
    485 -- 499Christos H. Papadimitriou, P. Venkat Rangan, Martha Sideri. Designing Secure Communication Protocols from Trust Specification

    Volume 11, Issue 4

    341 -- 352Heather Booth, Jeffery Westbrook. A Linear Algorithm for Analysis of Minimum Spanning and Shortest-Path Trees of Planar Graphs
    353 -- 359Levent Tunçel. On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems
    360 -- 378Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman. Visibility with a Moving Point of View
    379 -- 403Peter Eades, Nicholas C. Wormald. Edge Crossings in Drawings of Bipartite Graphs
    404 -- 428Peter Epstein, J. Kavanagh, A. Knight, J. May, T. Nguyen, Jörg-Rüdiger Sack. A Workbench for Computational Geometry

    Volume 11, Issue 3

    197 -- 199Harold N. Gabow. Editor s Foreword: Special Issur on Network Flow Algorithms
    200 -- 225Samir Khuller, Joseph Naor. Flow in Planar Graphs with Vertex Capacities
    226 -- 242Tomasz Radzik, Andrew V. Goldberg. Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results
    243 -- 255Kazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige. A New Scaling Algorithm for the Maximum Mean Cut Problem
    256 -- 276Yaron Pinto, Ron Shamir. Efficient Algorithms for Minimum-Cost Flow Problems with Piecewise-Linear Convex Costs
    278 -- 290Dan Gusfield, Éva Tardos. A Faster Parametric Minimum-Cut Algorithm
    291 -- 319Tomás Feder. Network Flow and 2-Satisfiability
    320 -- 340Edith Cohen, Nimrod Megiddo. Algorithms and Complexity Analysis for Some Flow Problems

    Volume 11, Issue 2

    93 -- 103Vladimir Batagelj, Simona Korenjak-Cerne, Sandi Klavzar. Dynamic Programming and Convex Clustering
    104 -- 115Rudolf Fleischer. A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort
    116 -- 132Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir. Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains
    133 -- 145Reuven Bar-Yehuda, Sergio Fogel. Variations on Ray Shooting
    146 -- 184Johan Jeuring. The Derivation of On-Line Algorithms, with an Application To Finding Palindromes
    185 -- 195Pankaj K. Agarwal, Micha Sharir. Planar Geometric Location Problems

    Volume 11, Issue 1

    1 -- 0Prabhakar Raghavan. Guest Editor s Foreword: Special Issue on On-Line Algorithms
    2 -- 14Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson. On the Power of Randomization in On-Line Algorithms
    15 -- 32Nick Reingold, Jeffery Westbrook, Daniel Dominic Sleator. Randomized Competitive Algorithms for the List Update Problem
    33 -- 52Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan, Madhu Sudan. On-Line Algorithms for Locating Checkpoints
    53 -- 72Sandy Irani. Coloring Inductive Graphs On-Line
    73 -- 91Shai Ben-David, Allan Borodin. A New Measure for the Study of On-Line Algorithms
    runs on