• Publications
  • Influence
Finding the k shortest paths
  • D. Eppstein
  • Mathematics, Computer Science
  • Proceedings 35th Annual Symposium on Foundations…
  • 20 November 1994
TLDR
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Expand
  • 740
  • 71
  • PDF
The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction
TLDR
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
  • 461
  • 54
  • PDF
Finding the k Shortest Paths
  • D. Eppstein
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 15 February 1999
TLDR
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
  • 915
  • 47
  • PDF
Reset Sequences for Monotonic Automata
  • D. Eppstein
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 June 1990
TLDR
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
  • 232
  • 34
  • PDF
Provably good mesh generation
TLDR
Several versions of the problem of generating triangular meshes for finite-element methods are studied. Expand
  • 304
  • 30
  • PDF
MESH GENERATION AND OPTIMAL TRIANGULATION
  • 496
  • 27
Listing All Maximal Cliques in Large Sparse Real-World Graphs
TLDR
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
  • 220
  • 27
  • PDF
Subgraph isomorphism in planar graphs and related problems
  • D. Eppstein
  • Mathematics, Computer Science
  • SODA '95
  • 22 January 1995
TLDR
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Expand
  • 480
  • 25
  • PDF
Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions
TLDR
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
  • 170
  • 25
  • PDF
Diameter and Treewidth in Minor-Closed Graph Families
  • D. Eppstein
  • Mathematics, Computer Science
  • Algorithmica
  • 20 July 1999
TLDR
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
  • 283
  • 24
  • PDF