D
David S. Johnson
1945
7 works on record
Works

The shortest path problem

Data structures, near neighbor searches, and methodology

Network flows and matching

Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge, October 11-13, 1993 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)

Discrete algorithms and complexity

Computers and intractability
Near-optimal bin packing algorithms
Near-optimal bin packing algorithms