Subgraph isomorphism in planar graphs and related problems. Eppstein, David — 1999 Journal of Graph Algorithms and Applications
Small maximal independent sets and faster exact graph coloring. Eppstein, David — 2003 Journal of Graph Algorithms and Applications
Densities of minor-closed graph families. Eppstein, David — 2010 The Electronic Journal of Combinatorics [electronic only]
Cubic partial cubes from simplicial arrangements. Eppstein, David — 2006 The Electronic Journal of Combinatorics [electronic only]
Upright-quad drawing of st-planar learning spaces. Eppstein, David — 2008 Journal of Graph Algorithms and Applications
The traveling salesman problem for cubic graphs. Eppstein, David — 2007 Journal of Graph Algorithms and Applications
Fast approximation of centrality. Eppstein, David; Wang, Joseph — 2004 Journal of Graph Algorithms and Applications
The Fibonacci dimension of a graph. Cabello, Sergio; Eppstein, David; Klavžar, Sandi — 2011 The Electronic Journal of Combinatorics [electronic only]
Geometric thickness of complete graphs. Dillencourt, Michael B.; Eppstein, David; Hirschberg, Daniel S. — 2000 Journal of Graph Algorithms and Applications
Confluent drawings: visualizing non-planar diagrams in a planar way. Dickerson, Matthew; Eppstein, David; Goodrich, Michael T.; Meng, Jeremy Y. — 2005 Journal of Graph Algorithms and Applications