1. Preface

   • John R. Gilbert

   Algorithm Theory Pages: 178 - 179

2. Approximating maximum independent sets by excluding subgraphs

   • Ravi Boppana
   • Magnús M. Halldórsson

   Algorithm Theory Pages: 180 - 196

3. Canonical representations of partial 2- and 3-trees

   • Stefan Arnborg
   • Andrzej Proskurowski

   Algorithm Theory Pages: 197 - 214

4. Efficient parallel algorithms for shortest paths in planar digraphs

   • Grammati E. Pantziou
   • Paul G. Spirakis
   • Christos D. Zaroliagis

   Algorithm Theory Pages: 215 - 236

5. Finding thek smallest spanning trees

   • David Eppstein

   Algorithm Theory Pages: 237 - 248

6. Applications of a semi-dynamic convex hull algorithm

   • John Hershberger
   • Subhash Suri

   Algorithm Theory Pages: 249 - 267

7. Intersection queries in sets of disks

   • Marc van Kreveld
   • Mark Overmars
   • Pankaj K. Agarwal

   Algorithm Theory Pages: 268 - 279

8. Fast algorithms for greedy triangulation

   • Christos Levcopoulos
   • Andrzej Lingas

   Algorithm Theory Pages: 280 - 296

9. Improved bounds for the expected behaviour of AVL trees

   • Ricardo Baeza-Yates
   • Gaston H. Gonnet
   • Nivio Ziviani

   Algorithm Theory Pages: 297 - 315

10. Average search and update costs in skip lists

    • Thomas Papadakis
    • J. Ian Munro
    • Patricio V. Poblete

    Algorithm Theory Pages: 316 - 332

11. Some efficient methods for enclosing simple zeros of nonlinear equations

    • Götz E. Alefeld
    • Florian A. Potra

    Part II Numerical Mathematics Pages: 334 - 344

12. Butcher's simplifying assumption for symplectic integrators

    • Satoshi Saito
    • Hiroshi Sugiura
    • Taketomo Mitsui

    Part II Numerical Mathematics Pages: 345 - 349

13. Stability of backward Euler multirate methods and convergence of waveform relaxation

    • Jørgen Sand
    • Stig Skelboe

    Part II Numerical Mathematics Pages: 350 - 366

14. Invariant curves for variable step size integrators

    • D. Stoffer
    • K. Nipp

    Erratum Pages: 367 - 368