1. Improved Algorithms for Uniform Partitions of Points

   • Agarwal
   • Bhattacharya
   • Sen

   OriginalPaper Pages: 521 - 539

2. An Online Algorithm for the Dynamic Maximal Dense Tree Problem

   • Awerbuch
   • Singh

   OriginalPaper Pages: 540 - 553

3. Approximations for a Bottleneck Steiner Tree Problem

   • Wang
   • -Z. Du

   OriginalPaper Pages: 554 - 561

4. Distributed and On-Line Routing on Tori

   • Tzuoo-Hawn Yeh
   • Cheng-Ming Kuo
   • Hsu-Chun Yen

   OriginalPaper Pages: 562 - 593

5. A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems

   • Broersma
   • Kloks
   • Müller

   OriginalPaper Pages: 594 - 610

6. Algorithmic Aspects of Acyclic Edge Colorings

   • Alon
   • Zaks

   OriginalPaper Pages: 611 - 614

7. A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart

   • Schöning

   OriginalPaper Pages: 615 - 623

8. Randomized Weighted Caching with Two Page Weights

   • Irani

   OriginalPaper Pages: 624 - 640

9. Delayed Binary Search, or Playing Twenty Questions with a Procrastinator

   • Ambainis
   • Bloch
   • Schweizer

   OriginalPaper Pages: 641 - 651

10. Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints

    • Shachnai
    • Tamir

    OriginalPaper Pages: 651 - 678

11. Corrigendum Static Frequency Assignment in Cellular Networks

    • Narayanan
    • Shende

    OriginalPaper Pages: 679 - 679