1. Editors' Foreword

   • T. Asano
   • S. Miyano
   • O. Watanabe

   Pages: 489 - 489

2. Competitive Analysis of On-Line Disk Scheduling

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

   Pages: 491 - 506

3. Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions

   • A. Lingas
   • V. Soltan

   Pages: 507 - 538

4. RUSPACE(log n) \(\subseteq\) DSPACE(log² n/log log n)

   • E. Allender
   • K.-J. Lange

   Pages: 539 - 550

5. Periodic Merging Networks

   • M. Kutylowski
   • K. Lorys
   • B. Oesterdiekhoff

   Pages: 551 - 578

6. OBDDs of a Monotone Function and Its Prime Implicants

   • K. Hayase
   • H. Imai

   Pages: 579 - 591

7. Efficient List Ranking on the Reconfigurable Mesh, with Applications

   • T. Hayashi
   • K. Nakano
   • S. Olariu

   Pages: 593 - 611

8. Computing the Maximum Overlap of Two Convex Polygons under Translations

   • M. de Berg
   • O. Cheong
   • M. Teillaud

   Pages: 613 - 628