Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs

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

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

Natural Sciences, Computer Science, Mathematics +10

Complexity of Finding Embeddings in a <i>k</i>-Tree

Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski · SIAM Journal on Algebraic and Discrete Methods · 1987 · 1.2K citations

Computing, Computer Science, Mathematics +15

Easy problems for tree-decomposable graphs

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

Natural Sciences, Computer Science, Mathematics +9

The NP-completeness column: An ongoing guide

David S. Johnson · Journal of Algorithms · 1986 · 803 citations

Computing, Computer Science, Algorithms +9

The Recognition of Series Parallel Digraphs

Jacobo Valdes, Robert E. Tarjan, Eugene L. Lawler · SIAM Journal on Computing · 1982 · 611 citations

Computing, Computer Science, Mathematics +9