List of works by David Eppstein

3-coloring in time

All maximal independent sets and dynamic dominance for sparse graphs

Approximating Center Points with Iterative Radon Points

scholarly article by Kenneth L. Clarkson et al published September 1996 in International Journal of Computational Geometry and Applications

Area-Universal and Constrained Rectangular Layouts

article by David Eppstein et al published January 2012 in SIAM Journal on Computing

Area-universal rectangular layouts

Combinatorics and Geometry of Finite and Infinite Squaregraphs

scientific article (publication date: 2010)

Deterministic sampling and range counting in geometric data streams

Distance-sensitive planar point location

Edges and switches, tunnels and bridges

Finding the k smallest spanning trees

article published in 1992

Fixed Parameter Tractability of Crossing Minimization of Almost-Trees

article by Michael J. Bannister et al published 2013 in Lecture Notes in Computer Science

Geometric Thickness of Complete Graphs

scientific article published in 2000

Growth and Decay in Life-Like Cellular Automata

Improved Grid Map Layout by Point Set Matching

Improved grid map layout by point set matching

Isometric Diamond Subgraphs

Linear complexity hexahedral mesh generation

scientific article (publication date: 1996)

Listing All Maximal Cliques in Large Sparse Real-World Graphs

Maintenance of a minimum spanning forest in a dynamic plane graph

Metric Dimension Parameterized by Max Leaf Number

article published in 2015

On Nearest-Neighbor Graphs

On the Planar Split Thickness of Graphs

scientific article published on 2 June 2017

Optimal Angular Resolution for Face-Symmetric Drawings

PREFACE: Festschrift for Zvi Galil

Parallel Construction of Quadtrees and Quality Triangulations

Parallel recognition of series-parallel graphs

scientific article (publication date: May 1992)

Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation

scientific article (publication date: June 2010)

Planar orientations with low out-degree and compaction of adjacency matrices

article published in 1991

Reset Sequences for Monotonic Automata

scientific article (publication date: June 1990)

Selected Open Problems in Graph Drawing

Separating thickness from geometric thickness

scientific article published in 2004

Separator Based Sparsification

article published in 1996

Separator-Based Sparsification II: Edge and Vertex Connectivity

scientific article published in 1998

Small Maximal Independent Sets and Faster Exact Graph Coloring

Spanning Trees in Multipartite Geometric Graphs

scientific article published in 2018

Sparse dynamic programming I: linear cost functions

Sparse dynamic programming II: convex and concave cost functions

Sparsification---a technique for speeding up dynamic graph algorithms

Straight Skeletons of Three-Dimensional Polyhedra

Studying (non-planar) road networks through an algorithmic lens

scientific article

Subgraph Isomorphism in Planar Graphs and Related Problems

Tangent Spheres and Triangle Centers

scientific article (publication date: 2001)

Testing bipartiteness of geometric intersection graphs

The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing

The Crust and the β-Skeleton: Combinatorial Curve Reconstruction

article published in 1998

The Effect of Faults on Network Expansion

The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing

scientific article (publication date: 2009)

The Traveling Salesman Problem for Cubic Graphs

The expected extremes in a Delaunay triangulation

scientific article published in March 1991

The geometric thickness of low degree graphs

The lattice dimension of a graph

Trees with Convex Faces and Optimal Angles

Ununfoldable polyhedra with convex faces

Worst-case bounds for subadditive geometric graphs