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
An external memory data structure for shortest path queries
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Approximating Geometric Bottleneck Shortest Paths
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Approximating geometric bottleneck shortest paths
Computational Geometry: Theory and Applications
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)
An external memory data structure for shortest path queries (extended abstract)
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On algebraic expressions of series-parallel and Fibonacci graphs
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Improved distance queries in planar graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Approximate distance queries for weighted polyhedral surfaces
ESA'11 Proceedings of the 19th European conference on Algorithms
Exact distance oracles for planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Single source distance oracle for planar digraphs avoiding a failed node or link
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
External data structures for shortest path queries on planar digraphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Localized and compact data-structure for comparability graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |