David S. Johnson

Approximation algorithms for combinatorial problems

David S. Johnson · Journal of Computer and System Sciences · 1974 · 2.2K citations

Natural Sciences, Computer Science, Mathematics +12

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

Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning

David S. Johnson, C. Aragon, Lyle A. McGeoch et al. · Operations Research · 1989 · 1.5K citations

Computing, Computer Science, Algorithms +13

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

Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

David S. Johnson, C. Aragon, Lyle A. McGeoch et al. · Operations Research · 1991 · 844 citations

Natural Sciences, Computer Science, Mathematics +16