Kernelization using structural parameters on sparse graph classes

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

Color-coding

Noga Alon, Raphael Yuster, Uri Zwick · Journal of the ACM · 1995 · 1K citations · Full text

Computing, Computer Science, Algorithms +16

On problems without polynomial kernels

Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows et al. · Journal of Computer and System Sciences · 2009 · 577 citations

Computing, Computer Science, Mathematics +7