Michael R Garey

Cited by

	All	Since 2019
Citations	114988	18277
h-index	60	35
i10-index	86	51

4500

2250

1125

3375

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024556 609 718 837 1078 1329 1338 1463 1721 1902 2018 1969 2214 2274 2214 2239 2394 2638 2830 3287 3744 3894 4342 4069 4241 4132 4159 4481 4469 4229 4136 3928 3515 3643 3414 3300 3230 3123 2902 2308

Co-authors

David S. JohnsonVisiting Professor, Columbia University Computer Science DepartmentVerified email at research.att.com
E. G. Coffman, Jr.RetiredVerified email at cs.columbia.edu
Ronald GrahamProfessor of Mathematics and Computer Science, UC San DiegoVerified email at ucsd.edu
Robert TarjanProfessor of Computer Science, Princeton UniversityVerified email at cs.princeton.edu
Jeffrey UllmanProfessor of Computer Science, Stanford UniversityVerified email at stanford.edu
Christos H PAPADIMITRIOUColumbia UniversityVerified email at columbia.edu
Ravi SethiProfessor, Computer Science, The University of ArizonaVerified email at email.arizona.edu
Alfred AhoLawrence Gussman Professor of Computer Science, Columbia UniversityVerified email at cs.columbia.edu
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityVerified email at cs.columbia.edu
Gordon WilfongBell LabsVerified email at nokia-bell-labs.com
Costas CourcoubetisProfessor in SDS, CUHK ShenzhenVerified email at cuhk.edu.cn

Michael R Garey

Retired

No verified email

Algorithms complexity scheduling theory graph theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Computers and intractability MR Garey, DS Johnson freeman, 1979	79727	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	4020	1974
The complexity of flowshop and jobshop scheduling MR Garey, DS Johnson, R Sethi Mathematics of operations research 1 (2), 117-129, 1976	3825	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	2670	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	2109	1984
The Rectilinear Steiner Tree Problem is -Complete MR Garey, DS Johnson SIAM Journal on Applied Mathematics 32 (4), 826-834, 1977	1573	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	1301	1974
Crossing number is NP-complete MR Garey, DS Johnson SIAM Journal on Algebraic Discrete Methods 4 (3), 312-316, 1983	1201	1983
The transitive reduction of a directed graph AV Aho, MR Garey, JD Ullman SIAM Journal on Computing 1 (2), 131-137, 1972	1108	1972
``strong''np-completeness results: Motivation, examples, and implications MR Garey, DS Johnson Journal of the ACM (JACM) 25 (3), 499-508, 1978	983	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	971	1978
Hilbert's tenth problem IUV Matii︠a︡sevich MIT press, 1993	960	1993
The complexity of computing Steiner minimal trees MR Garey, RL Graham, DS Johnson SIAM journal on applied mathematics 32 (4), 835-859, 1977	817	1977
Complexity results for multiprocessor scheduling under resource constraints MR Garey, DS Johnson SIAM journal on Computing 4 (4), 397-411, 1975	742	1975
The planar Hamiltonian circuit problem is NP-complete MR Garey, DS Johnson, RE Tarjan SIAM Journal on Computing 5 (4), 704-714, 1976	726	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	723	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	570	1980
Computers and intractability: A guide to the theory of NP-completeness DS Johnson, MR Garey WH Freeman, 1979	569	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	549	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	549	1976

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors