On Interval Routing Schemes and Treewidth

Introduction to Algorithms

V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 16.9K citations

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

Hans L. Bodlaender · SIAM Journal on Computing · 1996 · 1.5K citations

Mathematical Programming, Engineering, Planar Graph +17

The monadic second-order logic of graphs. I. Recognizable sets of finite graphs

Bruno Courcelle · Information and Computation · 1990 · 1.4K citations

Monadic Second-order Logic, Graph Theory, Recognizable Sets +11

Graph Minors .XIII. The Disjoint Paths Problem

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1995 · 1.3K citations

Graph Minor, Network Science, Graph Theory +5

Easy problems for tree-decomposable graphs

Stefan Arnborg, Jens Lagergren, Detlef Seese · Journal of Algorithms · 1991 · 864 citations

Mathematical Programming, Engineering, Graph Theory +7