David Johnson is Head of the Algorithms and Optimization Department at AT&T Labs-Research in Florham Park, NJ, and has been a researcher at the Labs (in its many incarnations) since 1973, when he received his PhD from MIT. He is perhaps best known as the co-author of COMPUTERS AND INTRACTABILITY: A GUIDE TO THE THEORY OF NP-COMPLETENESS, for which he and his co-author M. R. Garey won the INFORMS Lanchester Prize. His research interests include approximation algorithms for combinatorial problems, a subject on which he had several of the first key papers, starting with his PhD thesis on the infamous "bin packing" problem. In recent years he has become a leader in the experimental analysis of algorithms, and has been the creator and lead organizer for the series of DIMACS Implementation Challenges, covering topics from Network Flows to the Traveling Salesman Problem. He also founded the ACM-SIAM Symposium on Discrete Algorithms (SODA), and served as its Steering Committee Chair for its first 23 years. He is an ACM Fellow, a SIAM Fellow, an AT&T Fellow, and the winner of the 2010 Knuth Prize for outstanding contributions to the foundations of computer science.