| Computers and intractability MR Garey, DS Johnson freeman, 1979 | 79261 | 1979 |
| Some simplified NP-complete problems MR Garey, DS Johnson, L Stockmeyer Proceedings of the sixth annual ACM symposium on Theory of computing, 47-63, 1974 | 3953 | 1974 |
| The complexity of flowshop and jobshop scheduling MR Garey, DS Johnson, R Sethi Mathematics of operations research 1 (2), 117-129, 1976 | 3775 | 1976 |
| A receptor in pituitary and hypothalamus that functions in growth hormone release AD Howard, SD Feighner, DF Cully, JP Arena, PA Liberator, ... Science 273 (5277), 974-977, 1996 | 2655 | 1996 |
| Approximation algorithms for bin-packing—an updated survey EG Coffman Jr, MR Garey, DS Johnson Algorithm design for computer system design, 49-106, 1984 | 2093 | 1984 |
| The Rectilinear Steiner Tree Problem is -Complete MR Garey, DS Johnson SIAM Journal on Applied Mathematics 32 (4), 826-834, 1977 | 1551 | 1977 |
| Worst-case performance bounds for simple one-dimensional packing algorithms DS Johnson, A Demers, JD Ullman, MR Garey, RL Graham SIAM Journal on computing 3 (4), 299-325, 1974 | 1288 | 1974 |
| Crossing number is NP-complete MR Garey, DS Johnson SIAM Journal on Algebraic Discrete Methods 4 (3), 312-316, 1983 | 1180 | 1983 |
| The transitive reduction of a directed graph AV Aho, MR Garey, JD Ullman SIAM Journal on Computing 1 (2), 131-137, 1972 | 1087 | 1972 |
| ``strong''np-completeness results: Motivation, examples, and implications MR Garey, DS Johnson Journal of the ACM (JACM) 25 (3), 499-508, 1978 | 966 | 1978 |
| An application of bin-packing to multiprocessor scheduling EG Coffman, Jr, MR Garey, DS Johnson SIAM Journal on Computing 7 (1), 1-17, 1978 | 962 | 1978 |
| Hilbert's tenth problem IUV Matii︠a︡sevich MIT press, 1993 | 952 | 1993 |
| The complexity of computing Steiner minimal trees MR Garey, RL Graham, DS Johnson SIAM journal on applied mathematics 32 (4), 835-859, 1977 | 811 | 1977 |
| Complexity results for multiprocessor scheduling under resource constraints MR Garey, DS Johnson SIAM journal on Computing 4 (4), 397-411, 1975 | 736 | 1975 |
| The planar Hamiltonian circuit problem is NP-complete MR Garey, DS Johnson, RE Tarjan SIAM Journal on Computing 5 (4), 704-714, 1976 | 721 | 1976 |
| Performance bounds for level-oriented two-dimensional packing algorithms EG Coffman, Jr, MR Garey, DS Johnson, RE Tarjan SIAM Journal on Computing 9 (4), 808-826, 1980 | 714 | 1980 |
| The complexity of coloring circular arcs and chords MR Garey, DS Johnson, GL Miller, CH Papadimitriou SIAM Journal on Algebraic Discrete Methods 1 (2), 216-227, 1980 | 565 | 1980 |
| Computers and intractability: A guide to the theory of NP-completeness DS Johnson, MR Garey WH Freeman, 1979 | 556 | 1979 |
| The complexity of searching a graph N Megiddo, SL Hakimi, MR Garey, DS Johnson, CH Papadimitriou Journal of the ACM (JACM) 35 (1), 18-44, 1988 | 548 | 1988 |
| Some NP-complete geometric problems MR Garey, RL Graham, DS Johnson Proceedings of the eighth annual ACM symposium on Theory of computing, 10-22, 1976 | 542 | 1976 |
David S. JohnsonVisiting Professor, Columbia University Computer Science Department在 research.att.com 的电子邮件经过验证
