External Links

    Journal: Algorithmica

    Volume 37, Issue 4

    243 -- 262Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza. Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items
    263 -- 293Naoki Abe, Alan W. Biermann, Philip M. Long. Reinforcement Learning with Immediate Rewards and Linear Hypotheses
    295 -- 326Allan Borodin, Morten N. Nielsen, Charles Rackoff. (Incremental) Priority Algorithms
    327 -- 346Daniel Kobler, Udi Rotics. Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size

    Volume 37, Issue 3

    149 -- 164Francis Y. L. Chin, Stanley P. Y. Fung. Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
    165 -- 186Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein. A Distributed Ant Algorithm for Efficiently Patrolling a Network
    187 -- 209Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs
    211 -- 232Sergio Cabello, Marc J. van Kreveld. Approximation Algorithms for Aligning Points
    233 -- 241Mauricio Ayala-Rincón, Paulo D. Conejo. A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees

    Volume 37, Issue 2

    75 -- 92Guy Kortsarz, Zeev Nutov. Approximating Node Connectivity Problems via Set Covers
    93 -- 147Ross M. McConnell. Linear-Time Recognition of Circular-Arc Graphs

    Volume 37, Issue 1

    1 -- 24Lars Arge. The Buffer Tree: A Technique for Designing Batched External Data Structures
    25 -- 42Jens Gramm, Rolf Niedermeier, Peter Rossmanith. Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems
    43 -- 74Moritz G. Maaß. Linear Bidirectional On-Line Construction of Affix Trees
    runs on