Journal article · 2007

The NP-completeness column: Finding needles in haystacks

David S. Johnson

ACM Transactions on Algorithms, 3(2), 24 · Published 1 May 2007 · DOI 10.1145/1240233.1240247

View at the publisherCite this paper

In brief

“The NP-completeness column: Finding needles in haystacks” is a 2007 journal article by David S. Johnson, published in ACM Transactions on Algorithms. OpenAlex counts 25 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
25
Most cited in
2024 (2)
Field-weighted impact
3.29
References
76
Authors
1

Abstract

This is the 26th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled on that which M. R. Garey and I used in our book “Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., New York, 1979, hereinafter referred to as… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

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

APA 7

Johnson, D. S. (2007). The NP-completeness column: Finding needles in haystacks. ACM Transactions on Algorithms, 3(2), 24. https://doi.org/10.1145/1240233.1240247

MLA 9

Johnson, David S. “The NP-completeness column: Finding needles in haystacks.” ACM Transactions on Algorithms, vol. 3, no. 2, 2007, p. 24. https://doi.org/10.1145/1240233.1240247.

Chicago

Johnson, David S. 2007. “The NP-completeness column: Finding needles in haystacks.” ACM Transactions on Algorithms 3 (2): 24. https://doi.org/10.1145/1240233.1240247.

Harvard

Johnson, D. S. (2007) ‘The NP-completeness column: Finding needles in haystacks’, ACM Transactions on Algorithms, 3(2), p. 24. doi:10.1145/1240233.1240247.

IEEE

D. S. Johnson, “The NP-completeness column: Finding needles in haystacks,” ACM Transactions on Algorithms, vol. 3, no. 2, p. 24, 2007, doi: 10.1145/1240233.1240247.

BibTeX

@article{johnson2007completeness,
  title     = {{The NP-completeness column: Finding needles in haystacks}},
  author    = {Johnson, David S.},
  journal   = {ACM Transactions on Algorithms},
  year      = {2007},
  volume    = {3},
  number    = {2},
  pages     = {24},
  doi       = {10.1145/1240233.1240247},
  url       = {https://doi.org/10.1145/1240233.1240247}
}

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

Citations by year

YearCitationsShare of the best year
201611
201711
201811
201911
202011
202111
202211
202422
202511
202611

Its field-weighted citation impact is 3.29: it has been cited 3.29 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 hardness
  • existence of solutions
  • search problems
  • computational intractability

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?

Johnson, D. S. (2007). The NP-completeness column: Finding needles in haystacks. ACM Transactions on Algorithms, 3(2), 24. https://doi.org/10.1145/1240233.1240247

How many times has this paper been cited?

25 times, according to OpenAlex on 16 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?

David S. Johnson.

What is the DOI of this paper?

10.1145/1240233.1240247. The permanent link is https://doi.org/10.1145/1240233.1240247.

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