Journal: Algorithmica

Volume 33, Issue 4

411 -- 435Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint. Some Aperture-Angle Optimization Problems
436 -- 460Sanguthevar Rajasekaran, Suneeta Ramaswami. Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane
461 -- 493Jochen Alber, Hans Leo Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier. Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
494 -- 510Gerth Stølting Brodal, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas. Optimal Solutions for the Temporal Precedence Problem
511 -- 516Edith Cohen, Haim Kaplan, Uri Zwick. Competitive Analysis of the LRFU Paging Algorithm

Volume 33, Issue 3

271 -- 0Michael T. Goodrich. Guest Editor s Foreword
272 -- 286Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang. Fast, Fair and Frugal Bandwidth Allocation in ATM Networks
287 -- 299Hiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama. Optimal Online Algorithms for an Electronic Commerce Money Distribution System
300 -- 334Edith Cohen, Haim Kaplan. Exploiting Regularities in Web Traffic Patterns for Cache Replacement
335 -- 352Ashish Goel, Kamesh Munagala. Extending Greedy Multicast Routing to Delay Sensitive Applications
353 -- 370Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger. Caching for Web Searching
371 -- 383Neal E. Young. On-Line File Caching
384 -- 409Sandy Irani. Page Replacement with Multi-Size Pages and Applications to Web Caching

Volume 33, Issue 2

129 -- 149Béchir el Ayeb. Fault Identification in System-Level Diagnosis: a Logic-Based Framework and an O(n:::2:::sqrt(tau/log n) Algorithm
150 -- 167Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink. Efficiently Approximating Polygonal Paths in Three and Higher Dimensions
168 -- 182Madhukar R. Korupolu, Vijaya Ramachandran. Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence
183 -- 200Frank K. H. A. Dehne, Afonso Ferreira, Edson Cáceres, Siang W. Song, Alessandro Roncato. Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP
201 -- 226Pankaj K. Agarwal, Cecilia Magdalena Procopiuc. Exact and Approximation Algorithms for Clustering
227 -- 242Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia. Computing Approximate Shortest Paths on Convex Polytopes
243 -- 262Victor Chepoi, Yann Vaxès. Augmenting Trees to Meet Biconnectivity and Diameter Constraints
263 -- 269Sergei Bespamyatnikh, Michael Segal. Fast Algorithms for Approximating Distances

Volume 33, Issue 1

1 -- 2Roberto Battiti, Alan A. Bertossi. Foreword
3 -- 18Laura A. Sanchis. Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem
19 -- 33Stefan Nilsson, Matti Tikkanen. An Experimental Study of Compression Methods for Dynamic Tries
34 -- 51Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger. An Experimental Study of Algorithms for Weighted Completion Time Scheduling
52 -- 70Vikas Kapoor, Dietmar Kühl, Alexander Wolff. A Tutorial for Designing Flexible Geometric Algorithms
71 -- 88Alberto Bertoni, Paola Campadelli, Giuliano Grossi. A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation
89 -- 103Rebecca N. Wright, Sara Spalding. Experimental Performance of Shared RSA Modulus Generation
104 -- 128Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter. Efficient Bulk Operations on Dynamic R-Trees