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
Parameterized complexity of 1-planarity
TL;DR: The parameterized complexity of the problem of finding a 1-planar drawing for a general graph is investigated with respect to the vertex cover number, tree-depth, and cyclomatic number, and fixed-parameter tractable algorithms are constructed.
k -Best Enumeration.
TL;DR: In this article, the authors survey k-best enumeration problems and the algorithms for solving them, including the problems of finding the k shortest paths, k smallest spanning trees, and k best matchings in weighted graphs.
Journal ArticleDOI
Upright-Quad Drawing of st-Planar Learning Spaces
TL;DR: In this paper, the authors consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from antimatroids and used to model states of knowledge of students, and show how to draw any st-planar learning space so all internal faces are convex quadrilaterals with the bottom side horizontal and the left side vertical, with one minimal and one maximal vertex.
Book ChapterDOI
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
TL;DR: Galoois theory is used to show that many variants of these problems have solutions that cannot be expressed by nested radicals or nested roots of low-degree polynomials, and that such solutions cannot be computed exactly even in extended computational models that include such operations.
Posted Content
Balanced Circle Packings for Planar Graphs
TL;DR: In this paper, the authors studied balanced circle packings and circle contact representations for planar graphs, where the ratio of the largest circle's diameter to the smallest circle diameter is polynomial in the number of circles.