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 wellgradedness of a union-closed family
TL;DR: In this paper, necessary and sufficient conditions on the base of a union-closed set family that ensures that the family is well-graded are given. And they also provide algorithms for efficiently testing these conditions, and for augmenting a set family in a minimal way.
Posted Content
Stack-number is not bounded by queue-number
TL;DR: A family of graphs with queue-number at most 4 but unbounded stack-number is described, which resolves open problems of Heath, Leighton and Rosenberg (1992) and Blankenship and Oporowski (1999).
Posted Content
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection
TL;DR: It is shown that the more general problem of scheduling autonomous platoons through an intersection that includes both a-way merge, for non-constant $k$, and a crossing of two-way traffic is NP-complete.
Proceedings ArticleDOI
Minimum forcing sets for Miura folding patterns
TL;DR: In this paper, the authors introduce the study of forcing sets in mathematical origami, where the origami material folds flat along straight line segments called creases, each of which is assigned a folding direction of mountain or valley.
Proceedings ArticleDOI
Paired approximation problems and incompatible inapproximabilities
TL;DR: This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems, and finds either a (1 + e)-approximation to (1, 2)-TSP or a 1/e-approximating to maximum independent set, from a given graph, in linear time.