Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Shortest path queries in planar graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Preprocessing an undirected planar network to enable fast approximate distance queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
I/O-Efficient Shortest Path Queries in Geometric Spanners
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Approximate Distance Oracles Revisited
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Well-separated pair decomposition for the unit-disk graph metric and its applications
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Many distances in planar graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Oracles for bounded-length shortest paths in planar graphs
ACM Transactions on Algorithms (TALG)
Approximate distance oracles for graphs with dense clusters
Computational Geometry: Theory and Applications
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
I/O-efficient algorithms for computing planar geometric spanners
Computational Geometry: Theory and Applications
Feed-links for network extensions
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Planar rectilinear shortest path computation using corridors
Computational Geometry: Theory and Applications
A near linear time approximation scheme for Steiner tree among obstacles in the plane
Computational Geometry: Theory and Applications
Compact oracles for approximate distances around obstacles in the plane
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Improved distance queries in planar graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Exact distance oracles for planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Embedding point sets into plane graphs of small dilation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
External data structures for shortest path queries on planar digraphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximate distance oracles for graphs with dense clusters
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Querying two boundary points for shortest paths in a polygonal domain
Computational Geometry: Theory and Applications
Approximate distance queries in disk graphs
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
A near linear time approximation scheme for steiner tree among obstacles in the plane
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Spanners for geometric intersection graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Proceedings of the twenty-ninth annual symposium on Computational geometry
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |