D
David Eppstein
Researcher at University of California, Irvine
Publications - 689
Citations - 21750
David Eppstein is an academic researcher from University of California, Irvine. The author has contributed to research in topics: Planar graph & Time complexity. The author has an hindex of 67, co-authored 672 publications receiving 20584 citations. Previous affiliations of David Eppstein include McGill University & University of Passau.
Papers
More filters
Proceedings ArticleDOI
Improved mixing for the convex polygon triangulation flip walk
David Eppstein,Daniel Frishberg +1 more
TL;DR: In this paper , it was shown that the triangulation flip walk on a convex point set mixes in time O(n^3 log n log n) and O(1/sqrt n) for the expansion of the associahedron graph K_n.
Journal ArticleDOI
The Parametric Closure Problem
TL;DR: The parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights, is defined and polynomial time solutions to many important special cases of this problem are given including semiorders, reachability orders of bounded-treewidth graphs, partial Orders of bounded width, and series-parallel partial orders.
Posted Content
Crossing Patterns in Nonplanar Road Networks
David Eppstein,Siddharth Gupta +1 more
TL;DR: It is proved theoretically that when an embedded graph has a sparse crossing graph, it has other desirable properties that lead to fast algorithms for shortest paths and other algorithms important in geographic information systems.
Journal ArticleDOI
The Effect of Planarization on Width
TL;DR: In this paper, the effects of planarization on graph width and treewidth were studied for graphs of bounded degree, and it was shown that for tree-depth and tree-width, there exists a family of graphs with bounded parameter value, all of whose planarizations have parameter value Θ(n) and all of which have a planarisation of linear size whose parameter value remains bounded.
Proceedings Article
Folding Polyominoes into (Poly)Cubes.
Oswin Aichholzer,Michael Biro,Erik D. Demaine,Martin L. Demaine,David Eppstein,Sándor P. Fekete,Adam Hesterberg,Irina Kostitsyna,Christiane Schmidt +8 more
TL;DR: In this paper, the authors study the problem of folding a polyomino P into a polycube Q, allowing faces of Q to be covered multiple times, and define a variety of folding models according to whether the folds (a) mu...