#### Filter Results:

- Full text PDF available (167)

#### Publication Year

1979

2019

- This year (33)
- Last 5 years (106)
- Last 10 years (211)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- David Eppstein
- FOCS
- 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… (More)

- David Eppstein
- J. Graph Algorithms Appl.
- 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… (More)

- Marshall W. Bern, David Eppstein, John R. Gilbert
- J. Comput. Syst. Sci.
- 1990

We survey the computational geometry relevant to nite element mesh generation. We especially focus on optimal triangulations of geometric domains in two-and three-dimensions. An optimal triangulation… (More)

- Nina Amenta, Marshall W. Bern, David Eppstein
- Graphical Models and Image Processing
- 1998

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 the curve,… (More)

- David Eppstein
- FOCS
- 1992

- David Eppstein
- Algorithmica
- 2000

It is known that any planar graph with diameter D has treewidth O(D) , and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar… (More)

- David Eppstein
- SIAM J. Comput.
- 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… (More)

- David Eppstein, Jeff Erickson
- Discrete & Computational Geometry
- 1998

The straight skeleton of a polygon is a variant of the medial axis introduced by Aichholzer et al., de ned by a shrinking process in which each edge of the polygon moves inward at a xed rate. We… (More)

- David Eppstein, Michael T. Goodrich, Frank Uyeda, George Varghese
- SIGCOMM
- 2011