Biography:David Eppstein

From HandWiki
David Eppstein
Photograph of Eppstein in September 2005
Eppstein in September 2005 at Limerick, Ireland, during the 13th International Symposium on Graph Drawing
Born
David Arthur Eppstein

1963 (age 62–63)[1]
Windsor, England
CitizenshipUnited States
Alma mater
Scientific career
Fields
InstitutionsUniversity of California, Irvine[2]
ThesisEfficient algorithms for sequence analysis with concave and convex gap costs (1989)
Doctoral advisorZvi Galil[3]
Website11011110.github.io/blog

David Arthur Eppstein (born 1963) is an American computer scientist and mathematician. He is a distinguished professor of computer science at the University of California, Irvine,[2][4] known for his work in computational geometry, graph algorithms, and recreational mathematics. Eppstein is also a Wikipedia editor and an administrator on the English Wikipedia.

Education and career

Eppstein received a B.S. in mathematics from Stanford University in 1984, and later an M.S. (1985) and Ph.D. (1989) in computer science from Columbia University, after which he took a postdoctoral position at Xerox's Palo Alto Research Center.[5] He joined the UC Irvine faculty in 1990, and was co-chair of the Computer Science Department there from 2002 to 2005.[6] In 2014, he was named a Chancellor's Professor.[7]

He obtained his Ph.D. in computer science in 1989, from Columbia University, advised by Zvi Galil. He has supervised thirteen PhD. students, all at University of California, Irvine.[8]

Eppstein was named an ACM Fellow in 2011.[9] In October 2017, he was one of 396 members elected as fellows of the American Association for the Advancement of Science.[10]

Eppstein is an amateur digital photographer.[2] He is also a Wikipedia editor and tries to bring more experts to the project.[11]

Eppstein served as the program chair for the theory track of the ACM Symposium on Computational Geometry in 2001[12], the program chair of the ACM-SIAM Symposium on Discrete Algorithms in 2002[13], and the co-chair for the International Symposium on Graph Drawing in 2009.[14]

Research interests

In computer science, Eppstein's research has included work on 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.

Selected publications

  • Eppstein, David (1998). "Finding the k Shortest Paths". SIAM Journal on Computing 28 (2): 652–673. doi:10.1137/S0097539795290477. https://www.ics.uci.edu/~eppstein/pubs/Epp-SJC-98.pdf. 
  • Eppstein, D.; Galil, Z.; Italiano, G. F.; Nissenzweig, A. (1997). "Sparsification—a technique for speeding up dynamic graph algorithms". Journal of the ACM 44 (5): 669–696. doi:10.1145/265910.265914. 
  • Amenta, N.; Bern, M.; Eppstein, D. (1998). "The Crust and the β-Skeleton: Combinatorial Curve Reconstruction". Graphical Models and Image Processing 60 (2): 125–135. doi:10.1006/gmip.1998.0465. Bibcode: 1998GMIP...60..125A. http://www-ma2.upc.es/~geoc/abe-csccr-98.pdf. 
  • Bern, Marshall; Eppstein, David (1992). "Mesh generation and optimal triangulation". Technical Report CSL-92-1 (Xerox PARC): 1–78. https://www.eecs.berkeley.edu/~jrs/meshpapers/BernEppstein.pdf.  Republished in "Mesh Generation and Optimal Triangulation". Computing in Euclidean Geometry. Lecture Notes Series on Computing. 4. World Scientific. 1995. pp. 47–123. doi:10.1142/9789812831699_0003. ISBN 978-981-02-1876-8. 
  • Eppstein, David; Lewis, Joel Brewster; Woodroofe, Russ (2025). "{Princ-wiki-a Mathematica}: Wikipedia Editing and Mathematics". Notices of the American Mathematical Society 72 (1): 1. doi:10.1090/noti3096. ISSN 0002-9920. 
  • Contributor in Algorithms and Computation, edited by Otfried Cheong. Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2010. ISBN 978-3-642-17516-9
  • Contributing speaker in Algorithms -- ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings. Susanne Albers, Ed. Springer, 2004. ISBN 978-3-540-23025-0
  • Eppstein, D., Italiano, G. F., Tamassia, R., Tarjan, R. E., Westbrook, J., & Yung, M. (1990). "Maintenance of a minimum spanning forest in a dynamic planar graph." In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990 (pp. 1-11). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms). Association for Computing Machinery.

Books

Books as editor

  • Knowledge Spaces: Applications in Education, by Jean-Claude Falmagne, Dietrich Albert, David Eppstein, et al., Jul 3, 2013. Springer. ISBN 978-3-6423-5329-1.
  • Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. (Lecture Notes in Computer Science, 5849) 2010th Edition, by David Eppstein (Editor), Emden R Gansner (Editor). Springer. ISBN 978-3-642-11804-3.

Books as author

See also

  • Eppstein's algorithm
  • List of Wikipedia people
  • Nauru graph

References

  1. ↑ Eppstein, David. "11011110 – User Profile". livejournal.com. http://11011110.livejournal.com/profile. 
  2. ↑ 2.0 2.1 2.2 Hines, Michael (September 1, 2001). "Picture-perfect prints are possible". Daily Press (Hampton, VA): p. G1, G7. https://www.newspapers.com/image/238407757. "Eppstein is a computer science professor at the University of California, Irvine, and member of the rec.photo.digital online bulletin board of amateur digital photographers." 
  3. ↑ "David Eppstein - the Mathematics Genealogy Project". https://www.genealogy.math.ndsu.nodak.edu/id.php?id=120697. 
  4. ↑ "Distinguished Professors – UCI". https://ap.uci.edu/titles-of-distinction/distinguished-professor/. 
  5. ↑ "Contributors". IEEE Transactions on Information Theory 47 (6): 2667–2677. September 2000. doi:10.1109/TIT.2001.945287. 
  6. ↑ "David Eppstein's Online Curriculum Vitae". https://www.ics.uci.edu/~eppstein/vita.pdf. 
  7. ↑ "UCI Chancellor's Professors". http://www.ap.uci.edu/distinctions/chancprof.html. 
  8. ↑ "David Eppstein - the Mathematics Genealogy Project". https://www.genealogy.math.ndsu.nodak.edu/id.php?id=120697. 
  9. ↑ "List of ACM Fellows". https://awards.acm.org/fellows/award-winners. 
  10. ↑ American Association for the Advancement of Science (2017). "2017 AAAS Fellows approved by the AAAS Council". Science 358 (6366): 1011–1014. doi:10.1126/science.358.6366.1011. Bibcode: 2017Sci...358.1011.. 
  11. ↑ Eppstein, David; Lewis, Joel Brewster; Woodroofe, Russ (2025). "{Princ-wiki-a Mathematica}: Wikipedia Editing and Mathematics". Notices of the American Mathematical Society 72 (1): 1. doi:10.1090/noti3096. ISSN 0002-9920. 
  12. ↑ "ACM Symposium on Computional Geometry 2001: Conference Program". https://sarielhp.org/research/CG/compgeom/msg00389.html. 
  13. ↑ "About the Symposium". https://www.siam.org/meetings/da02/. 
  14. ↑ "Call For Papers: Graph Drawing 2009". http://facweb.cs.depaul.edu/gd2009/cfp.asp#pc. 
  15. ↑ Review by Darren Glass: https://old.maa.org/press/maa-reviews/forbidden-configurations-in-discrete-geometry
  16. ↑ Green, Frederic (2021-01-14). "Review of Forbidden Configurations in Discrete Geometry by David Eppstein". SIGACT News 51 (4): 15–17. doi:10.1145/3444815.3444820. ISSN 0163-5700. https://dl.acm.org/doi/10.1145/3444815.3444820. Retrieved 2025-06-25. 
  17. ↑ Kleitman, Daniel (2020-05-04). "Points and Lines". Inference: International Review of Science 5 (2). doi:10.37282/991819.20.12. ISSN 2576-4403. https://inference-review.com/article/points-and-lines. Retrieved 2025-06-25. 



Retrieved from "https://handwiki.org/wiki/index.php?title=Biography:David_Eppstein&oldid=4403986"