Concepedia
Journal of Algorithms · 1996 · 48 citations · 17 references
17
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
The NP-Completeness of Edge-Coloring
Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations
Easy problems for tree-decomposable graphs
Stefan Arnborg, Jens Lagergren, Detlef Seese · Journal of Algorithms · 1991 · 864 citations
Mathematical Programming, Engineering, Graph Theory +7
Linear-time computability of combinatorial problems on series-parallel graphs
K. Takamizawa, Takao Nishizeki, Naobumi Saito · Journal of the ACM · 1982 · 284 citations · Full text