David Eppstein

15.1k citations
248 papers · 6.5k indexed · 1 hit paper · h-index 43

David Eppstein

233 papers receiving 5.9k citations

Hit Papers

Finding the k Shortest Paths9321998202620072016250500750

Peers

David Eppstein
Comparison fields: 5 of 154
  • Computer Graphics and Computer-Aided Design 1.9k
  • Computational Theory and Mathematics 2.0k
  • Signal Processing 893
  • Computer Networks and Communications 1.8k
  • Computer Vision and Pattern Recognition 1.2k
Replace Kurt Mehlhorn with:
Kurt Mehlhorn Germany
Shang‐Hua Teng United States
Nimrod Megiddo United States
Mikhail J. Atallah United States
F. P. Preparata United States
Roberto Tamassia United States
Bernard Chazelle United States
Franco P. Preparata United States
Dorit S. Hochbaum United States
Pankaj K. Agarwal United States
David Eppstein relative to Kurt Mehlhorn Germany Kurt Mehlhorn's profile →
Citations per field
00.5×1.7×
Kurt Mehlhorn · 1×
Citations per year

Countries citing papers authored by David Eppstein

Since Specialization
Citations

This map shows the geographic impact of David Eppstein's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by David Eppstein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Eppstein more than expected).

Fields of papers citing papers by David Eppstein

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by David Eppstein. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by David Eppstein. The network helps show where David Eppstein may publish in the future.

Co-authorship network

The 25 scholars most cited alongside David Eppstein, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with David Eppstein Line = papers co-authored together David Eppstein links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20241
2 20230
3 20190
4 20095
5
Studying (Non-Planar) Road Networks Through an Algorithmic Lens
20081
6 200425
7 200351
8 20014
9 200138
10 199830
11 199732
12
Approximation algorithms for geometric problems
199673
13
Finding common ancestors and disjoint paths in DAGs
19959
14 199557
15
3-Coloring in Time O(1.3446 n ): A No-MIS Algorithm.
199520
16 19944
17
Fast optimal parallel algorithms for maximal matching in sparse graphs
19921
18
Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract)
199215
19 199011
20 199042

About David Eppstein

David Eppstein is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Signal Processing, having authored 248 papers that have together received 6.5k indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (137 papers), Advanced Graph Theory Research (77 papers), Complexity and Algorithms in Graphs (45 papers), Data Management and Algorithms (41 papers), Digital Image Processing Techniques (34 papers), Algorithms and Data Compression (26 papers), Optimization and Search Problems (25 papers) and Advanced Numerical Analysis Techniques (20 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (1.9k citations), Computational Theory and Mathematics (2.0k citations) and Signal Processing (893 citations). David Eppstein has collaborated with scholars based in United States, Canada and Israel. Frequent co-authors include Marshall Bern, Michael T. Goodrich, Zvi Galil, Giuseppe F. Italiano, Nina Amenta, John R. Gilbert, Jeff Erickson, Richard Beigel, S. Muthukrishnan and Raffaele Giancarlo. Their work appears in journals such as Journal of Graph Algorithms and Applications, Computational Geometry, Discrete & Computational Geometry, Algorithmica and Journal of Algorithms.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026