Greg N. Frederickson

Professor of Computer Science

Joined department: 1982
AB, Harvard University, Economics (1969)
MS, University of Maryland, Computer Science (1976)
PhD, University of Maryland, Computer Science (1977)

Professor Frederickson's areas of interest include the analysis of algorithms, with special emphasis on data structures, and graph and network algorithms. His recent work has focused on designing data structures to dynamically maintain information about graphs, on designing optimal algorithms for parametric search problems on trees, and on discovering graph decompositions that facilitate fast algorithms for shortest path problems. Professor Frederickson has served on the editorial boards of SIAM Journal on Computing, SIAM Journal on Discrete Mathematics, and IEEE Transactions on Computers, and Algorithmica. He has published three books, Dissections Plane & Fancy, Cambridge University Press, 1997, Hinged Dissections: Swinging & Twisting, Cambridge University Press, 2002, and Piano-Hinged Dissections: Time to Fold!, A K Peters, 2006. Professor Frederickson was recognized in 2003-04 as a Top Ten Outstanding Teacher in Science at Purdue, and was inducted into Purdue's Book of Great Teachers in 2008. He won a George Pólya Award from the Mathematical Association of America in 2004, and again in 2009.

Selected Publications
Greg N. Frederickson, "Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees", SIAM Journal on Computing, Volume 26, pp. 484-538, 1997
Greg N. Frederickson and Roberto Solis-Oba, "Efficient algorithms for robustness in resource allocation and scheduling problems", Theoretical Computer Science, Volume 352, pp. 250-265, 2006
Greg N. Frederickson and Barry Wittman, "Approximation algorithms for the traveling repairman and speeding deliveryman problems", Algorithmica, Volume 62, pp. 1198-1221, 2012