Journal article · 1985
The NP-completeness column: an ongoing guide
Journal of Algorithms, 6(3), 434–451 · Published 1 September 1985 · DOI 10.1016/0196-6774(85)90012-4
In brief
“The NP-completeness column: an ongoing guide” is a 1985 journal article by David S Johnson, published in Journal of Algorithms. OpenAlex counts 248 citations as of 16 November 2026, which puts it in the top 5% of works published in 1985 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 248
- Most cited in
- 2021 (12)
- Field-weighted impact
- 7.38
- References
- 66
- 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. (1985). The NP-completeness column: an ongoing guide. Journal of Algorithms, 6(3), 434–451. https://doi.org/10.1016/0196-6774(85)90012-4
MLA 9
Johnson, David S. “The NP-completeness column: an ongoing guide.” Journal of Algorithms, vol. 6, no. 3, 1985, pp. 434–451. https://doi.org/10.1016/0196-6774(85)90012-4.
Chicago
Johnson, David S. 1985. “The NP-completeness column: an ongoing guide.” Journal of Algorithms 6 (3): 434–451. https://doi.org/10.1016/0196-6774(85)90012-4.
Harvard
Johnson, D. S. (1985) ‘The NP-completeness column: an ongoing guide’, Journal of Algorithms, 6(3), pp. 434–451. doi:10.1016/0196-6774(85)90012-4.
IEEE
D. S. Johnson, “The NP-completeness column: an ongoing guide,” Journal of Algorithms, vol. 6, no. 3, pp. 434–451, 1985, doi: 10.1016/0196-6774(85)90012-4.
BibTeX
@article{johnson1985completeness,
title = {{The NP-completeness column: an ongoing guide}},
author = {Johnson, David S},
journal = {Journal of Algorithms},
year = {1985},
volume = {6},
number = {3},
pages = {434--451},
doi = {10.1016/0196-6774(85)90012-4},
url = {https://doi.org/10.1016/0196-6774(85)90012-4}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 7 | |
| 2018 | 3 | |
| 2019 | 10 | |
| 2020 | 11 | |
| 2021 | 12 | |
| 2022 | 7 | |
| 2023 | 10 | |
| 2024 | 5 | |
| 2025 | 8 | |
| 2026 | 6 |
Its field-weighted citation impact is 7.38: it has been cited 7.38 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
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Johnson, D. S. (1985). The NP-completeness column: an ongoing guide. Journal of Algorithms, 6(3), 434–451. https://doi.org/10.1016/0196-6774(85)90012-4
How many times has this paper been cited?
248 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(85)90012-4. The permanent link is https://doi.org/10.1016/0196-6774(85)90012-4.
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.