D. Eppstein

Publications
Influence

D. Eppstein
Mathematics, Computer Science
Proceedings 35th Annual Symposium on Foundations…
20 November 1994

We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Expand

The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction

N. Amenta, Marshall W. Bern, D. Eppstein
Computer Science, Mathematics
Graph. Model. Image Process.
1 March 1998

We construct a graph on a planar point set that captures its shape in the following sense: if a smooth curve is sampled densely enough, the graph on the samples is a polygonalization of the curve, with no extraneous edges. Expand

Finding the k Shortest Paths

D. Eppstein
Mathematics, Computer Science
SIAM J. Comput.
15 February 1999

We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph, improving by an order of magnitude previously known bounds. Expand

Reset Sequences for Monotonic Automata

D. Eppstein
Mathematics, Computer Science
SIAM J. Comput.
1 June 1990

Natarajan reduced the problem of designing a certain type of mechanical parts orienter to that of finding reset sequences for monotonic deterministic finite automata when all states are initially possible. Expand

Provably good mesh generation

Marshall W. Bern, D. Eppstein, J. Gilbert
Computer Science
Proceedings [] 31st Annual Symposium on…
1990

Several versions of the problem of generating triangular meshes for finite-element methods are studied. Expand

MESH GENERATION AND OPTIMAL TRIANGULATION

Marshall W. Bern, D. Eppstein
Computer Science
1 September 1992

Listing All Maximal Cliques in Large Sparse Real-World Graphs

D. Eppstein, Darren Strash
Computer Science, Mathematics
SEA
1 March 2011

We implement a new algorithm for listing all maximal cliques in sparse graphs due to Eppstein, Loffler, and Strash, and analyze its performance on a large corpus of real-world graphs. Expand

Subgraph isomorphism in planar graphs and related problems

D. Eppstein
Mathematics, Computer Science
SODA '95
22 January 1995

We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Expand

Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions

D. Eppstein, Jeff Erickson
Mathematics, Computer Science
SCG '98
7 June 1998

The straight skeleton of a polygon is a variant of the medial axis introduced by Aichholzer et al., defined by a shrinking process in which each edge of the polygon moves inward at a fixed rate. Expand

Diameter and Treewidth in Minor-Closed Graph Families

D. Eppstein
Mathematics, Computer Science
Algorithmica
20 July 1999

We show that treewidth is bounded by a function of the diameter in a minor-closed family, if and only if some apex graph does not belong to the family. Expand

Recommended Authors