The following pages link to (Q3579450):
Displayed 17 items.
- Low dimensional embeddings of doubling metrics (Q260269) (← links)
- Kinetic spanners in \(\mathbb R^{d}\) (Q540440) (← links)
- Pattern matching in doubling spaces (Q832835) (← links)
- Temporal cliques admit sparse spanners (Q2040022) (← links)
- Local routing in a tree metric \(1\)-spanner (Q2084633) (← links)
- Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922) (← links)
- Randomization for Efficient Dynamic Graph Algorithms (Q2795930) (← links)
- New Doubling Spanners: Better and Simpler (Q2954370) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q3304732) (← links)
- An Optimal Dynamic Spanner for Doubling Metric Spaces (Q3541109) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q5090394) (← links)
- Temporal Cliques Admit Sparse Spanners (Q5092337) (← links)
- (Q5092428) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ (Q5499733) (← links)
- Fully dynamic geometric spanners (Q5920251) (← links)