A Completeness Theory for Polynomial (Turing) Kernelization

Reducibility Among Combinatorial Problems

Kichard Rarp · 2012 · 1.4K citations

Natural Sciences, Computer Science, Mathematics +13

Color-coding

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

Computing, Computer Science, Algorithms +16

Vertex packings: Structural properties and algorithms

G. L. Nemhauser, L. E. Trotter · Mathematical Programming · 1975 · 672 citations

Computing, Computer Science, Combinatorics +8

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

Fixed-parameter tractability of graph modification problems for hereditary properties

Leizhen Cai · Information Processing Letters · 1996 · 375 citations

Computing, Genetics, Formal Methods +8