Algorithmica, Volume 28, 2000

Volume 28, Number 1, 2000

• Gerhard J. Woeginger:
  Introduction. 1
  Electronic Edition (Springer LINK) BibTeX
• Johannes Blömer:
  Denesting by Bounded Degree Radicals. 2-15
  Electronic Edition (Springer LINK) BibTeX
• Ulrik Brandes, Dorothea Wagner:
  A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs. 16-36
  Electronic Edition (Springer LINK) BibTeX
• Krzysztof Diks, Andrzej Pelc:
  Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes. 37-50
  Electronic Edition (Springer LINK) BibTeX
• Hristo Djidjev:
  Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications. 51-75
  Electronic Edition (Springer LINK) BibTeX
• Daniele Frigioni, Giuseppe F. Italiano:
  Dynamically Switching Vertices in Planar Graphs. 76-103
  Electronic Edition (Springer LINK) BibTeX
• Vladimir Grebinski, Gregory Kucherov:
  Optimal Reconstruction of Graphs under the Additive Model. 104-124
  Electronic Edition (Springer LINK) BibTeX
• Bala Kalyanasundaram, Kirk Pruhs:
  Fault-Tolerant Real-Time Scheduling. 125-144
  Electronic Edition (Springer LINK) BibTeX
• Luca Trevisan:
  Approximating Satisfiable Satisfiability Problems. 145-172
  Electronic Edition (Springer LINK) BibTeX

Volume 28, Number 2, 2000

• Steven S. Seiden:
  Online Randomized Multiprocessor Scheduling. 173-216
  Electronic Edition (Springer LINK) BibTeX
• Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi:
  Parallel Algorithms for Partitioning Sorted Sets and Related Problems. 217-241
  Electronic Edition (Springer LINK) BibTeX
• Eric Ruppert:
  Finding the k Shortest Paths in Parallel. 242-254
  Electronic Edition (Springer LINK) BibTeX
• Teofilo F. Gonzalez:
  Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems. 255-267
  Electronic Edition (Springer LINK) BibTeX

Volume 28, Number 3, 2000

• Bala Kalyanasundaram, Kirk Pruhs, Eric Torng:
  Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks. 269-270
  Electronic Edition (link) BibTeX
• John H. Reif:
  Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input. 271-287
  Electronic Edition (link) BibTeX
• Desh Ranjan, Enrico Pontelli, Gopal Gupta, Luc Longpré:
  The Temporal Precedence Problem. 288-306
  Electronic Edition (link) BibTeX
• Jesus Garcia-Lopez, Pedro A. Ramos:
  A Unified Approach to Conic Visibility. 307-322
  Electronic Edition (link) BibTeX
• Lenwood S. Heath, John Paul C. Vergara:
  Sorting by Short Block-Moves. 323-354
  Electronic Edition (link) BibTeX
• Mark de Berg:
  Linear Size Binary Space Partitions for Uncluttered Scenes. 353-366
  Electronic Edition (link) BibTeX

Volume 28, Number 4, 2000

• Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis:
  Improved Algorithms for Dynamic Shortest Paths. 367-389
  Electronic Edition (link) BibTeX
• Hsiao-Feng Steven Chen, D. T. Lee:
  A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion. 390-421
  Electronic Edition (link) BibTeX
• Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari:
  Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. 422-437
  Electronic Edition (link) BibTeX
• Bruce M. Maggs, Berthold Vöcking:
  Improved Routing and Sorting on Multibutterflies. 438-437
  Electronic Edition (link) BibTeX