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
Journal ArticleDOI
On Verifying and Engineering the Well-gradedness of a Union-closed Family
TL;DR: This work gives necessary and sufficient conditions on the base of a union-closed set family that ensures that the family is well-graded, and provides algorithms for efficiently testing these conditions and for augmenting a set family in a minimal way, to one that satisfies these conditions.
Posted ContentDOI
Planar and Poly-Arc Lombardi Drawings
TL;DR: This work gives an example of a planar 3-tree that has no planar Lombardi drawing and shows that all outerpaths do have a planars Lombardi Drawing, and generalizes the notion of Lombardi drawings to that of (smooth) $k-Lombardi drawings, in which each edge may be drawn as a (differentiable) sequence of circular arcs.
Posted ContentDOI
Approximate Greedy Clustering and Distance Selection for Graph Metrics
TL;DR: This paper considers two important problems defined on finite metric spaces, and provides efficient new algorithms and approximation schemes for these problems on inputs given as graph shortest path metrics or high-dimensional Euclidean metrics.
Posted Content
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
TL;DR: Wear-leveling techniques for cuckoo hashing are studied, showing that it is possible to achieve a memory wear bound of loglogn + O(1) after the insertion of n items into a table of size Cn for a suitable constant C using cuckoos hashing.
Book ChapterDOI
Genus, Treewidth, and Local Crossing Number
TL;DR: It is shown that an n-vertex graph embedded on a surface of genus g with at most k crossings per edge has treewidth g+1k+1n and that these bounds are tight upi¾?to a constant factor.