1. An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs

   • S. Sunder
   • Xin He

   OriginalPaper Pages: 243 - 262

2. Decremental 2- and 3-connectivity on planar graphs

   • D. Giammarresi
   • G. F. Italiano

   OriginalPaper Pages: 263 - 287

3. Covering a string

   • C. S. Iliopoulos
   • D. W. G. Moore
   • K. Park

   OriginalPaper Pages: 288 - 297

4. Communication complexity in a 3-computer model

   • A. Ambainis

   OriginalPaper Pages: 298 - 301

5. Approximation algorithms for tree alignment with a given phylogeny

   • Lusheng Wang
   • Tao Jiang
   • E. L. Lawler

   OriginalPaper Pages: 302 - 315

6. Equispreading tree in Manhattan distance

   • M. Edahiro

   OriginalPaper Pages: 316 - 338

7. Shortest noncrossing paths in plane graphs

   • Junya Takahashi
   • Hitoshi Suzuki
   • Takao Nishizeki

   OriginalPaper Pages: 339 - 357