| 293 | -- | 294 | Rolf G. Karlsson, Andrzej Lingas. Guest Editor s Foreword |
| 295 | -- | 322 | Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time |
| 323 | -- | 336 | Thore Husfeldt, Theis Rauhe, Søren Skyum. Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching |
| 337 | -- | 351 | Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan. The Randomized Complexity of Maintaining the Minimum |
| 352 | -- | 366 | David Fernández-Baca, Giora Slutzki, David Eppstein. Using Sparsification for Parametric Minimum Spanning Tree Problems |
| 367 | -- | 387 | Madhav V. Marathe, R. Ravi, Ravi Sundaram. Service-Constrained Network Design Problems |
| 388 | -- | 404 | Takao Asano, Takao Ono, Tomio Hirata. Approximation Algorithms for the Maximum Satisfiability Problem |
| 405 | -- | 424 | Hoong Chuin Lau, Osamu Watanabe. Randomized Approximation of the Constraint Satisfaction Problem |
| 425 | -- | 439 | Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan. Approximate Hypergraph Coloring |