Linear CNF formulas and satisfiability

Parameterized Complexity

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

Computing, Computer Science, Mathematics +12

On Representatives of Subsets

P. Hall · Journal of the London Mathematical Society · 1935 · 2K citations

Natural Sciences, Mathematics, Set Theory +4

Determining computational complexity from characteristic ‘phase transitions’

Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick et al. · Nature · 1999 · 803 citations

Natural Sciences, Computer Science, Physics +14

A simplified NP-complete satisfiability problem

Craig A. Tovey · Discrete Applied Mathematics · 1984 · 382 citations

Computing, Computer Science, Mathematics +6

An O (N2.5) algorithm for maximum matching in general graphs

Shimon Even, Oded Kariv · 1975 · 296 citations

Computing, Computer Science, Algorithms +9