Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Countries citing papers authored by David S. Johnson
Since
Specialization
Citations
This map shows the geographic impact of David S. Johnson's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by David S. Johnson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David S. Johnson more than expected).
Fields of papers citing papers by David S. Johnson
This network shows the impact of papers produced by David S. Johnson. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by David S. Johnson. The network helps show where David S. Johnson may publish in the future.
Co-authorship network of co-authors of David S. Johnson
This figure shows the co-authorship network connecting the top 25 collaborators of David S. Johnson.
A scholar is included among the top collaborators of David S. Johnson based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with David S. Johnson. David S. Johnson is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Aruliah, A. L., et al.. (2017). Comparing High-Latitude Thermospheric Winds From FPI and CHAMP Accelerometer Measurements. UCL Discovery (University College London).1 indexed citations
2.
Johnson, David S.. (2016). Vector Bin Packing.. 2319–2323.2 indexed citations
3.
Demetrescu, Camil, Andrew V. Goldberg, & David S. Johnson. (2009). The Shortest Path Problem.64 indexed citations
Applegate, David, et al.. (2003). The Cutting-Stock Approach to Bin Packing: Theory and Experiments.. 1–15.10 indexed citations
6.
Goldwasser, Michael H., David S. Johnson, & Catherine C. McGeoch. (2002). Data structures, near neibor searches, and methodology : fifth and sixth DIMACS implementation challenges : papers related to the DIMACS challenge on dictionaries and priority queues (1995-1996) and the DIMACS challenge on near neighbor searches (1998-1999). American Mathematical Society eBooks.4 indexed citations
Johnson, David S. & Márió Szegedy. (1999). What are the least tractable instances of max independent set. Symposium on Discrete Algorithms. 927–928.17 indexed citations
Johnson, David S., Christos H. Papadimitriou, & Mihalis Yannakakis. (1988). How easy is local search?. Journal of Computer and System Sciences. 37(1). 79–100.346 indexed citations
14.
Johnson, David S., Christos H. Papadimitriou, & Mihalis Yannakakis. (1985). How Easy Is Local Search? (Extended Abstract). 39–42.3 indexed citations
15.
Johnson, David S. & M. R. Garey. (1985). A 7160 theorem for bin packing. Journal of Complexity. 1(1). 65–106.49 indexed citations
16.
Megiddo, Nimrod, S. L. Hakimi, M. R. Garey, David S. Johnson, & Christos H. Papadimitriou. (1981). The Complexity of Searching a Graph (Preliminary Version). 376–385.9 indexed citations
17.
Johnson, David S.. (1976). On property B. Journal of Combinatorial Theory Series B. 20(1). 64–66.1 indexed citations
18.
Johnson, David S.. (1974). Fast algorithms for bin packing. Journal of Computer and System Sciences. 8(3). 272–314.338 indexed citations
19.
Johnson, David S.. (1974). Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences. 9(3). 256–278.1255 indexed citations breakdown →
20.
Johnson, David S.. (1962). Satellites and Weather Forecasting. NASA Special Publication. 8. 167.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.