David Eppstein

15.2k citations
355 papers · 10.3k · 1 hit paper · h-index 51

Impact in

Papers in

David Eppstein

334 papers receiving 9.6k citations

David Eppstein's Hit Papers

Finding the k Shortest Paths 1998 · 1.1k citations
1.1k0+9+18Years since publication2505007501000

Peers

David Eppstein
Comparison fields: 5 of 163
  • Computer Graphics and Computer-Aided Design 3.5k
  • Computational Theory and Mathematics 3.4k
  • Signal Processing 1.5k
  • Computer Networks and Communications 2.6k
  • Computer Vision and Pattern Recognition 2.3k
Replace Kurt Mehlhorn with:
Kurt Mehlhorn Germany
Erik D. Demaine United States
Bernard Chazelle United States
Pankaj K. Agarwal United States
Nimrod Megiddo United States
Shang‐Hua Teng United States
Mikhail J. Atallah United States
Franco P. Preparata United States
Michael Ian Shamos United States
Mark de Berg Netherlands
David Eppstein relative to Kurt Mehlhorn Germany Kurt Mehlhorn's profile →
Citations per field
00.5×1.5×1.9×
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-authors

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

Showing the 20 most-cited of 355 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Finding the k Shortest Paths
Hit paper breakdown →
19981053
2 1995389
3 1998304
4 1994249
5 2002247
6 2000234
7 1999225
8 2010210
9 1997195
10 1992168
11 1990160
12 1997149
13 2013133
14 2001119
15 1992119
16 2011103
17 1992100
18 199299
19 200499
20 199496

About David Eppstein

David Eppstein is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Computer Networks and Communications and Signal Processing, having authored 355 papers that have together received 10.3k indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (200 papers), Advanced Graph Theory Research (117 papers), Complexity and Algorithms in Graphs (60 papers), Data Management and Algorithms (54 papers), Digital Image Processing Techniques (50 papers), Algorithms and Data Compression (36 papers), Optimization and Search Problems (32 papers) and Advanced Numerical Analysis Techniques (25 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (3.5k citations), Computational Theory and Mathematics (3.4k citations), Signal Processing (1.5k citations), Computer Networks and Communications (2.6k citations) and Computer Vision and Pattern Recognition (2.3k citations). David Eppstein has collaborated with scholars based in United States, Canada and Germany. Frequent co-authors include Marshall Bern, Michael T. Goodrich, Zvi Galil, Darren Strash, Giuseppe F. Italiano, Nina Amenta, John R. Gilbert, Richard Beigel, Jeff Erickson and Maarten Löffler. Their work appears in journals such as Journal of Graph Algorithms and Applications, Computational Geometry, Discrete & Computational Geometry, Lecture notes in computer science 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