Volume 33,
Number 1,
2002
- Roberto Battiti, Alan A. Bertossi:
Foreword.
1-2
- Laura A. Sanchis:
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem.
3-18
- Stefan Nilsson, Matti Tikkanen:
An Experimental Study of Compression Methods for Dynamic Tries.
19-33
- Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger:
An Experimental Study of Algorithms for Weighted Completion Time Scheduling.
34-51
- Vikas Kapoor, Dietmar Kühl, Alexander Wolff:
A Tutorial for Designing Flexible Geometric Algorithms.
52-70
- Alberto Bertoni, Paola Campadelli, Giuliano Grossi:
A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation.
71-88
- Rebecca N. Wright, Sara Spalding:
Experimental Performance of Shared RSA Modulus Generation.
89-103
- Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter:
Efficient Bulk Operations on Dynamic R-Trees.
104-128
Volume 33,
Number 2,
2002
- Béchir el Ayeb:
Fault Identification in System-Level Diagnosis: a Logic-Based Framework and an O(n2sqrt(tau/log n) Algorithm.
129-149
- Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink:
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions.
150-167
- Madhukar R. Korupolu, Vijaya Ramachandran:
Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence.
168-182
- Frank K. H. A. Dehne, Afonso Ferreira, Edson Cáceres, Siang W. Song, Alessandro Roncato:
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP.
183-200
- Pankaj K. Agarwal, Cecilia Magdalena Procopiuc:
Exact and Approximation Algorithms for Clustering.
201-226
- Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia:
Computing Approximate Shortest Paths on Convex Polytopes.
227-242
- Victor Chepoi, Yann Vaxès:
Augmenting Trees to Meet Biconnectivity and Diameter Constraints.
243-262
- Sergei Bespamyatnikh, Michael Segal:
Fast Algorithms for Approximating Distances.
263-269
Volume 33,
Number 3,
2002
- Michael T. Goodrich:
Guest Editor's Foreword.
271
- Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang:
Fast, Fair and Frugal Bandwidth Allocation in ATM Networks.
272-286
- Hiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama:
Optimal Online Algorithms for an Electronic Commerce Money Distribution System.
287-299
- Edith Cohen, Haim Kaplan:
Exploiting Regularities in Web Traffic Patterns for Cache Replacement.
300-334
- Ashish Goel, Kamesh Munagala:
Extending Greedy Multicast Routing to Delay Sensitive Applications.
335-352
- Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger:
Caching for Web Searching.
353-370
- Neal E. Young:
On-Line File Caching.
371-383
- Sandy Irani:
Page Replacement with Multi-Size Pages and Applications to Web Caching.
384-409
Volume 33,
Number 4,
2002
- Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint:
Some Aperture-Angle Optimization Problems.
411-435
- Sanguthevar Rajasekaran, Suneeta Ramaswami:
Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane.
436-460
- Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier:
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs.
461-493
- Gerth Stølting Brodal, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas:
Optimal Solutions for the Temporal Precedence Problem.
494-510
- Edith Cohen, Haim Kaplan, Uri Zwick:
Competitive Analysis of the LRFU Paging Algorithm.
511-516
Last update Fri May 25 08:52:58 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
