The following pages link to David Eppstein (Q283880):
Displaying 50 items.
- Distance-sensitive planar point location (Q283883) (← links)
- Dynamic connectivity in digital images (Q290227) (← links)
- (Q386905) (redirect page) (← links)
- Category-based routing in social networks: membership dimension and the small-world phenomenon (Q386908) (← links)
- (Q405307) (redirect page) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures (Q443712) (← links)
- A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing (Q471143) (← links)
- (Q540034) (redirect page) (← links)
- The Fibonacci dimension of a graph (Q540035) (← links)
- Densities of minor-closed graph families (Q612915) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q832875) (← links)
- The effect of faults on network expansion (Q863198) (← links)
- Cubic partial cubes from simplicial arrangements (Q869992) (← links)
- Minimum dilation stars (Q871060) (← links)
- Confluent layered drawings (Q879954) (← links)
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
- Ramified rectilinear polygons: coordinatization by dendrons (Q908206) (← links)
- Algorithms for media (Q947070) (← links)
- Edges and switches, tunnels and bridges (Q1028235) (← links)
- On verifying and engineering the wellgradedness of a union-closed family (Q1042303) (← links)
- Manhattan orbifolds (Q1044880) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- Equipartitions of graphs (Q1182860) (← links)
- Finding minimum area \(k\)-gons (Q1186081) (← links)
- The farthest point Delaunay triangulation minimizes angles (Q1188284) (← links)
- Finding the \(k\) smallest spanning trees (Q1196455) (← links)
- Parallel recognition of series-parallel graphs (Q1201288) (← links)
- Improved bounds for intersecting triangles and halving planes (Q1208053) (← links)
- (Q1275669) (redirect page) (← links)
- Geometric lower bounds for parametric matroid optimization (Q1275670) (← links)
- Linear complexity hexahedral mesh generation (Q1286469) (← links)
- Approximating the minimum weight Steiner triangulation (Q1317876) (← links)
- Visibility with a moving point of view (Q1322569) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Provably good mesh generation (Q1329150) (← links)
- On the number of minimal 1-Steiner trees (Q1330879) (← links)
- Arboricity and bipartite subgraph listing algorithms (Q1334644) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
- On triangulating three-dimensional polygons (Q1392846) (← links)
- Tiling space and slabs with acute tetrahedra. (Q1428462) (← links)
- Diameter and treewidth in minor-closed graph families (Q1578412) (← links)
- Multivariate regression depth (Q1611068) (← links)
- Beta-skeletons have unbounded dilation (Q1614068) (← links)
- Subexponential-time and FPT algorithms for embedded flat clustered planarity (Q1627160) (← links)
- Realization and connectivity of the graphs of origami flat foldings (Q1725788) (← links)
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
