Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text

Computing, Computer Science, Mathematics +12

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

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

Computing, Computer Science, Algorithms +11

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

Which Problems Have Strongly Exponential Complexity?

Russell Impagliazzo, Ramamohan Paturi, Francis Zane · Journal of Computer and System Sciences · 2001 · 1.4K citations

Computing, Computer Science, Mathematics +16

A partial k-arboretum of graphs with bounded treewidth

Hans L. Bodlaender · Theoretical Computer Science · 1998 · 1.1K citations · Full text

Natural Sciences, Mathematics, Combinatorics +6