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
Book ChapterDOI
Finding the k smallest spanning trees
TL;DR: The algorithm for general graphs takes time O(mlogβ(m, n)+k2); for planar graphs this bound can be improved to O(n+k2), and the k best spanning trees for a set of points in the plane can be computed in time O.
Proceedings ArticleDOI
Skip-webs: efficient distributed data structures for multi-dimensional data sets
TL;DR: In this paper, the skip-webs data structure is proposed for multi-dimensional data querying, which can be extended to linear (one-dimensional) data, such as sorted sets, as well as multidimensional data such as d-dimensional octrees and digital tries of characters defined over a fixed alphabet.
Proceedings ArticleDOI
Steinitz theorems for orthogonal polyhedra
David Eppstein,Elena Mumford +1 more
TL;DR: The graphs of simple orthogonal polyhedra are exactly the 3-regular bipartite planar graphs in which the removal of any two vertices produces at most two connected components.
Proceedings Article
Hinged dissections of polyominoes and polyforms.
TL;DR: In this paper, a hinged dissection of all edge-to-edge gluings of n congruent copies of a polygon P that join corresponding edges of P is presented.
Proceedings Article
3-Coloring in Time O(1.3446 n ): A No-MIS Algorithm.
Richard Beigel,David Eppstein +1 more