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

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