Book · 1979

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

Michael R. Garey, David S. Johnson

Published 1 January 1979

View at the publisherCite this paper

In brief

“Computers and Intractability: A Guide to the Theory of NP-Completeness” is a 1979 book by Michael R. Garey and David S. Johnson. OpenAlex counts 43,595 citations as of 15 November 2026, which puts it in the top 1% of works published in 1979 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
43,595
Most cited in
2017 (1,305)
Field-weighted impact
37.64
Authors
2

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016529282&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

MLA 9

Garey, Michael R., and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016529282&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Chicago

Garey, Michael R. and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016529282&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Harvard

Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. Available at: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016529282&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

IEEE

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979.

BibTeX

@book{garey1979computers,
  title     = {{Computers and Intractability: A Guide to the Theory of NP-Completeness}},
  author    = {Garey, Michael R. and Johnson, David S.},
  year      = {1979},
  url       = {http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016529282&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
20171,3051305
20181,2821282
20191,1901190
20201,1451145
20211,0951095
2022762762
2023678678
2024517517
2025318318
20261414

Its field-weighted citation impact is 37.64: it has been cited 37.64 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs

  • NP-completeness
  • computational complexity
  • NP-hard problems
  • polynomial-time reduction
  • computational intractability
  • P versus NP

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016529282&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

How many times has this paper been cited?

43,595 times, according to OpenAlex on 15 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Michael R. Garey, David S. Johnson.

Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.