Michael R Garey

Alıntı yapanlar

	Hepsi	2019 yılından bugüne
Alıntılar	114920	17203
h-endeksi	61	34
i10-endeksi	87	52

4600

2300

1150

3450

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024570 611 728 834 1082 1345 1327 1481 1724 1922 2042 1998 2245 2299 2221 2262 2414 2667 2850 3318 3768 3925 4362 4106 4273 4189 4170 4499 4535 4301 4201 3991 3632 3714 3476 3367 3266 3167 3016 911

Katkıda bulunan yazarlar

David S. JohnsonVisiting Professor, Columbia University Computer Science Departmentresearch.att.com üzerinde doğrulanmış e-posta adresine sahip
Ronald GrahamProfessor of Mathematics and Computer Science, UC San Diegoucsd.edu üzerinde doğrulanmış e-posta adresine sahip
E. G. Coffman, Jr.Retiredcs.columbia.edu üzerinde doğrulanmış e-posta adresine sahip
Robert TarjanProfessor of Computer Science, Princeton Universitycs.princeton.edu üzerinde doğrulanmış e-posta adresine sahip
Jeffrey UllmanProfessor of Computer Science, Stanford Universitystanford.edu üzerinde doğrulanmış e-posta adresine sahip
Christos H PAPADIMITRIOUColumbia Universitycolumbia.edu üzerinde doğrulanmış e-posta adresine sahip
Ravi SethiProfessor, Computer Science, The University of Arizonaemail.arizona.edu üzerinde doğrulanmış e-posta adresine sahip
Alfred AhoLawrence Gussman Professor of Computer Science, Columbia Universitycs.columbia.edu üzerinde doğrulanmış e-posta adresine sahip
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia Universitycs.columbia.edu üzerinde doğrulanmış e-posta adresine sahip
Gordon WilfongBell Labsnokia-bell-labs.com üzerinde doğrulanmış e-posta adresine sahip
Costas CourcoubetisProfessor in SDS, CUHK Shenzhencuhk.edu.cn üzerinde doğrulanmış e-posta adresine sahip

Takip et

Michael R Garey

Retired

Doğrulanmış e-posta adresi yok

Algorithms complexity scheduling theory graph theory


Başlık Alıntılara göre sırala Yıla göre sırala Başlığa göre sırala	Alıntı yapanlar Alıntı yapanlar	Yıl
Computers and intractability MR Garey, DS Johnson freeman, 1979	80005	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	3906	1974
The complexity of flowshop and jobshop scheduling MR Garey, DS Johnson, R Sethi Mathematics of operations research 1 (2), 117-129, 1976	3740	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	2651	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	2091	1984
The Rectilinear Steiner Tree Problem is -Complete MR Garey, DS Johnson SIAM Journal on Applied Mathematics 32 (4), 826-834, 1977	1529	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	1286	1974
Crossing number is NP-complete MR Garey, DS Johnson SIAM Journal on Algebraic Discrete Methods 4 (3), 312-316, 1983	1163	1983
The transitive reduction of a directed graph AV Aho, MR Garey, JD Ullman SIAM Journal on Computing 1 (2), 131-137, 1972	1080	1972
Hilbert's tenth problem IUV Matii︠a︡sevich MIT press, 1993	954	1993
An application of bin-packing to multiprocessor scheduling EG Coffman, Jr, MR Garey, DS Johnson SIAM Journal on Computing 7 (1), 1-17, 1978	950	1978
``strong''np-completeness results: Motivation, examples, and implications MR Garey, DS Johnson Journal of the ACM (JACM) 25 (3), 499-508, 1978	948	1978
The complexity of computing Steiner minimal trees MR Garey, RL Graham, DS Johnson SIAM journal on applied mathematics 32 (4), 835-859, 1977	803	1977
Complexity results for multiprocessor scheduling under resource constraints MR Garey, DS Johnson SIAM journal on Computing 4 (4), 397-411, 1975	728	1975
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	711	1980
The planar Hamiltonian circuit problem is NP-complete MR Garey, DS Johnson, RE Tarjan SIAM Journal on Computing 5 (4), 704-714, 1976	710	1976
Computers and intractability: A guide to the theory of NP-completeness DS Johnson, MR Garey WH Freeman, 1979	567	1979
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	563	1980
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	540	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	536	1976

Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.

Makaleler 1–20

Yıllık alıntı sayısı

Mükerrer alıntılar

Birleştirilmiş alıntılar

Katkıda bulunan yazar ekleKatkıda bulunan yazarlar

Takip et

Alıntı yapanlar

Katkıda bulunan yazarlar