David S. Johnson

8. The traveling salesman problem: a case study

David S. Johnson, Lyle A. McGeoch, David S. Johnson, 2003 .

The complexity of the network design problem : (preprint)

Jan Karel Lenstra, A.H.G. Rinnooy Kan, David S. Johnson, 1977 .

Algorithm Engineering (Dagstuhl Seminar 13391)

Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, 2013, Dagstuhl Reports.

The combinatorics of hidden diversity

Aggelos Kiayias, Moti Yung, Juan A. Garay, 2020, Theor. Comput. Sci..

Combinatorial Optimization: Algorithms and Complexity. By Christos H. Papadimitriou and Kenneth Steiglitz

David S. Johnson, 1984 .

Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111)

Jan Vitek, Camil Demetrescu, Daniel Delling, 2016, Dagstuhl Reports.

Strategic directions in research in theory of computing

John E. Savage, Prabhakar Raghavan, David B. Shmoys, 1997, SIGACT News.