Journal: Algorithmica

Volume 32, Issue 4

521 -- 539Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen. Improved Algorithms for Uniform Partitions of Points
540 -- 553Baruch Awerbuch, Tripurari Singh. An Online Algorithm for the Dynamic Maximal Dense Tree Problem
554 -- 561Lusheng Wang, Ding-Zhu Du. Approximations for a Bottleneck Steiner Tree Problem
562 -- 593Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen. Distributed and On-Line Routing on Tori
594 -- 610Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller. A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems
611 -- 614Noga Alon, Ayal Zaks. Algorithmic Aspects of Acyclic Edge Colorings
615 -- 623Uwe Schöning. A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart
624 -- 640Sandy Irani. Randomized Weighted Caching with Two Page Weights
641 -- 651Andris Ambainis, Stephen A. Bloch, David L. Schweizer. Delayed Binary Search, or Playing Twenty Questions with a Procrastinator
651 -- 678Hadas Shachnai, Tami Tamir. Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints
679 -- 0Lata Narayanan, Sunil M. Shende. Corrigendum: Static Frequency Assignment in Cellular Networks

Volume 32, Issue 3

345 -- 363Jop F. Sibeyn. One-by-One Cleaning for Practical Parallel List Ranking
364 -- 395Amir M. Ben-Amram, Zvi Galil. Lower Bounds for Dynamic Data Structures on Algebraic RAMs
396 -- 422Dimitris Fotakis, Paul G. Spirakis. Minimum Congestion Redundant Assignments to Tolerate Random Faults
423 -- 436Susan Landau, Neil Immerman. Embedding Linkages on an Integer Lattice
437 -- 458James Abello, Adam L. Buchsbaum, Jeffery Westbrook. A Functional Approach to External Graph Algorithms
459 -- 466Edith Cohen, Haim Kaplan. Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach
467 -- 473Thomas Erlebach, Torben Hagerup. Routing Flow Through a Strongly Connected Graph
474 -- 506Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo. Quasi-Upward Planarity
507 -- 520Klaus Jansen, Lorant Porkolab. Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

Volume 32, Issue 2

163 -- 200Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein. Optimal Time-Critical Scheduling via Resource Augmentation
201 -- 245Ran Bachrach, Ran El-Yaniv, M. Reinstadtler. On the Competitive Theory and Practice of Online List Accessing Algorithms
247 -- 261Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis. Scheduling Independent Multiprocessor Tasks
262 -- 276Yoko Kamidoi, Shin ichi Wakabayashi, Noriyoshi Yoshida. A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem
277 -- 301Matthew Andrews, Michael A. Bender, Lisa Zhang. New Algorithms for Disk Scheduling
302 -- 343Oded Goldreich, Dana Ron. Property Testing in Bounded Degree Graphs

Volume 32, Issue 1

1 -- 35Andreas Crauser, Paolo Ferragina. A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory
36 -- 60Esteban Feuerstein, Alejandro Strejilevich de Loma. On-Line Multi-Threaded Paging
61 -- 72John G. Del Greco, Chandra N. Sekharan, R. Sridhar. Fast Parallel Reordering and Isomorphism Testing of k-Trees
73 -- 86Dan Gusfield, Charles U. Martel. The Structure and Complexity of Sports Elimination Numbers
87 -- 94David Eppstein, Marshall W. Bern, Brad L. Hutchings. Algorithms for Coloring Quadtrees
95 -- 106Yin Li, William F. Smyth. Computing the Cover Array in Linear Time
107 -- 122Tracy Kimbrel. Interleaved Prefetching
123 -- 143Susanne Albers, Klaus Kursawe, Sven Schuierer. Exploring Unknown Environments with Obstacles
144 -- 156Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid. Improved Algorithms for Constructing Fault-Tolerant Spanners
157 -- 162Eric T. Bax, Joel Franklin. A Permanent Algorithm with exp[Omega (n:::1/3:::/2 ln n )] Expected Speedup for 0-1 Matrices