David Eppstein

{{Short description|American computer scientist and mathematician (born 1963)}}

{{for|other people with a similar name|David Epstein (disambiguation){{!}}David Epstein}}

{{Infobox scientist

| name = David Eppstein

| image = Eppstein in Limerick (cropped).jpg

| alt = Photograph of Eppstein in September 2005

| caption = Eppstein in September 2005 at Limerick, Ireland, during the 13th International Symposium on Graph Drawing

| birth_name = David Arthur Eppstein

| birth_date = {{birth year and age|1963}}{{cite web|author=Eppstein, David|title=11011110 – User Profile|work=livejournal.com|url=http://11011110.livejournal.com/profile|access-date=November 1, 2016|url-status=dead|archive-url=https://archive.today/20120630234847/http://11011110.livejournal.com/profile|archive-date=June 30, 2012|df=mdy-all}}

| birth_place = Windsor, England

| death_date =

| death_place =

| citizenship = United States

| field = {{unbulleted list|Computational geometry|Graph algorithms}}

| workplaces = University of California, Irvine

| alma_mater = {{unbulleted list|Stanford University|Columbia University}}

| thesis_title = Efficient algorithms for sequence analysis with concave and convex gap costs

| thesis_url = https://www.ics.uci.edu/~eppstein/pubs/Epp-PhD-89.pdf

| thesis_year = 1989

| doctoral_advisor = Zvi Galil

| website = {{URL|https://11011110.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.{{cite web|title=Distinguished Professors – UCI|url=https://ap.uci.edu/titles-of-distinction/distinguished-professor/|access-date=July 26, 2020|archive-date=September 16, 2020|archive-url=https://web.archive.org/web/20200916202917/https://ap.uci.edu/titles-of-distinction/distinguished-professor/|url-status=live}} He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.{{cite web|url=https://awards.acm.org/fellows/award-winners|title=List of ACM Fellows|access-date=September 9, 2019|archive-date=December 1, 2016|archive-url=https://web.archive.org/web/20161201132101/http://awards.acm.org/fellow/all.cfm|url-status=live}}

Biography

Born in Windsor, England, in 1963, 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.{{cite journal |date=September 2000 |title=Contributors |url=https://ieeexplore.ieee.org/document/945287 |journal=IEEE Transactions on Information Theory |volume=47 |issue=6 |pages=2667–2677 |doi=10.1109/TIT.2001.945287 |access-date=2021-01-11 |archive-date=2021-10-28 |archive-url=https://web.archive.org/web/20211028132635/https://ieeexplore.ieee.org/document/945287 |url-status=live }} He joined the UC Irvine faculty in 1990, and was co-chair of the Computer Science Department there from 2002 to 2005.{{cite web|title=David Eppstein's Online Curriculum Vitae|url=https://www.ics.uci.edu/~eppstein/vita.pdf|access-date=April 9, 2008|archive-date=January 27, 2012|archive-url=https://web.archive.org/web/20120127234710/http://www.ics.uci.edu/~eppstein/vita.pdf|url-status=live}} In 2014, he was named a Chancellor's Professor.{{cite web|title=UCI Chancellor's Professors|url=http://www.ap.uci.edu/distinctions/chancprof.html|archive-url=https://web.archive.org/web/20021115173118/http://www.ap.uci.edu/distinctions/chancprof.html|url-status=dead|archive-date=November 15, 2002|access-date=August 18, 2014|df=mdy-all}} In October 2017, Eppstein was one of 396 members elected as fellows of the American Association for the Advancement of Science.{{cite journal|author=American Association for the Advancement of Science|title=2017 AAAS Fellows approved by the AAAS Council|journal=Science|volume=358|issue=6366|pages=1011–1014|doi=10.1126/science.358.6366.1011|year=2017|bibcode=2017Sci...358.1011.|doi-access=free}}

Eppstein is an amateur digital photographer. He is also a Wikipedia editor and administrator with over 200,000 edits.{{cite news|author=Hines, Michael|title=Picture-perfect prints are possible|url=https://www.newspapers.com/image/238407757|access-date=September 9, 2019|work=Daily Press|date=September 1, 2001|location=Hampton, VA|page=G1, G7|department=Business|via=Newspapers.com|url-access=limited|quote=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.|archive-date=June 14, 2019|archive-url=https://web.archive.org/web/20190614155516/http://www.newspapers.com/image/238407757/|url-status=live}}{{Citation |title=Wikipedia:List of Wikipedians by number of edits |date=2023-02-10 |url=https://en.wikipedia.org/w/index.php?title=Wikipedia:List_of_Wikipedians_by_number_of_edits&oldid=1138516223 |work=Wikipedia |language=en |access-date=2023-02-16}}{{Citation |title=User:David Eppstein |date=2023-01-20 |url=https://en.wikipedia.org/w/index.php?title=User:David_Eppstein&oldid=1134789282 |work=Wikipedia |language=en |access-date=2023-02-16 |archive-date=2023-01-27 |archive-url=https://web.archive.org/web/20230127044854/https://en.wikipedia.org/w/index.php?title=User:David_Eppstein&oldid=1134789282 |url-status=live }}

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.

Eppstein served as the program chair for the theory track of the ACM Symposium on Computational Geometry in 2001, the program chair of the ACM-SIAM Symposium on Discrete Algorithms in 2002, and the co-chair for the International Symposium on Graph Drawing in 2009.{{Cite web|url=http://facweb.cs.depaul.edu/gd2009/gd2009.asp|title=Graph Drawing 2009|website=facweb.cs.depaul.edu|access-date=May 7, 2020|archive-date=February 24, 2020|archive-url=https://web.archive.org/web/20200224075321/http://facweb.cs.depaul.edu/gd2009/gd2009.asp|url-status=live}}

Selected publications

{{cite journal |doi=10.1137/S0097539795290477 |title=Finding the k Shortest Paths |url=https://www.ics.uci.edu/~eppstein/pubs/Epp-SJC-98.pdf |year=1998 |last1=Eppstein |first1=David |journal=SIAM Journal on Computing |volume=28 |issue=2 |pages=652–673 }}
{{cite book |doi=10.1109/SFCS.1994.365697 |chapter=Finding the k shortest paths |chapter-url=https://www.ics.uci.edu/~eppstein/pubs/Epp-TR-94-26.pdf |title=Proceedings 35th Annual Symposium on Foundations of Computer Science |year=1994 |last1=Eppstein |first1=David |pages=154–165 |citeseerx=10.1.1.39.3901 |isbn=978-0-8186-6580-6 |s2cid=3179241 }}
{{cite journal|author1=Eppstein, D.|author2=Galil, Z.|author-link2=Zvi Galil|author3=Italiano, G. F.|author-link3=Giuseppe F. Italiano|author4=Nissenzweig, A.|year=1997|title=Sparsification—a technique for speeding up dynamic graph algorithms|journal=Journal of the ACM|doi=10.1145/265910.265914 |doi-access=free |volume=44|issue=5|pages=669–696}}
{{cite journal|author1=Amenta, N.|author2=Bern, M.|author3=Eppstein, D.|year=1998 |url=http://www-ma2.upc.es/~geoc/abe-csccr-98.pdf|archive-url=https://web.archive.org/web/20091217114632/http://www-ma2.upc.es/~geoc/abe-csccr-98.pdf|url-status=dead|archive-date=2009-12-17|title=The Crust and the β-Skeleton: Combinatorial Curve Reconstruction|journal=Graphical Models and Image Processing |doi=10.1006/gmip.1998.0465|volume=60|issue=2|pages=125–135|s2cid=6301659 }}
{{cite journal|author1=Bern, Marshall|author2=Eppstein, David|year=1992|title=Mesh generation and optimal triangulation|journal=Technical Report CSL-92-1|pages=1–78|publisher=Xerox PARC |url=https://www.eecs.berkeley.edu/~jrs/meshpapers/BernEppstein.pdf }} Republished in {{cite book|editor1=Du, D.-Z.|editor2=Hwang, F. K.|year=1995|title=Computing in Euclidean Geometry |chapter=Mesh Generation and Optimal Triangulation |series=Lecture Notes Series on Computing|volume=4|publisher=World Scientific|pages=47–123 |doi=10.1142/9789812831699_0003 |isbn=978-981-02-1876-8}}
{{cite journal | last1=Eppstein | first1=David | last2=Lewis | first2=Joel Brewster | last3=Woodroofe | first3=Russ | title={Princ-wiki-a Mathematica}: Wikipedia Editing and Mathematics | journal=Notices of the American Mathematical Society | volume=72 | issue=1 | date=2025 | issn=0002-9920 | doi=10.1090/noti3096 | page=1| arxiv=2412.20419 }}

=Books=

{{cite book|author1=Eppstein, D.|author2=Falmagne, J.-Cl.|author-link2=Jean-Claude Falmagne|author3=Ovchinnikov, S.|year=2008|title=Media Theory: Interdisciplinary Applied Mathematics |url=https://archive.org/details/mediatheoryinter0000epps|url-access=registration|publisher=Springer-Verlag|isbn=978-3-642-09083-7 |doi=10.1007/978-3-540-71697-6 }}
{{cite book|author1=Eppstein, D.|year=2018|title=Forbidden Configurations in Discrete Geometry |url=https://www.cambridge.org/core/books/forbidden-configurations-in-discrete-geometry/0A90D6B522B1DFF59641F086F149EA45|publisher=Cambridge University Press|isbn=978-1-108-43913-8 |doi=10.1017/9781108539180 }}