Faculty

Institution

Unit

Venue

David Eppstein

Distinguished Professor

University of California, Irvine

Affiliations

Donald Bren School of Information and Computer Sciences

Department of Computer Science

David Eppstein is currently serving as a Computer Science Distinguished Professor at University of California, Irvine.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

David Eppstein

University of California, Irvine

Distinguished Professor

You can click a keyword to filter the displayed items

applied mathematics computer science graph theory computational geometry machine learning geometry data science discrete mathematics combinatorics mathematics discrete geometry graph drawing geometric modeling theoretical computer science graph processing discrete algorithms graph algorithms combinatorial theory geometric topology graph analysis geometric graph theory combinatorial optimization geometry processing computational optimization scientific computing planar graphs mathematical optimization geometric algorithms extremal graph theory numerical algorithms polyhedron information visualization empirical algorithmics topological graph theory discrete differential geometry computational topology algebraic graph theory numerical simulations machine vision algorithm design sparse representations enumerative combinatorics dynamic programming parameterized algorithms metric graph theory optimization problems computer graphics mathematical programming dynamic data structure colorization topological combinatorics combinatorial designs sequence analysis graphical models dynamic graph algorithms efficient algorithms motorcycle graphs geometric thickness computational intelligence computer-aided design trajectory optimization route planning information theory color correction mesh generation minor-closed graph families data structure series-parallel graphs skip quadtree media theory knowledge spaces center points minimum spanning forest quasiconvex analysis polynomial area minimum spanning trees

Notable Scholarly Works

Notable Federal Grants

Collaborators

Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. Algorithmica (2024)

David Eppstein

computer sciencenon-crossing hamiltonian pathsoutput-polynomial time

Product Structure Extension of the Alon–Seymour–Thomas Theorem. SIAM Journal on Discrete Mathematics (2024)

Marc DistelVida DujmovićDavid EppsteinRobert HickingbothamGwenaël JoretPiotr MicekPat MorinMichał T. SewerynDavid R. Wood

discrete mathematicsgraph theoryapplied mathematicsalon-seymour-thomas theoremproduct structure extension

Angles of Arc-Polygons and Lombardi Drawings of Cacti. Computational Geometry (2023)

David EppsteinDaniel FrishbergMartha C. Osegueda

computational geometrylombardi drawingsapplied mathematics

Orthogonal Dissection Into Few Rectangles. Discrete & Computational Geometry (2023)

David Eppstein

discrete geometryorthogonal dissectiondiscrete mathematicsgeometryfew rectanglescomputational geometry

The Complexity of Iterated Reversible Computation. TheoretiCS (2023)

David Eppstein

computational sciencecomplexity reductioncomputer sciencecomputational complexitycomplexity theorycomputational complexity theoryscientific computingtheory of computationcomplexity sciencecomputability theorycomputational optimizationapplied mathematicsiterated reversible computation

Three-Dimensional Graph Products With Unbounded Stack-Number. Discrete & Computational Geometry (2023)

David EppsteinRobert HickingbothamLaura MerkerSergey NorinMichał T. SewerynDavid R. Wood

discrete geometrygraph theoryunbounded stack-numberthree-dimensional graph productsapplied mathematicscomputational geometry

A Stronger Lower Bound on Parametric Minimum Spanning Trees. Algorithmica (2022)

David Eppstein

computer sciencestronger lower boundtheoretical computer scienceparametric programminglower boundsalgorithmic development

Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics. (2022)

David EppsteinHadi Khodabandeh

graph theoryunit ball graphsbrief announcementapplied mathematics

Finding Relevant Points for Nearest-Neighbor Classification. Society for Industrial and Applied Mathematics eBooks (2022)

David Eppstein

mathematical analysisnearest-neighbor classificationrelevant pointsautomatic classificationpattern recognitionclassification methodmachine learningranking algorithmssimilarity searchdata classificationdata sciencedata miningapplied mathematicsmachine learning researchmathematics

Geometric Dominating Sets. arXiv (Cornell University) (2022)

Oswin AichholzerDavid EppsteinEva-Maria Hainzl

topologygraph theoryapplied mathematicsgeometrygeometric graph theory

1
2
3
4
5
37
10 / page

David Eppstein

Distinguished Professor

University of California, Irvine

Affiliations

Donald Bren School of Information and Computer Sciences

Department of Computer Science

David Eppstein is currently serving as a Computer Science Distinguished Professor at University of California, Irvine.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

David Eppstein

University of California, Irvine

Distinguished Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. Algorithmica (2024)

David Eppstein

computer sciencenon-crossing hamiltonian pathsoutput-polynomial time

Product Structure Extension of the Alon–Seymour–Thomas Theorem. SIAM Journal on Discrete Mathematics (2024)

Marc DistelVida DujmovićDavid EppsteinRobert HickingbothamGwenaël JoretPiotr MicekPat MorinMichał T. SewerynDavid R. Wood

discrete mathematicsgraph theoryapplied mathematicsalon-seymour-thomas theoremproduct structure extension

Angles of Arc-Polygons and Lombardi Drawings of Cacti. Computational Geometry (2023)

David EppsteinDaniel FrishbergMartha C. Osegueda

computational geometrylombardi drawingsapplied mathematics

Orthogonal Dissection Into Few Rectangles. Discrete & Computational Geometry (2023)

David Eppstein

discrete geometryorthogonal dissectiondiscrete mathematicsgeometryfew rectanglescomputational geometry

The Complexity of Iterated Reversible Computation. TheoretiCS (2023)

David Eppstein

Three-Dimensional Graph Products With Unbounded Stack-Number. Discrete & Computational Geometry (2023)

David EppsteinRobert HickingbothamLaura MerkerSergey NorinMichał T. SewerynDavid R. Wood

discrete geometrygraph theoryunbounded stack-numberthree-dimensional graph productsapplied mathematicscomputational geometry

A Stronger Lower Bound on Parametric Minimum Spanning Trees. Algorithmica (2022)

David Eppstein

computer sciencestronger lower boundtheoretical computer scienceparametric programminglower boundsalgorithmic development

Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics. (2022)

David EppsteinHadi Khodabandeh

graph theoryunit ball graphsbrief announcementapplied mathematics

Finding Relevant Points for Nearest-Neighbor Classification. Society for Industrial and Applied Mathematics eBooks (2022)

David Eppstein

Geometric Dominating Sets. arXiv (Cornell University) (2022)

Oswin AichholzerDavid EppsteinEva-Maria Hainzl

topologygraph theoryapplied mathematicsgeometrygeometric graph theory

1
2
3
4
5
37
10 / page

Similar Faculty Members

Michael T. Goodrich

Institution

University of California, Irvine

information technology

data security

Subhash Suri

Institution

University of California, Santa Barbara

computational geometry

computational paradigm

Pankaj K. Agarwal

Institution

Duke University

geocomputation

computational geometry

Steven Skiena

Institution

Stony Brook University

memetic computing

big data

Stephen Kobourov

Institution

University of Arizona

algorithm design

discrete algorithm

Sanjeev Khanna

Institution

University of Pennsylvania

discrete algorithm

combinatorial problem

Xianfeng David Gu

Institution

Stony Brook University

scientific computing

geometric modeling

Anupam Gupta

Institution

New York University

computational optimization

mathematical optimization

Bart Selman

Institution

Cornell University

computational statistic

statistics

Denis Zorin

Institution

New York University

engineering

numerical mathematics

Similar Faculty Members

Michael T. Goodrich

Institution

University of California, Irvine

information technology

data security

Subhash Suri

Institution

University of California, Santa Barbara

computational geometry

computational paradigm

Pankaj K. Agarwal

Institution

Duke University

geocomputation

computational geometry

Steven Skiena

Institution

Stony Brook University

memetic computing

big data

Stephen Kobourov

Institution

University of Arizona

algorithm design

discrete algorithm

Sanjeev Khanna

Institution

University of Pennsylvania

discrete algorithm

combinatorial problem

Xianfeng David Gu

Institution

Stony Brook University

scientific computing

geometric modeling

Anupam Gupta

Institution

New York University

computational optimization

mathematical optimization

Bart Selman

Institution

Cornell University

computational statistic

statistics

Denis Zorin

Institution

New York University

engineering

numerical mathematics