World's Best Scientists 2026 revealed!
Michael Randolph Garey

Michael Randolph Garey

D-Index & Metrics

Computer Science

D-Index
64
Citations
128644
World Ranking
2503
National Ranking
1247

Michael Randolph Garey publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Michael Randolph Garey sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 250 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 560 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 424 scientists 242–251 publications: 408 scientists 252–261 publications: 378 scientists 262–271 publications: 300 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 97 publications — 8th percentile

8% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Michael Randolph Garey D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Michael Randolph Garey sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 984 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 969 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 765 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 517 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 64 D-Index — 82nd percentile

82% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Research.com Recognitions

  • 1995 - ACM Fellow For fundamental contributions to the theory of complexity and algorithms and for outstanding service to ACM.

Overview

Michael Randolph Garey is affiliated with Nokia in the United States. Their professional work focuses on areas related to computational theory and algorithms.

In 1995, Garey was recognized as an ACM Fellow for fundamental contributions to the theory of complexity and algorithms as well as for outstanding service to the Association for Computing Machinery (ACM).

While detailed records of published research papers, coauthors, specific fields of study, and topics are not available, this scientist's work has a clear association with complexity theory and algorithm design based on the award citation.

This recognition situates Garey within the domain of computer science, particularly in theoretical aspects that underpin computational processes and algorithmic problem-solving.

Best Publications

  • Computers and Intractability: A Guide to the Theory of NP-Completeness

    Michael R. Garey;David S. Johnson

  • Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

    Michael Randolph Garey

  • A guide to the theory of np-completeness

    Michael Randolph Garey;David S. Johnson

  • Computers and Intractability: A Guide to the Theory of NP-Completeness

    Michael Randolph Garey;D. S. Johanson

  • The Complexity of Flowshop and Jobshop Scheduling

    M. R. Garey;D. S. Johnson;Ravi Sethi

  • Some simplified NP-complete problems

    M. R. Garey;D. S. Johnson;L. Stockmeyer

  • Some simplified NP-complete graph problems

    M. R. Garey;David S. Johnson;Larry J. Stockmeyer

  • The Rectilinear Steiner Tree Problem is $NP$-Complete

    M. R. Garey;David S. Johnson

  • Approximation algorithms for bin packing: a survey

    E. G. Coffman;M. R. Garey;D. S. Johnson

  • Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

    David S. Johnson;Alan J. Demers;Jeffrey D. Ullman;M. R. Garey

  • Crossing Number is NP-Complete

    M. R. Garey;D. S. Johnson

  • The Transitive Reduction of a Directed Graph

    Alfred V. Aho;M. R. Garey;Jeffrey D. Ullman

  • An Application of Bin-Packing to Multiprocessor Scheduling

    Edward G. Coffman;M. R. Garey;David S. Johnson

  • `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

    M. R. Garey;D. S. Johnson

  • Johnson: Computers and Intractability-A Guide to the Theory of NP-Completeness

    M. p. h. R. Gary

  • The Complexity of Computing Steiner Minimal Trees

    M. R. Garey;R. L. Graham;D. S. Johnson

  • Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran

    Michael Randolph Garey;David S. Johnson

  • The Planar Hamiltonian Circuit Problem is NP-Complete

    M. R. Garey;D. S. Johnson;R. Endre Tarjan

  • Complexity results for multiprocessor scheduling under resource constraints

    M. R. Garey;D. S. Johnson

  • Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

    Edward G. Coffman;M. R. Garey;David S. Johnson;Robert Endre Tarjan

  • Approximation Algorithms for Bin-Packing — An Updated Survey

    E. G. Coffman;M. R. Garey;D. S. Johnson

Frequent Co-Authors

David S. Johnson
David S. Johnson AT&T (United States)
Edward G. Coffman
Edward G. Coffman Columbia University
Ron Graham
Ron Graham University of California, San Diego
Robert E. Tarjan
Robert E. Tarjan Princeton University
Mihalis Yannakakis
Mihalis Yannakakis Columbia University
Jeffrey D. Ullman
Jeffrey D. Ullman Stanford University
Costas Courcoubetis
Costas Courcoubetis Chinese University of Hong Kong, Shenzhen
Fan Chung
Fan Chung University of California, San Diego
Richard Weber
Richard Weber University of Cambridge

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science opens doors to a range of related online degrees and career opportunities. Many students look for cost-effective ways to advance their education in specialized fields that complement computer science or offer alternative career pathways.

For those interested in cybersecurity, cybersecurity online degrees provide a solid foundation for protecting digital systems and data, a skill in high demand worldwide. Similarly, students seeking roles in construction technology can benefit from the cheapest online construction management degree programs, preparing them for tech-driven project management careers.

Budget-conscious learners often compare tuition and value. If you're considering criminal justice or accounting, reviewing criminal justice degree price details and searching for an accounting degree online cheap can help you plan a path that’s affordable yet rigorous.

Whichever direction you choose, online degrees offer flexibility and the ability to gain credentials recognized by employers—supporting careers across technology, law, finance, and engineering disciplines.

Best Scientists Citing Michael Randolph Garey

Recently Published Articles