World's Best Scientists 2026 revealed!
Award Badge
Mathematics
USA
2026

D-Index & Metrics

Computer Science

D-Index
76
Citations
23482
World Ranking
1341
National Ranking
702

Mathematics

D-Index
76
Citations
23437
World Ranking
193
National Ranking
112

Research.com Recognitions

  • 2026 - Research.com Mathematics in United States Leader Award
  • 2025 - Research.com Mathematics in United States Leader Award
  • 2017 - Fellow of the American Association for the Advancement of Science (AAAS)
  • 2011 - ACM Fellow For contributions to graph algorithms and computational geometry.

Overview

David Eppstein is affiliated with the University of California, Irvine in the United States. Their research primarily focuses on computer science, with an emphasis on computational theory and mathematics. The main topics of their work include computational geometry and mesh generation, advanced graph theory research, complexity and algorithms in graphs, algorithms and data compression, graph theory and CDMA systems, limits and structures in graph theory, and optimization and search problems.

Their frequent coauthors are:

  • Daniel Frishberg
  • Michael T. Goodrich
  • David R. Wood
  • Erik D. Demaine
  • Elham Havvaei

David Eppstein has published extensively in various venues. The most frequent publication venues are:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Algorithmica
  • Computational Geometry
  • Discrete & Computational Geometry

Selected recent papers include:

  • "Minor-Closed Graph Classes with Bounded Layered Pathwidth", 2020, SIAM Journal on Discrete Mathematics
  • "Parameterized Leaf Power Recognition via Embedding into Graph Products", 2020, Algorithmica
  • "Geometric Dominating Sets - a Minimum Version of the No-Three-In-Line Problem", 2022, Computational Geometry
  • "Treetopes and Their Graphs", 2020, Discrete & Computational Geometry
  • "Egyptian Fractions with Denominators from Sequences Closed Under Doubling", 2021, arXiv (Cornell University)

David Eppstein has been recognized with awards including being named an ACM Fellow in 2011 for contributions to graph algorithms and computational geometry, and a Fellow of the American Association for the Advancement of Science (AAAS) in 2017.

Best Publications

  • Finding the k Shortest Paths

    David Eppstein

  • MESH GENERATION AND OPTIMAL TRIANGULATION

    Marshall Bern;David Eppstein

  • The crust and the B-Skeleton: combinatorial curve reconstruction

    Nina Amenta;Marshall Bern;David Eppstein

  • Subgraph isomorphism in planar graphs and related problems.

    David Eppstein

  • Sparsification—a technique for speeding up dynamic graph algorithms

    David Eppstein;Zvi Galil;Giuseppe F. Italiano;Amnon Nissenzweig

  • Provably good mesh generation

    M. Bern;D. Eppstein;J. Gilbert

  • Spanning Trees and Spanners

    David Eppstein

  • Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time

    David Eppstein;Maarten Löffler;Darren Strash

  • Fast Approximation of Centrality

    David Eppstein;Joseph Wang

  • Diameter and Treewidth in Minor-Closed Graph Families

    David Eppstein

  • Reset sequences for monotonic automata

    David Eppstein

  • Optimal Point Placement for Mesh Smoothing

    Nina Amenta;Marshall Bern;David Eppstein

  • Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions

    David Eppstein;Jeff Erickson

  • Internet packet filter management and rectangle geometry

    David Eppstein;S. Muthukrishnan

  • On Nearest-Neighbor Graphs

    D. Eppstein;M. S. Paterson;F. F. Yao

  • Listing All Maximal Cliques in Large Sparse Real-World Graphs

    David Eppstein;Maarten Löffler;Darren Strash

  • Dynamic graph algorithms

    Camil Demetrescu;David Eppstein;Zvi Galil;Giuseppe F. Italiano

  • Maintenance of a minimum spanning forest in a dynamic plane graph

    David Eppstein;Giuseppe F. Italiano;Roberto Tamassia;Robert E. Tarjan

  • Parallel recognition of series-parallel graphs

    David Eppstein

  • Listing all maximal cliques in large sparse real-world graphs

    David Eppstein;Darren Strash

  • On Nearest-Neighbor Graphs

    Mike Paterson;F. Frances Yao

Frequent Co-Authors

Michael T. Goodrich
Michael T. Goodrich University of California, Irvine
Marshall Bern
Marshall Bern Protein Metrics (United States)
Stephen G. Kobourov
Stephen G. Kobourov University of Arizona
Giuseppe F. Italiano
Giuseppe F. Italiano Guido Carli Free International University for Social Studies
Bettina Speckmann
Bettina Speckmann Eindhoven University of Technology
Anna Lubiw
Anna Lubiw University of Waterloo
David R. Wood
David R. Wood Monash University
Jeff Erickson
Jeff Erickson University of Illinois at Urbana-Champaign
Raffaele Giancarlo
Raffaele Giancarlo University of Palermo

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a mathematics degree in the USA opens doors to diverse career paths, often enhanced by additional qualifications. Many professionals consider complementing their math expertise with business-related degrees to boost career prospects and salaries.

For those interested in advanced leadership roles, exploring the cheapest aacsb online dba programs can be a strategic move. These affordable Doctor of Business Administration options offer specialized knowledge that combines data analysis skills with executive decision-making.

Finance is another popular avenue. A strong foundation in mathematics is critical for careers in financial analysis or risk management. Students often seek the cheapest online master's in finance to enhance their expertise without breaking the bank.

For busy professionals, fast completion times matter. The shortest online mba programs allow students to gain management skills quickly while continuing to leverage their math background.

Lastly, combining mathematical skills with marketing can lead to lucrative data-driven marketing careers. Affordable options like the cheapest online marketing degree provide high value without lengthy commitments.

Exploring these related online degrees provides flexibility and specialized knowledge, helping math graduates stand out in competitive job markets.

Best Scientists Citing David Eppstein

Trending Scientists

Recently Published Articles