David Arthur Eppstein is an American computer scientist and mathematician.
Education
He received a Bachelor of Surgery in mathematics from Stanford University in 1984, and later an Master of Surgery (1985) and Doctor of Philosophy (1989) in computer science from Columbia University, after which he took a postdoctoral position at Xerox"s Palo Alto Research Center.
Career
He is a Chancellor"s Professor of computer science at University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. He joined the University of California Irvine faculty in 1990, and was co-chair of the Computer Science Department there from 2002 to 2005.
In computer science, Eppstein"s research is focused mostly in computational geometry: minimum spanning trees, shortest paths, dynamic graph data structures, graph coloring, graph drawing and geometric optimization.
He has published also in application areas such as finite element meshing, which is used in engineering design, and in computational statistics, particularly in robust, multivariate, nonparametric statistics. Eppstein served as the program chair for the theory track of the Association for Computing Machinery (ACM) Symposium on Computational Geometry in 2001, the program chair of the Association for Computing Machinery (ACM)-Society for Industrial and Applied Mathematics Symposium on Discrete Algorithms in 2002, and the co-chair for the International Symposium on Graph Drawing in 2009.
Doctorate. North. M. Doctorate.