The Association for Computing Machinery (ACM) recently elevated Philip Klein to Fellow for his work in graph and network algorithms.
Philip, who joined the department in 1989, focuses on algorithms, especially for optimization and for graphs. He is the recipient of the 2007 Philip J. Bray Award for Excellence in Teaching in the Sciences. He created six courses for the department: The Matrix in Computer Science, Computer Science: An Integrated Introduction I and II (with Leslie P. Kaelbling), Design and Analysis of Algorithms, Topics in Advanced Algorithms, Solving Hard Problems in Combinatorial Optimization: Theory and Systems (with Pascal Van Hentenryck ...