David S. Johnson

1945

• Computers and intractability
• Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge, October 11-13, 1993 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
• Data structures, near neighbor searches, and methodology
• Discrete algorithms and complexity
• Network flows and matching
• Near-optimal bin packing algorithms
• The shortest path problem