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
Posted Content
Planar Lombardi Drawings for Subcubic Graphs
TL;DR: In this paper, it was shown that every planar cubic graph with maximum degree three has a Lombardi drawing in which the edges are drawn as circular arcs that meet at equal angles around every vertex.
Posted Content
Fixed parameter tractability of crossing minimization of almost-trees
TL;DR: In this paper, the authors investigated exact crossing minimization for graphs that differ from trees by a small number of additional edges, and provided fixed parameter tractable algorithms for the 1-page book crossing number.
Fast optimal parallel algorithms for maximal matching in sparse graphs
TL;DR: This work presents optimal parallel algorithms to find maximal matchings in two classes of sparse graphs, namely, graphs with bou.nded degree and those which, for some p, are forbidden to have the clique Kp as a minor.
Posted Content
Some Polycubes Have No Edge Zipper Unfolding
TL;DR: This paper constructs polycubes that have no *edge zipper unfolding* where the cut edges are further restricted to form a path.
Principles of Graph drawing
TL;DR: Some of my own recent research in graph drawing is described, and some general principles gleaned from that research are discussed, to develop systems for the automatic layout of these drawings.