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
Finding Large Clique Minors is Hard
TL;DR: In this article, it was shown that it is NP-hard to determine whether a given graph G contains a complete graph Kh as a minor, given a graph G and a parameter h.
Proceedings ArticleDOI
Improved grid map layout by point set matching
TL;DR: The representation of a set of regions as a grid a grid map is presented, which allows for easy representation of extra information about the regions in the grid.
Proceedings ArticleDOI
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection
TL;DR: New dynamic set intersection data structures, which are called 2-3 cuckoo filters and hash tables, are introduced, demonstrating the utility of these structures by using them in improved algorithms for listing triangles and answering set intersection queries in internal or external memory.
Proceedings ArticleDOI
Guard placement for efficient point-in-polygon proofs
TL;DR: There is a polygon P such that a "natural" angle-guard vertex placement cannot fully distinguish between pointson the inside and outside of P, which implies that Steiner-point guards are sometimes necessary and it is shown how to find in polynomial time a guard placement whose size is within a factor of 2 of the optimal number for any particular polygon.
Journal ArticleDOI
Testing bipartiteness of geometric intersection graphs
TL;DR: In this paper, the bipartiteness of an intersection graph of n line segments or simple polygons in the plane was shown to return either a bipartition of the input or an odd cycle in its intersection graph.