David S. Johnson

Algorithms & Complexity · with McGeoch · 1982–2008

A researcher in the Science corpus: 4 papers; trusts 4 researchers and is trusted by 10 researchers here, as inferred from the citation graph.

Subfields

• Algorithms & Complexity — 7 citations into it

Whom David S. Johnson trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Richard M. Karp
2. Leslie G. Valiant
3. Carsten Peterson
4. Gary L. Miller
5. Eugene M. Luks
6. Donald Ervin Knuth
7. Jacob T. Schwartz
8. John E. Hopcroft

Who trusts David S. Johnson overall

1. René Peeters
2. Paul Tseng
3. Tim Roughgarden
4. David Windisch
5. Peixiang Zhao
6. Thomas Zaslavsky
7. Philip Bille
8. Ayumi Shinohara
9. Thorsten Theobald
10. Luis Cereceda

Papers from David S. Johnson's perspective

Ordered by how strongly the researchers David S. Johnson trusts endorse each paper. Same corpus, a different order for every researcher.

1. The Complexity of Computing the Permanent
2. A dynamic programming approach to sequencing problems
3. A personal communication
4. The NP-Completeness Column: An Ongoing Guide
5. A and V
6. HOW GOOD IS THE SIMPLEX ALGORITHM
7. On the computational complexity of Ising spin glass models
8. A Note on the Graph Isomorphism counting Problem
9. A machine program for theorem-proving (CACM)
10. The complexity of theorem-proving procedures

Their papers

• The Traveling Salesman Problem: A Case Study in Local Optimization (2008) — 851 citations
• Experimental Analysis of Heuristics for the STSP (2007) — 260 citations
• The prize collecting Steiner tree problem: theory and practice (2000) — 299 citations
• The NP-Completeness Column: An Ongoing Guide (1982)