D. S. Johnson

2.9k total citations · 1 hit paper
11 papers, 1.7k citations indexed

About

D. S. Johnson is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Signal Processing. According to data from OpenAlex, D. S. Johnson has authored 11 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 5 papers in Computer Networks and Communications, 5 papers in Computational Theory and Mathematics and 4 papers in Signal Processing. Recurrent topics in D. S. Johnson's work include Complexity and Algorithms in Graphs (4 papers), Data Management and Algorithms (4 papers) and Computational Geometry and Mesh Generation (3 papers). D. S. Johnson is often cited by papers focused on Complexity and Algorithms in Graphs (4 papers), Data Management and Algorithms (4 papers) and Computational Geometry and Mesh Generation (3 papers). D. S. Johnson collaborates with scholars based in United States and Israel. D. S. Johnson's co-authors include M. R. Garey, Alan Demers, R. L. Graham, Jeffrey D. Ullman, Larry Stockmeyer, Robert E. Tarjan, Christos H. Papadimitriou, Elias Dahlhaus, Mihalis Yannakakis and Paul Seymour and has published in prestigious journals such as SIAM Journal on Computing and ACM SIGACT News.

In The Last Decade

D. S. Johnson

11 papers receiving 1.5k citations

Hit Papers

align trajectories

What are hit papers?

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.

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

1974 630 citations D. S. Johnson, Alan Demers et al. SIAM Journal on Computing profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
D. S. Johnson United States	8	744	594	588	252	226	11	1.7k
Giorgio Ausiello Italy	18	718 1.0×	349 0.6×	733 1.2×	485 1.9×	124 0.5×	68	1.7k
George S. Lueker United States	18	863 1.2×	531 0.9×	1.4k 2.4×	526 2.1×	255 1.1×	41	2.6k
Yair Bartal Israel	24	1.2k 1.6×	303 0.5×	728 1.2×	298 1.2×	121 0.5×	74	1.9k
T. C. Hu United States	22	1.1k 1.5×	710 1.2×	830 1.4×	518 2.1×	614 2.7×	60	2.7k
Kenneth J. Supowit United States	17	395 0.5×	285 0.5×	520 0.9×	223 0.9×	324 1.4×	33	1.6k
Reuven Bar-Yehuda Israel	23	1.2k 1.6×	253 0.4×	757 1.3×	220 0.9×	290 1.3×	58	1.9k
Klaus Jansen Germany	25	922 1.2×	1.0k 1.7×	663 1.1×	127 0.5×	278 1.2×	158	2.0k
Piotr Berman United States	25	1.2k 1.6×	205 0.3×	860 1.5×	410 1.6×	470 2.1×	110	2.2k
Serge Plotkin United States	29	2.3k 3.2×	452 0.8×	1.5k 2.6×	424 1.7×	574 2.5×	69	3.3k
Yossi Shiloach Israel	18	773 1.0×	113 0.2×	998 1.7×	441 1.8×	312 1.4×	28	1.7k

Countries citing papers authored by D. S. Johnson

Since Specialization

Citations

This map shows the geographic impact of D. 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 D. 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 D. S. Johnson more than expected).

Fields of papers citing papers by D. S. Johnson

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by D. 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 D. S. Johnson. The network helps show where D. S. Johnson may publish in the future.

Co-authorship network of co-authors of D. S. Johnson

This figure shows the co-authorship network connecting the top 25 collaborators of D. S. Johnson. A scholar is included among the top collaborators of D. 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 D. S. Johnson. D. S. Johnson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

11 of 11 papers shown

1.

Dahlhaus, Elias, D. S. Johnson, Christos H. Papadimitriou, Paul Seymour, & Mihalis Yannakakis. (1994). The Complexity of Multiterminal Cuts. SIAM Journal on Computing. 23(4). 864–894. 336 indexed citations

2.

Garey, M. R. & D. S. Johnson. (1985). Composing Functions to Minimize Image Size. SIAM Journal on Computing. 14(2). 500–503. 1 indexed citations

3.

Johnson, D. S. & Anthony C. Klug. (1983). Optimizing Conjunctive Queries that Contain Untyped Variables. SIAM Journal on Computing. 12(4). 616–640. 29 indexed citations

4.

Johnson, D. S. & Anthony C. Klug. (1982). Testing containment of conjunctive queries under functional and inclusion dependencies. 164–164. 34 indexed citations

5.

Johnson, D. S. & Anthony C. Klug. (1981). Optimizing conjunctive queries when attribute domains are not disjoint. 203–211. 2 indexed citations

6.

Fraenkel, Aviezri S., et al.. (1978). The complexity of checkers on an N × N board. 55–64. 14 indexed citations

7.

Garey, M. R. & D. S. Johnson. (1978). A note on "A note on 'Some simplified NP-complete graph problems'". ACM SIGACT News. 9(4). 17–17. 2 indexed citations

8.

Garey, M. R., D. S. Johnson, & Robert E. Tarjan. (1976). The Planar Hamiltonian Circuit Problem is NP-Complete. SIAM Journal on Computing. 5(4). 704–714. 266 indexed citations

9.

Johnson, D. S., Alan Demers, Jeffrey D. Ullman, M. R. Garey, & R. L. Graham. (1974). Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. SIAM Journal on Computing. 3(4). 299–325. 630 indexed citations breakdown →

10.

Garey, M. R., D. S. Johnson, & Larry Stockmeyer. (1974). Some simplified NP-complete problems. 47–63. 358 indexed citations

11.

Johnson, D. S.. (1972). Fast allocation algorithms. 144–154. 14 indexed citations

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.

Explore authors with similar magnitude of impact