# D. Eppstein

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Finding the k shortest paths

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

We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a… 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

Abstract We construct a graph on a planar point set, which captures its shape in the following sense: if a smooth curve is sampled densely enough, the graph on the samples is a polygonalization of… Expand

Finding the k Shortest Paths

- D. Eppstein
- Computer Science, Mathematics
- 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. Our algorithms output an implicit representation of these paths in a… Expand

Reset Sequences for Monotonic Automata

- D. Eppstein
- Computer Science, Mathematics
- 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. He gave algorithms that in… 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. It is shown how to triangulate a planar point set or a polygonally bounded domain with… Expand

MESH GENERATION AND OPTIMAL TRIANGULATION

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

Subgraph isomorphism in planar graphs and related problems

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

We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small… Expand

Sparsification-a technique for speeding up dynamic graph algorithms

- D. Eppstein, Z. Galil, G. Italiano, Amnon Nissenzweig
- Computer Science
- Proceedings., 33rd Annual Symposium on…
- 24 October 1992

The authors provide data structures that maintain a graph as edges are inserted and deleted, and keep track of the following properties: minimum spanning forests, best swap, graph connectivity, and… 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. We… Expand

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 (ISAAC 2010) and analyze its performance on a large corpus of real-world graphs. Our… Expand