David S. Johnson
Impact in
- Industrial and Manufacturing Engineering top 0.01%
- Scheduling and Optimization Algorithms
- Optimization and Packing Problems
- Vehicle Routing Optimization Methods
- Advanced Manufacturing and Logistics Optimization
-
- Computational Geometry and Mesh Generation
Papers in
-
- Optimization and Search Problems 27
- Constraint Satisfaction and Optimization 13
-
- Complexity and Algorithms in Graphs 32
- Advanced Graph Theory Research 25
- Co-authors
- M. R. Garey (33 shared papers)Lyle A. McGeoch (6 shared papers)E. G. Coffman (9 shared papers)Larry Stockmeyer (1 shared paper)Christos H. Papadimitriou (8 shared papers)Catherine A. Schevon (2 shared papers)C. Aragon (2 shared papers)Mihalis Yannakakis (7 shared papers)
- Journals
- Journal of Algorithms (22 papers)SIAM Journal on Computing (7 papers)Journal of the ACM (4 papers)SIAM Journal on Applied Mathematics (3 papers)Operations Research (3 papers)
- Partner nations
- United StatesGreeceGermany
In The Last Decade
David S. Johnson
126 papers receiving 48.2k citations
David S. Johnson's Hit Papers
Peers
Comparison fields: 5 of 195
- Industrial and Manufacturing Engineering 13.4k
- Computer Graphics and Computer-Aided Design 4.0k
- Computational Theory and Mathematics 17.3k
- Computer Networks and Communications 20.3k
- Hardware and Architecture 4.6k
Countries citing papers authored by David S. Johnson
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-authors
The 25 scholars most cited alongside David S. Johnson, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 134 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Computers and Intractability: A Guide to the Theory of NP-Completeness Hit paper breakdown → | 1979 | 34784 |
| 2 | Approximation algorithms for combinatorial problems Hit paper breakdown → | 1974 | 1640 |
| 3 | Some simplified NP-complete graph problems Hit paper breakdown → | 1976 | 1543 |
| 4 | Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning Hit paper breakdown → | 1989 | 1208 |
| 5 | The Rectilinear Steiner Tree Problem is $NP$-Complete Hit paper breakdown → | 1977 | 829 |
| 6 | Approximation algorithms for bin packing: a survey Hit paper breakdown → | 1996 | 711 |
| 7 | Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning Hit paper breakdown → | 1991 | 685 |
| 8 | The NP-completeness column: An ongoing guide Hit paper breakdown → | 1986 | 627 |
| 9 | On generating all maximal independent sets Hit paper breakdown → | 1988 | 567 |
| 10 | An Application of Bin-Packing to Multiprocessor Scheduling Hit paper breakdown → | 1978 | 513 |
| 11 | How easy is local search? Hit paper breakdown → | 1988 | 486 |
| 12 | 1983 | 480 | |
| 13 | 1977 | 416 | |
| 14 | 1974 | 406 | |
| 15 | The Traveling Salesman Problem: A Case Study in Local Optimization Hit paper breakdown → | 2008 | 403 |
| 16 | 1996 | 401 | |
| 17 | 1980 | 371 | |
| 18 | 1980 | 316 | |
| 19 | 1988 | 307 | |
| 20 | 1990 | 298 |
About David S. Johnson
David S. Johnson is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Industrial and Manufacturing Engineering, Electrical and Electronic Engineering and Artificial Intelligence, having authored 134 papers that have together received 52.3k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (32 papers), Optimization and Search Problems (27 papers), Optimization and Packing Problems (27 papers), Advanced Graph Theory Research (25 papers), Advanced Manufacturing and Logistics Optimization (15 papers), Parallel Computing and Optimization Techniques (15 papers), Scheduling and Optimization Algorithms (14 papers) and Constraint Satisfaction and Optimization (13 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (13.4k citations), Computer Graphics and Computer-Aided Design (4.0k citations), Computational Theory and Mathematics (17.3k citations), Computer Networks and Communications (20.3k citations) and Hardware and Architecture (4.6k citations). David S. Johnson has collaborated with scholars based in United States, Greece and Germany. Frequent co-authors include M. R. Garey, Lyle A. McGeoch, E. G. Coffman, Larry Stockmeyer, Christos H. Papadimitriou, Catherine A. Schevon, C. Aragon, Mihalis Yannakakis, Ronald Graham and Robert E. Tarjan. Their work appears in journals such as Journal of Algorithms, SIAM Journal on Computing, Journal of the ACM, SIAM Journal on Applied Mathematics and Operations Research.
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.