David Eppstein

David Eppstein

University of California, Irvine

H-index: 74

North America-United States

About David Eppstein

David Eppstein, With an exceptional h-index of 74 and a recent h-index of 33 (since 2020), a distinguished researcher at University of California, Irvine, specializes in the field of algorithms, data structures, graph theory, geometry.

His recent articles reflect a diverse array of research interests and contributions to the field:

Maintaining Light Spanners via Minimal Updates

Non-Euclidean Erd\H {o} s--Anning Theorems

Games on Game Graphs

Locked and unlocked smooth embeddings of surfaces

Quasipolynomiality of the Smallest Missing Induced Subgraph

Lower Bounds for Non-adaptive Shortest Path Relaxation

Geometric dominating sets-a minimum version of the No-Three-In-Line Problem

On the complexity of embedding in graph products

David Eppstein Information

University

Position

Distinguished Professor of Computer Science

Citations(all)

22961

Citations(since 2020)

5145

Cited By

20009

hIndex(all)

74

hIndex(since 2020)

33

i10Index(all)

249

i10Index(since 2020)

123

Email

University Profile Page

Google Scholar

David Eppstein Skills & Research Interests

algorithms

data structures

graph theory

geometry

Top articles of David Eppstein

Title

Journal

Author(s)

Publication Date

Maintaining Light Spanners via Minimal Updates

arXiv preprint arXiv:2403.03290

Hadi Khodabandeh

David Eppstein

2024/3/5

Non-Euclidean Erd\H {o} s--Anning Theorems

arXiv preprint arXiv:2401.06328

David Eppstein

2024/1/12

Games on Game Graphs

2024 Joint Mathematics Meetings (JMM 2024)

David Eppstein

2024/1/3

Locked and unlocked smooth embeddings of surfaces

Computing in Geometry and Topology

David Eppstein

2023

Quasipolynomiality of the Smallest Missing Induced Subgraph

arXiv preprint arXiv:2306.11185

David Eppstein

Andrea Lincoln

Virginia Vassilevska Williams

2023/6/19

Lower Bounds for Non-adaptive Shortest Path Relaxation

David Eppstein

2023/8/28

Geometric dominating sets-a minimum version of the No-Three-In-Line Problem

Computational Geometry

Oswin Aichholzer

David Eppstein

Eva-Maria Hainzl

2023/1/1

On the complexity of embedding in graph products

arXiv preprint arXiv:2303.17028

Therese Biedl

David Eppstein

Torsten Ueckerdt

2023/3/29

Three-dimensional graph products with unbounded stack-number

Discrete & Computational Geometry

David Eppstein

Robert Hickingbotham

Laura Merker

Sergey Norin

Michał T Seweryn

...

2023/2/18

Rapid mixing for the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs

David Eppstein

Daniel Frishberg

2023

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

David Eppstein

2023

Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs

Alvin Chiu

David Eppstein

Michael T Goodrich

2023

Angles of Arc-Polygons and Lombardi Drawings of Cacti

Computational Geometry

David Eppstein

Daniel Frishberg

Martha C Osegueda

2023

On the Biplanarity of Blowups

David Eppstein

2023

Geometric Graphs with Unbounded Flip-Width

David Eppstein

Rose McCarty

2023

Multifold Tiles of Polyominoes and Convex Lattice Polygons: Discrete and Computational Geometry, Graphs, and Games

Thai Journal of Mathematics

Kota Chida

Erik D Demaine

Martin L Demaine

David Eppstein

Adam Hesterberg

...

2023/12/31

A Stronger Lower Bound on Parametric Minimum Spanning Trees

Algorithmica

David Eppstein

2023

Improved mixing for the convex polygon triangulation flip walk

David Eppstein

Daniel Frishberg

2023

A Parameterized Algorithm for Flat Folding

David Eppstein

2023

The complexity of iterated reversible computation

TheoretiCS

David Eppstein

2023/12/26

See List of Professors in David Eppstein University(University of California, Irvine)

Co-Authors

academic-engine