Approximability results for the maximum and minimum maximal induced matching problems

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

Computing, Computer Science, Mathematics +17

Graph Theory with Applications

E. Kay, J. A. Bondy, U. S. R. Murty · Operational Research Quarterly (1970-1977) · 1977 · 3K citations

Computing, Computer Science, Mathematics +12

Clique is hard to approximate within n1−ε

Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text

Computing, Computer Science, Algorithms +3

Complexity and approximation: Combinatorial optimization problems and their approximability properties

Computers & Mathematics with Applications · 2000 · 1.3K citations

Computing, Computer Science, Mathematics +13

The Theory of Graphs and Its Applications

Elizna Burger, Claude Berge, Alison Doig · Econometrica · 1965 · 913 citations

Natural Sciences, Mathematics, Combinatorics +6