litlas
Log inCreate account

M. R. Garey

Active 1972–2002

65
Papers
60,756
Citations
45
h-index
58
i10-index

Citations

Citations per year for M. R. Garey1930: 1 citations1972: 3 citations1973: 2 citations1974: 10 citations1975: 21 citations1976: 30 citations1977: 54 citations1978: 84 citations1979: 88 citations1980: 163 citations1981: 149 citations1982: 184 citations1983: 200 citations1984: 228 citations1985: 222 citations1986: 251 citations1987: 254 citations1988: 321 citations1989: 389 citations1990: 498 citations1991: 463 citations1992: 555 citations1993: 636 citations1994: 705 citations1995: 723 citations1996: 695 citations1997: 784 citations1998: 821 citations1999: 836 citations2000: 820 citations2001: 859 citations2002: 1,066 citations2003: 1,151 citations2004: 1,247 citations2005: 1,447 citations2006: 1,505 citations2007: 1,530 citations2008: 1,579 citations2009: 1,547 citations2010: 1,589 citations2011: 1,684 citations2012: 1,536 citations2013: 1,633 citations2014: 1,603 citations2015: 1,585 citations2016: 1,374 citations2017: 1,221 citations2018: 1,246 citations2019: 1,237 citations2020: 1,186 citations2021: 1,150 citations2022: 856 citations2023: 672 citations2024: 635 citations2025: 380 citations2026: 86 citations1931–1971: no citations, so these years are not shown

Citation sources

Countries

World map of the countries and regions citing this authorUnited States: 12,575 citing papers, 25.5% of this breakdownGermany: 3,881 citing papers, 7.9% of this breakdownChina: 3,550 citing papers, 7.2% of this breakdownFrance: 3,033 citing papers, 6.1% of this breakdownCanada: 2,387 citing papers, 4.8% of this breakdownUnited Kingdom: 2,098 citing papers, 4.3% of this breakdownItaly: 1,800 citing papers, 3.6% of this breakdownJapan: 1,497 citing papers, 3% of this breakdownIsrael: 1,339 citing papers, 2.7% of this breakdownIndia: 1,166 citing papers, 2.4% of this breakdownNetherlands: 1,160 citing papers, 2.4% of this breakdownTaiwan: 1,025 citing papers, 2.1% of this breakdown
0%25.5%Other 28%

Institutions

Fields

  • Computer Science62.4%
  • Engineering23.8%
  • Decision Sciences3%
  • Biochemistry, Genetics and Molecular Biology3%
  • Mathematics1.7%
  • Physics and Astronomy1.5%
  • Other4.6%

Topics

  • Advanced Graph Theory Research5.9%
  • Complexity and Algorithms in Graphs4.6%
  • Optimization and Search Problems4.2%
  • Scheduling and Optimization Algorithms3.2%
  • Optimization and Packing Problems3%
  • Interconnection Networks and Systems2.6%
  • Other76.5%

Coauthors

All papers

Open in search
  1. Computers and Intractability: A Guide to the Theory of NP-Completeness

    Authors: M. R. Garey, David S. Johnson - FM 1979 cited by 44,611

  2. Some Simplified NP-Complete Graph Problems

    Authors: M. R. Garey, David S. Johnson, Larry J. Stockmeyer - Theoretical Computer Science, Theor. Comput. Sci. 1976 cited by 2,068

  3. "Strong" NP-Completeness Results: Motivation, Examples, and Implications

    Authors: M. R. Garey, David Johnson - Journal of the ACM, J. ACM 1978 cited by 657

  4. Some Simplified NP-Complete Problems

    Authors: M. R. Garey, David S. Johnson, Larry J. Stockmeyer - sixth annual ACM symposium on Theory of computing - STOC '74 1974 cited by 603

  5. The Rectilinear Steiner Tree Problem is NP Complete

    Authors: M. R. Garey, David S. Johnson - SIAM Journal on Applied Mathematics, SIAM Journal of Applied Mathematics 1977 cited by 1,123

  6. The Transitive Reduction of a Directed Graph

    Authors: Alfred V. Aho, M. R. Garey, Jeffrey D. Ullman - SIAM Journal on Computing, SIAM J. Comput. 1972 cited by 723

  7. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

    Authors: David S. Johnson, Alan J. Demers, Jeffrey D. Ullman, M. R. Garey, Ronald L. Graham - SIAM Journal on Computing, SIAM J. Comput. 1974 cited by 913

  8. The Planar Hamiltonian Circuit Problem is NP-Complete

    Authors: M. R. Garey, David S. Johnson, Robert Endre Tarjan - SIAM Journal on Computing, SIAM J. Comput. 1976 cited by 529

  9. The Complexity of Near-Optimal Graph Coloring

    Authors: M. R. Garey, David S. Johnson - Journal of the ACM, J. ACM 1976 cited by 326

  10. An Application of Bin-Packing to Multiprocessor Scheduling

    Authors: E. G. Coffman, M. R. Garey, David S. Johnson - SIAM Journal on Computing, SIAM J. Comput. 1978 cited by 660

  11. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

    Authors: E. G. Coffman, M. R. Garey, David S. Johnson, Robert E. Tarjan - SIAM Journal on Computing, SIAM J. Comput. 1980 cited by 478

  12. Resource Constrained Scheduling as Generalized Bin Packing

    Authors: M. R. Garey, Ronald L. Graham, David S. Johnson, Andrew Chi-Chih Yao - Journal of Combinatorial Theory Series A, J. Comb. Theory A 1976 cited by 346

  13. Crossing Number is NP-Complete

    Authors: M. R. Garey, David S. Johnson - SIAM Journal on Algebraic and Discrete Methods 1983 cited by 669

  14. The Complexity of Computing Steiner Minimal Trees

    Authors: M. R. Garey, Ronald Graham, David S. Johnson - SIAM Journal on Applied Mathematics 1977 cited by 575

  15. Complexity Results for Bandwidth Minimization

    Authors: M. R. Garey, Ronald Graham, David S. Johnson, D. E. Knuth - SIAM Journal on Applied Mathematics 1978 cited by 296

  16. Dynamic Bin Packing

    Authors: E. G. Coffman, M. R. Garey, David S. Johnson - SIAM Journal on Computing, SIAM J. Comput. 1983 cited by 167

  17. The Complexity of Coloring Circular Arcs and Chords

    Authors: M. R. Garey, David S. Johnson, Gerald L. Miller, Christos H. Papadimitriou - SIAM Journal on Algebraic and Discrete Methods, SIAM J. Algebraic Discret. Methods 1980 cited by 391

  18. Bounds for Multiprocessor Scheduling with Resource Constraints

    Authors: M. R. Garey, Ronald L. Graham - SIAM Journal on Computing, SIAM J. Comput. 1975 cited by 244

  19. Approximation algorithms for bin packing: a survey

    Authors: E. G. Coffman, M. R. Garey, David S. Johnson - PWS Publishing Co. eBooks 1996 cited by 855

  20. Approximation Algorithms for Bin-Packing — An Updated Survey

    Authors: E. G. Coffman, M. R. Garey, David Johnson - Courses and lectures 1984 cited by 424

  21. Worst-Case Analysis of Memory Allocation Algorithms

    Authors: M. R. Garey, Ronald L. Graham, Jeffrey D. Ullman - fourth annual ACM symposium on Theory of computing - STOC '72 1972 cited by 182

  22. Complexity Results for Multiprocessor Scheduling under Resource Constraints

    Authors: M. R. Garey, David S. Johnson - SIAM Journal on Computing, SIAM J. Comput. 1975 cited by 30

  23. Two-Processor Scheduling with Start-Times and Deadlines

    Authors: M. R. Garey, David S. Johnson - SIAM Journal on Computing, SIAM J. Comput. 1977 cited by 237

  24. Some NP-Complete Geometric Problems

    Authors: M. R. Garey, Ronald L. Graham, David S. Johnson - eighth annual ACM symposium on Theory of computing - STOC '76 1976 cited by 396