Pages that link to "Item:Q4575914"
From MaRDI portal
The following pages link to Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications (Q4575914):
Displaying 24 items.
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- Reverse shortest path problem for unit-disk graphs (Q832915) (← links)
- Incremental Voronoi diagrams (Q1688855) (← links)
- Spanning trees in multipartite geometric graphs (Q1755734) (← links)
- Reverse shortest path problem in weighted unit-disk graphs (Q2154091) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs (Q2223616) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- On the structure of higher order Voronoi cells (Q2275268) (← links)
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- Geometric planar networks on bichromatic collinear points (Q2664940) (← links)
- An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs (Q2678259) (← links)
- Resolving SINR Queries in a Dynamic Setting (Q3387759) (← links)
- Spanners for Directed Transmission Graphs (Q4581909) (← links)
- (Q5002834) (← links)
- (Q5088931) (← links)
- (Q5088951) (← links)
- (Q5088955) (← links)
- Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. (Q5088993) (← links)
- (Q5091017) (← links)
- (Q5115770) (← links)
- (Q5115792) (← links)
- Reachability problems for transmission graphs (Q5896888) (← links)
- Reachability problems for transmission graphs (Q5918537) (← links)
