Approximating maximum independent sets by excluding subgraphs Ravi BoppanaMagnús M. Halldórsson Algorithm Theory Pages: 180 - 196
Canonical representations of partial 2- and 3-trees Stefan ArnborgAndrzej Proskurowski Algorithm Theory Pages: 197 - 214
Efficient parallel algorithms for shortest paths in planar digraphs Grammati E. PantziouPaul G. SpirakisChristos D. Zaroliagis Algorithm Theory Pages: 215 - 236
Applications of a semi-dynamic convex hull algorithm John HershbergerSubhash Suri Algorithm Theory Pages: 249 - 267
Intersection queries in sets of disks Marc van KreveldMark OvermarsPankaj K. Agarwal Algorithm Theory Pages: 268 - 279
Fast algorithms for greedy triangulation Christos LevcopoulosAndrzej Lingas Algorithm Theory Pages: 280 - 296
Improved bounds for the expected behaviour of AVL trees Ricardo Baeza-YatesGaston H. GonnetNivio Ziviani Algorithm Theory Pages: 297 - 315
Average search and update costs in skip lists Thomas PapadakisJ. Ian MunroPatricio V. Poblete Algorithm Theory Pages: 316 - 332
Some efficient methods for enclosing simple zeros of nonlinear equations Götz E. AlefeldFlorian A. Potra Part II Numerical Mathematics Pages: 334 - 344
Butcher's simplifying assumption for symplectic integrators Satoshi SaitoHiroshi SugiuraTaketomo Mitsui Part II Numerical Mathematics Pages: 345 - 349
Stability of backward Euler multirate methods and convergence of waveform relaxation Jørgen SandStig Skelboe Part II Numerical Mathematics Pages: 350 - 366