On the algorithmic complexity of twelve covering and independence parameters of graphs

Paths, Trees, and Flowers

Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text

Natural Sciences, Computer Science, Mathematics +16

Some simplified NP-complete graph problems

M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations

Computing, Computer Science, Mathematics +11

Algorithmic graph theory and perfect graphs

M.J. Rijckaert · Journal of Computational and Applied Mathematics · 1980 · 1.2K citations

Computing, Computer Science, Mathematics +12

The Rectilinear Steiner Tree Problem is $NP$-Complete

M. R. Garey, David S. Johnson · SIAM Journal on Applied Mathematics · 1977 · 1.1K citations

Natural Sciences, Computer Science, Mathematics +12

Approximation algorithms for NP-complete problems on planar graphs

Brenda S. Baker · Journal of the ACM · 1994 · 973 citations · Full text

Computing, Computer Science, Mathematics +15