Journal article · 1982

The NP-completeness column: An ongoing gulde

David S. Johnson

Journal of Algorithms, 3(4), 381–395 · Published 1 December 1982 · DOI 10.1016/0196-6774(82)90032-3

View at the publisherCite this paper

In brief

“The NP-completeness column: An ongoing gulde” is a 1982 journal article by David S. Johnson, published in Journal of Algorithms. OpenAlex counts 30 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
30
Most cited in
2023 (3)
Field-weighted impact
3.37
References
32
Authors
1

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. (1982). The NP-completeness column: An ongoing gulde. Journal of Algorithms, 3(4), 381–395. https://doi.org/10.1016/0196-6774(82)90032-3

MLA 9

Johnson, David S. “The NP-completeness column: An ongoing gulde.” Journal of Algorithms, vol. 3, no. 4, 1982, pp. 381–395. https://doi.org/10.1016/0196-6774(82)90032-3.

Chicago

Johnson, David S. 1982. “The NP-completeness column: An ongoing gulde.” Journal of Algorithms 3 (4): 381–395. https://doi.org/10.1016/0196-6774(82)90032-3.

Harvard

Johnson, D. S. (1982) ‘The NP-completeness column: An ongoing gulde’, Journal of Algorithms, 3(4), pp. 381–395. doi:10.1016/0196-6774(82)90032-3.

IEEE

D. S. Johnson, “The NP-completeness column: An ongoing gulde,” Journal of Algorithms, vol. 3, no. 4, pp. 381–395, 1982, doi: 10.1016/0196-6774(82)90032-3.

BibTeX

@article{johnson1982completeness,
  title     = {{The NP-completeness column: An ongoing gulde}},
  author    = {Johnson, David S.},
  journal   = {Journal of Algorithms},
  year      = {1982},
  volume    = {3},
  number    = {4},
  pages     = {381--395},
  doi       = {10.1016/0196-6774(82)90032-3},
  url       = {https://doi.org/10.1016/0196-6774(82)90032-3}
}

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

Citations by year

YearCitationsShare of the best year
201522
201611
201811
201911
202333
202511

Its field-weighted citation impact is 3.37: it has been cited 3.37 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
  • NP-hardness
  • PSPACE-hardness
  • polynomial-time solvability
  • computational intractability
  • open problems
  • computational complexity

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. (1982). The NP-completeness column: An ongoing gulde. Journal of Algorithms, 3(4), 381–395. https://doi.org/10.1016/0196-6774(82)90032-3

How many times has this paper been cited?

30 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.1016/0196-6774(82)90032-3. The permanent link is https://doi.org/10.1016/0196-6774(82)90032-3.

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.