- Home
- Best Scientists - Computer Science
- Michael Randolph Garey

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
58
Citations
123,709
84
World Ranking
2311
National Ranking
1240

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

- Algorithm
- Combinatorics
- Graph theory

Michael Randolph Garey mainly focuses on Combinatorics, Calculus, Completeness, Discrete mathematics and Algorithm. Michael Randolph Garey has included themes like Embedding and Planar in his Combinatorics study. Completeness is often connected to Theoretical computer science in his work.

His Discrete mathematics research includes elements of Tree and Net. The Square packing in a square, Bin and Bin packing problem research he does as part of his general Algorithm study is frequently linked to other disciplines of science, such as Complete and Karp's 21 NP-complete problems, therefore creating a link between diverse domains of science. His Square packing in a square research is multidisciplinary, incorporating elements of Computation and Real number.

- Computers and Intractability: A Guide to the Theory of NP-Completeness (37665 citations)
- Johnson: computers and intractability: a guide to the theory of np- completeness (freeman (11975 citations)
- Computers and Intractability: A Guide to the Theory of NP-Completeness (3550 citations)

His scientific interests lie mostly in Combinatorics, Discrete mathematics, Bin packing problem, Algorithm and Mathematical optimization. In his work, Theoretical computer science is strongly intertwined with Approximation algorithm, which is a subfield of Bin packing problem. His Algorithm study integrates concerns from other disciplines, such as Completeness, Binary number and Heuristic.

In his study, Computational complexity theory is strongly linked to Time complexity, which falls under the umbrella field of Mathematical optimization. He studied Greedy coloring and Fractional coloring that intersect with List coloring and Complete coloring. As a part of the same scientific family, Michael Randolph Garey mostly works in the field of Hamiltonian path problem, focusing on Planar graph and, on occasion, Vertex cover.

- Combinatorics (48.89%)
- Discrete mathematics (36.67%)
- Bin packing problem (16.67%)

- Discrete mathematics (36.67%)
- Bin packing problem (16.67%)
- Combinatorics (48.89%)

His primary areas of investigation include Discrete mathematics, Bin packing problem, Combinatorics, Completeness and Calculus. His Discrete mathematics study combines topics from a wide range of disciplines, such as Reachability and Applied mathematics. His Bin packing problem study incorporates themes from Space, General theorem, Approximation algorithm and Constant.

He has researched Approximation algorithm in several fields, including Randomized algorithm and Interval. In the subject of general Combinatorics, his work in Hypergraph, Covering number, Integer and Line graph is often linked to Distribution, thereby combining diverse domains of study. His Square packing in a square research is included under the broader classification of Algorithm.

- Computers and Intractability: A Guide to the Theory of NP-Completeness (3550 citations)
- Approximation algorithms for bin packing: a survey (783 citations)
- Computers and Intractability: A Guide to the Theory of NP - Completeness (460 citations)

- Algorithm
- Graph theory
- Discrete mathematics

Michael Randolph Garey mostly deals with Completeness, Calculus, Discrete mathematics, Best bin first and Square packing in a square. His Discrete mathematics study focuses mostly on Line graph, Graph product, Graph power, 1-planar graph and Graph toughness. His Best bin first investigation overlaps with other areas such as Approximation algorithm, Bin packing problem, Bin and Algorithm.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

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

Michael R. Garey;David S. Johnson.

**(1979)**

58462 Citations

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

Michael R. Garey;David S. Johnson.

**(1979)**

58462 Citations

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

Michael Randolph Garey.

**(1979)**

20685 Citations

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

Michael Randolph Garey.

**(1979)**

20685 Citations

A guide to the theory of np-completeness

Michael Randolph Garey;David S. Johnson.

**(1978)**

7168 Citations

A guide to the theory of np-completeness

Michael Randolph Garey;David S. Johnson.

**(1978)**

7168 Citations

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

Michael Randolph Garey;D. S. Johanson.

AE **(1999)**

6212 Citations

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

Michael Randolph Garey;D. S. Johanson.

AE **(1999)**

6212 Citations

Some simplified NP-complete problems

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

symposium on the theory of computing **(1974)**

3510 Citations

Some simplified NP-complete problems

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

symposium on the theory of computing **(1974)**

3510 Citations

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

Contact us

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:

AT&T (United States)

Columbia University

University of California, San Diego

Princeton University

Stanford University

Columbia University

Columbia University

MIT

University of California, San Diego

University of Cambridge

University of Sharjah

City University of Hong Kong

University of Verona

Foundation for Research and Technology Hellas

Arizona State University

Radboud University Nijmegen

Université Savoie Mont Blanc

University of the West Indies

Aarhus University

Cardiff University

Washington University in St. Louis

Cold Regions Research and Engineering Laboratory

University of Amsterdam

Centers for Disease Control and Prevention

The Oncology Group

University of Cambridge

Something went wrong. Please try again later.