Pages that link to "Item:Q1346130"
From MaRDI portal
The following pages link to Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130):
Displayed 18 items.
- On bounded leg shortest paths problems (Q633848) (← links)
- Energy-efficient paths in radio networks (Q639290) (← links)
- Dynamic data structures for approximate Hausdorff distance in the word RAM (Q680153) (← links)
- Stable roommates spanner (Q691764) (← links)
- Connected dominating sets on dynamic geometric graphs (Q691774) (← links)
- Average case analysis of dynamic geometric optimization (Q1917043) (← links)
- Kinetic Euclidean minimum spanning tree in the plane (Q1932347) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Shortest paths in intersection graphs of unit disks (Q2344058) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q3304732) (← links)
- Straight Skeletons of Three-Dimensional Polyhedra (Q3541082) (← links)
- Maintaining minimum spanning trees in dynamic graphs (Q4571989) (← links)
- (Q5088951) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q5090394) (← links)
- (Q5743402) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)