| Line 3: |
Line 3: |
| | | | |
| | == Speaker == | | == Speaker == |
| − | David Johnson is Head of the Algorithms and Optimization Department
| + | Evdokia Nikolova is an Assistant Professor at the Computer Science & |
| − | at AT&T Labs-Research in Florham Park, NJ, and has been a researcher | + | Engineering Department at Texas A&M University. Previously she was a |
| − | at the Labs (in its many incarnations) since 1973, when he received his | + | postdoctoral associate in the Computer Science and Artificial |
| − | PhD from MIT. He is perhaps best known as the co-author of COMPUTERS
| + | Intelligence Laboratory at MIT. She graduated with a BA in Applied |
| − | AND INTRACTABILITY: A GUIDE TO THE THEORY OF NP-COMPLETENESS, for which
| + | Mathematics with Economics from Harvard University, MS in Mathematics |
| − | he and his co-author M. R. Garey won the INFORMS Lanchester Prize.
| + | from Cambridge University (U.K.) and Ph.D. in Computer Science from |
| − | His research interests include approximation algorithms for combinatorial
| + | MIT. She is interested in risk analysis from an algorithmic |
| − | problems, a subject on which he had several of the first key papers,
| + | perspective arising in stochastic optimization, networks, economics |
| − | starting with his PhD thesis on the infamous "bin packing" problem.
| + | and complex systems. She has worked on applications to transportation |
| − | In recent years he has become a leader in the experimental analysis of
| + | and is also interested in energy and other domains where her work may |
| − | algorithms, and has been the creator and lead organizer for the series
| + | apply. |
| − | 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.
| |
| | | | |
| | == Abstract == | | == Abstract == |