Michael R Garey

Citata da

	Tutte	Dal 2019
Citazioni	115089	18350
Indice H	60	35
i10-index	86	51

4500

2250

1125

3375

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024555 609 718 837 1077 1330 1337 1463 1721 1901 2019 1967 2215 2275 2216 2238 2395 2639 2830 3287 3744 3893 4342 4071 4243 4131 4163 4479 4470 4230 4137 3931 3519 3642 3415 3305 3224 3125 2909 2372

Coautori

David S. JohnsonVisiting Professor, Columbia University Computer Science DepartmentEmail verificata su research.att.com
E. G. Coffman, Jr.RetiredEmail verificata su cs.columbia.edu
Ronald GrahamProfessor of Mathematics and Computer Science, UC San DiegoEmail verificata su ucsd.edu
Robert TarjanProfessor of Computer Science, Princeton UniversityEmail verificata su cs.princeton.edu
Jeffrey UllmanProfessor of Computer Science, Stanford UniversityEmail verificata su stanford.edu
Christos H PAPADIMITRIOUColumbia UniversityEmail verificata su columbia.edu
Ravi SethiProfessor, Computer Science, The University of ArizonaEmail verificata su email.arizona.edu
Alfred AhoLawrence Gussman Professor of Computer Science, Columbia UniversityEmail verificata su cs.columbia.edu
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityEmail verificata su cs.columbia.edu
Gordon WilfongBell LabsEmail verificata su nokia-bell-labs.com
Costas CourcoubetisProfessor in SDS, CUHK ShenzhenEmail verificata su cuhk.edu.cn

Segui

Michael R Garey

Retired

Nessuna email verificata

Algorithms complexity scheduling theory graph theory


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Computers and intractability MR Garey, DS Johnson freeman, 1979	79776	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	4029	1974
The complexity of flowshop and jobshop scheduling MR Garey, DS Johnson, R Sethi Mathematics of operations research 1 (2), 117-129, 1976	3830	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	2672	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	2115	1984
The Rectilinear Steiner Tree Problem is -Complete MR Garey, DS Johnson SIAM Journal on Applied Mathematics 32 (4), 826-834, 1977	1575	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	1303	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	1109	1972
``strong''np-completeness results: Motivation, examples, and implications MR Garey, DS Johnson Journal of the ACM (JACM) 25 (3), 499-508, 1978	986	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	973	1978
Hilbert's tenth problem IUV Matii︠a︡sevich MIT press, 1993	962	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	727	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	571	1980
Computers and intractability: A guide to the theory of NP-completeness DS Johnson, MR Garey WH Freeman, 1979	569	1979
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	551	1976
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

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori