NSF GRFP > Fellow Profiles > David Eppstein

David Eppstein, Computer Science Professor

David Eppstein, winner of a 1984-1987 NSF Graduate Research Fellowship, is a leader in computational geometry, graph algorithms, and recreational mathematics. Born in England, he spent his academic career in the United States earning citizenship. He earned his Bachelor’s of Science with distinction from Stanford, and went on to complete a M.S. and Ph.D. in Computer Science at Columbia. In addition, he spent a year at Xerox Palo Alto Research Center on a postdoctorate.

Eppstein’s focus is graph algorithms and computational geometry, and has researched finite element meshing, minimum spanning trees, shortest paths, dynamic graph data structures, graph coloring, graph drawing, computational robust statistics, and geometric optimisation. He also has an interest in recreational mathematics.

Before his NSF Graduate Research Fellowship, he was first awarded a National Merit Scholarship for 1981-1984. Most recently, he received a NSF Young Investigator Award (1992 – 1999). He has serves on the editorial boards of a number of trade publications, including the Journal of Graph Algorithms and Applications and the SIAM Journal on Computing, has been a guest editor to Algorithmica and Discrete & Computational Geometry, and has an extensive catalog of published works.

Eppstein is a full professor at the University of California, Irvine, Department of Information and Computer Science.

View Eppstein's Blog

Recent Publications

• Happy Endings for Flip Graphs.
• Recognizing Partial Cubes in Quadratic Time.
• Quasiconvex analysis of backtracking algorithms.
• The lattice dimension of a graph.
• The traveling salesman problem for cubic graphs.