Tight lower bounds for certain parameterized NP-hard problems

Parameterized Complexity

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

Computing, Computer Science, Mathematics +12

Matrix multiplication via arithmetic progressions

Don Coppersmith, S. Winograd · Journal of Symbolic Computation · 1990 · 2.3K citations

Computing, Computer Science, Mathematics +14

Optimization, approximation, and complexity classes

Christos H. Papadimitriou, Mihalis Yannakakis · Journal of Computer and System Sciences · 1991 · 1.7K citations

Computing, Computer Science, Mathematics +12

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

Vertex packings: Structural properties and algorithms

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

Computing, Computer Science, Combinatorics +8