321 citations · 2k across the 200 of their papers we have counts for
4 papers · 2 filters
Crossing Patterns in Nonplanar Road Networks
David Eppstein, Siddharth Gupta
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacen…
Defining Equitable Geographic Districts in Road Networks via Stable Matching
David Eppstein, Michael Goodrich, Doruk Korkmaz +1
We introduce a novel method for defining geographic districts in road networks using stable matching. In this approach, each geographic district is defined in terms of a center, wh…
Algorithms for Stable Matching and Clustering in a Grid
David Eppstein, Michael T. Goodrich, Nil Mamano
We study a discrete version of a geometric stable marriage problem originally proposed in a continuous setting by Hoffman, Holroyd, and Peres, in which points in the plane are stab…
-Best Solutions of MSO Problems on Tree-Decomposable Graphs
David Eppstein, Denis Kurz
We show that, for any graph optimization problem in which the feasible solutions can be expressed by a formula in monadic second-order logic describing sets of vertices or edges an…