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
The geometric thickness of low degree graphs
TL;DR: It is proved that the geometric thickness of graphs whose maximum degree is no more than four is two, and an embedding algorithm for graphs with maximum degree three that uses an n x n grid and a more complex algorithm for embedding a graph withmaximum degree four.
Journal ArticleDOI
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes
TL;DR: Efficient nonadaptive and two-stage combinatorial group testing algorithms, which identify the at most $d$ items out of a given set of $n$ items that are defective, using fewer tests for all practical set sizes are presented.
Proceedings ArticleDOI
Parametric and kinetic minimum spanning trees
TL;DR: This work considers the parametric minimum spanning tree problem, in which a graph is given a graph with edge weights that are linear functions of a parameter /spl lambda/ and wish to compute the sequence of minimum spanning trees generated as /spl Lambda/ varies.
Journal ArticleDOI
Motorcycle graphs: canonical quad mesh partitioning
TL;DR: Algorithms for canonically partitioning semi‐regular quadrilateral meshes into structured submeshes using an adaptation of the geometric motorcycle graph of Eppstein and Erickson to quad meshes are described, which may be used to efficiently find isomorphisms between quad meshes.
Journal ArticleDOI
Edge insertion for optimal triangulations
TL;DR: An abstract view of the edge insertion paradigm is presented, and it is shown that it gives polynomial-time algorithms for several types of optimal triangulations, including minimizing the maximum slope of a piecewise-linear interpolating surface.