David Eppstein

*J. Graph Algorithms & Applications* 3(3):1–27, 1999

*Proc. 6th Symp. Discrete Algorithms*, ACM
and SIAM, Jan 1995, pp. 632–640

Tech. report 94-25, Univ. of California, Irvine, Dept. of Information and Computer Science, 1994

ACM Computing Research Repository, cs.DS/9911003

*Mathematical Reviews* 95m:05178

*Mathematical Reviews* 2001b:05154

http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-94-25.pdf

Cited by:

- Color-coding
- Finding and counting given length cycles
- On triangulating planar graphs under the four-connectivity constraint
- A more compact visibility representation
- A unified approach to approximation problems for NP- and PSPACE-hard problems for geometric graphs
- Synthesis of design concepts from a design for assembly perspective
- Conceptual level design for assembly analysis using state transitional approach
- Local tree-width, excluded minors, and approximation algorithms
- Deciding first-order properties of locally tree-decomposable graphs
- Deciding first order properties of locally tree-decomposable structures
- Computing the girth of a planar graph
- A meta-algorithm for the generation of referring expressions
- Short path queries in planar graphs in constant time
- Graph-based generation of referring expressions
- Subgraph isomorphism, log-bounded fragmentation and graphs of (locally) bounded treewidth
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems
- Towards a predictive computational complexity theory
- Equivalence of local treewidth and linear local treewidth and its algorithmic applications
- Efficient extraction of mapping rules of atoms from enzymatic reaction data
- A segmentation system with model assisted completion of video objects
- Algorithms for Graphs of (Locally) Bounded Treewidth
- Faster subtree isomorphism
- Easy Instances for Model Checking
- Short cycles in planar graphs
- Chordal embeddings of planar graphs
- Effective rule induction from molecular structures represented by labeled graphs
- Recognition of user-defined video object models using weighted graph homomorphisms
- Interpreting sloppy stick figures by graph rectification and constraint-based matching
- Treewidth: algorithmic techniques and results
- A note on the bounded fragmentation property and its applications in network reliability
- Bidimensionality: new connections between FPT algorithms and PTASs
- Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
- Oracles for bounded-length shortest paths in planar graphs
- Digraph measures: Kelly decompositions, games, and orderings