61 citations · 145 across the 18 of their papers we have counts for
18 papers
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
Michael J. Bannister, William E. Devanny, David Eppstein +1
Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. How…
Planar Induced Subgraphs of Sparse Graphs
Glencora Borradaile, David Eppstein, Pingan Zhu
We show that every graph has an induced pseudoforest of at least vertices, an induced partial 2-tree of at least vertices, and an induced planar subgraph of at le…
Superpatterns and Universal Point Sets
Michael J. Bannister, Zhanpeng Cheng, William E. Devanny +1
An old open problem in graph drawing asks for the size of a universal point set, a set of points that can be used as vertices for straight-line drawings of all n-vertex planar grap…
Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity
David Eppstein
We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n^{7/6}). No known input causes ou…
Lombardi Drawings of Graphs
Christian A. Duncan, David Eppstein, Michael T. Goodrich +2
We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as…
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
Erin W. Chambers, David Eppstein, Michael T. Goodrich +1
We study the classic graph drawing problem of drawing a planar graph using straight-line edges with a prescribed convex polygon as the outer face. Unlike previous algorithms for th…