This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 03:19, 4 January 2008 (BLP trumps COI. Again. Sigh. Revert.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 03:19, 4 January 2008 by David Eppstein (talk | contribs) (BLP trumps COI. Again. Sigh. Revert.)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff) | This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "David Eppstein" – news · newspapers · books · scholar · JSTOR (September 2007) (Learn how and when to remove this message) |
| David Eppstein | |
|---|---|
| Born | England |
| Nationality | US citizen |
| Alma mater | Stanford University, Columbia University |
| Known for | He is best known for his work in computational geometry, graph algorithms, and recreational mathematics |
| Awards | NSF Young Investigator award, 1992 – 1999; NSF graduate fellowship, 1984 – 1987; National Merit scholarship, 1981 – 1984. |
| Scientific career | |
| Fields | computer scientist |
| Institutions | Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine |
| Doctoral advisor | Zvi Galil |
David Eppstein (born 1963) is a computer scientist at the Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine. He is best known for his work in computational geometry, graph algorithms, and recreational mathematics.
Biography
Born in England, but now a US citizen, Eppstein received a B.S. in Mathematics with distinction from Stanford University in 1984, and later an M.S. (May 1985) and a Ph.D. in Computer Science from Columbia University (May 1989), after which he took a postdoctorate at Xerox's Palo Alto Research Center. He joined the UC Irvine faculty in 1990, and was co-chair of the Computer Science Department there from 2002 to 2005.
Research interests
Eppstein's research is focused mostly in finite element meshing, minimum spanning trees, shortest paths, dynamic graph data structures, graph colouring, graph drawing, computational robust statistics, and geometric optimisation.
Selected publications
- D. Eppstein, Finding the k shortest paths, SIAM J. Comput. 28 (1999), no. 2, 652--673
- D. Eppstein, Z Galil, GF Italiano, A Nissenzweig, Sparsification—a technique for speeding up dynamic graph algorithms, J. ACM 44 (1997), no. 5, 669--696.
- N. Amenta, M. Bern, D. Eppstein, The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction Graphical Models and Image Processing, 1998
- M. Bern and D. Eppstein, Mesh generation and optimal triangulation, Tech. Rep. CSL-92-1, Xerox PARC, 1992. Computing in Euclidean Geometry, D.-Z. Du and F.K. Hwang, eds., World Scientific, 1992, pp. 23-90.
Awards and honours
Eppstein received the NSF Young Investigator award (1992 – 1999), and has been accepted to the NSF graduate fellowship (1984 – 1987) and the National Merit scholarship (1981 – 1984).