1. Introduction

   • H. L. Bodlaender

   Pages: 209 - 211

2. Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms

   • S. Chaudhuri
   • C. D. Zaroliagis

   Pages: 212 - 226

3. A Linear Algorithm for Finding \boldmath[{g,f }]-Colorings of Partial \boldmath{k }-Trees

   • X. Zhou
   • K. Fuse
   • T. Nishizeki

   Pages: 227 - 243

4. Generalized Dominators for Structured Programs

   • S. Alstrup
   • P. W. Lauridsen
   • M. Thorup

   Pages: 244 - 253

5. Linear-Time Algorithms for Partial \boldmathk -Tree Complements

   • A. Gupta
   • D. Kaller
   • T. Shermer

   Pages: 254 - 274

6. Diameter and Treewidth in Minor-Closed Graph Families

   • D. Eppstein

   Pages: 275 - 291

7. Dynamic Algorithms for Graphs of Bounded Treewidth

   • T. Hagerup

   Pages: 292 - 315

8. Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs

   • C. Lucet
   • J.-F. Manouvrier
   • J. Carlier

   Pages: 316 - 336

9. Faster Algorithms for Subgraph Isomorphism of \sl k -Connected Partial \sl k -Trees

   • A. Dessmark
   • A. Lingas
   • A. Proskurowski

   Pages: 337 - 347

10. Definability Equals Recognizability of Partial 3-Trees and \sl k -Connected Partial \sl k -Trees

    • D. Kaller

    Pages: 348 - 381

11. Memory Requirements for Table Computations in Partial \sl k -Tree Algorithms

    • B. Aspvall
    • J. A. Telle
    • A. Proskurowski

    Pages: 382 - 394

12. Graph Searching on Some Subclasses of Chordal Graphs

    • S.-L. Peng
    • C. Y. Tang
    • T.-s. Hsu

    Pages: 395 - 426