M. R. Garey
- Computer Networks and Communications top 0.01%
- Industrial and Manufacturing Engineering top 0.01%
- Computational Theory and Mathematics top 0.01%
- Artificial Intelligence top 0.05%
- Electrical and Electronic Engineering top 0.2%
- Co-authors
- David S. JohnsonDavid JohnsonRavi SethiLarry StockmeyerE. G. CoffmanRobert E. TarjanD. S. JohnsonJeffrey D. Ullman
- Topics
- Optimization and Search Problems (27 papers)Scheduling and Optimization Algorithms (25 papers)Optimization and Packing Problems (17 papers)
- Cited by
- Industrial and Manufacturing EngineeringComputer Graphics and Computer-Aided DesignComputer Networks and Communications
- Journals
- Journal of the American Statistical AssociationIEEE Transactions on Information TheoryIEEE Transactions on Communications
- Partner nations
- United StatesIsraelGermany
In The Last Decade
M. R. Garey
76 papers receiving 37.3k citations
Hit Papers
Peers
Comparison fields: 5 of 187
- Computer Networks and Communications 16.2k
- Industrial and Manufacturing Engineering 12.3k
- Computational Theory and Mathematics 11.2k
- Artificial Intelligence 7.7k
- Electrical and Electronic Engineering 7.0k
Countries citing papers authored by M. R. Garey
This map shows the geographic impact of M. R. Garey's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by M. R. Garey with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites M. R. Garey more than expected).
Fields of papers citing papers by M. R. Garey
This network shows the impact of papers produced by M. R. Garey. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by M. R. Garey. The network helps show where M. R. Garey may publish in the future.
Co-authorship network of co-authors of M. R. Garey
This figure shows the co-authorship network connecting the top 25 collaborators of M. R. Garey. A scholar is included among the top collaborators of M. R. Garey based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with M. R. Garey. M. R. Garey is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 13 | |
| 2 | Approximation algorithms for bin packing: a surveybreakdown → | 589 |
| 3 | 56 | |
| 4 | 3 | |
| 5 | 60 | |
| 6 | 49 | |
| 7 | 1 | |
| 8 | 133 | |
| 9 | The Complexity of Searching a Graph (Preliminary Version) | 9 |
| 10 | 135 | |
| 11 | 155 | |
| 12 | Some simplified NP-complete graph problemsbreakdown → | 1246 |
| 13 | 218 | |
| 14 | 94 | |
| 15 | 71 | |
| 16 | 31 | |
| 17 | 29 | |
| 18 | 64 | |
| 19 | 7 | |
| 20 | 9 |
About M. R. Garey
M. R. Garey is a scholar working on Industrial and Manufacturing Engineering, Computer Graphics and Computer-Aided Design and Discrete Mathematics and Combinatorics, having authored 77 papers that have together received 40.7k indexed citations. Recurring topics across this work include Optimization and Search Problems (27 papers), Scheduling and Optimization Algorithms (25 papers) and Optimization and Packing Problems (17 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (12.3k citations), Computer Graphics and Computer-Aided Design (2.7k citations) and Computer Networks and Communications (16.2k citations). M. R. Garey has collaborated with scholars based in United States, Israel and Germany. Frequent co-authors include David S. Johnson, David Johnson, Ravi Sethi, Larry Stockmeyer, E. G. Coffman, Robert E. Tarjan, D. S. Johnson, Jeffrey D. Ullman, Ron Graham and Ronald Graham. Their work appears in journals such as Journal of the American Statistical Association, IEEE Transactions on Information Theory and IEEE Transactions on Communications.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.