What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (48.89%)
- Discrete mathematics (36.67%)
- Bin packing problem (16.67%)
What were the highlights of his more recent work (between 1986-2002)?
- Discrete mathematics (36.67%)
- Bin packing problem (16.67%)
- Combinatorics (48.89%)
In recent papers he was focusing on the following fields of study:
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.
Between 1986 and 2002, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
