A new approach to all pairs shortest paths in planar graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
An O(n1.5logn) 1-d compaction algorithm
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
The complexity of multiway cuts (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fully dynamic planarity testing (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Planar separators and parallel polygon triangulation (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Efficient parallel shortest-paths in digraphs with a separator decomposition
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
The network inhibition problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the all-pairs Euclidean short path problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Scaling algorithms for the shortest paths problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth 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
I/O-optimal algorithms for planar graphs using separators
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
A Dynamic Algorithm for Maintaining Graph Partitions
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Planar Graph Blocking for External Searching
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
I/O-Efficient Algorithms for Problems on Grid-Based Terrains
Journal of Experimental Algorithmics (JEA)
Placing an abnoxious facility in geometric networks
Nordic Journal of Computing
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
On external-memory MST, SSSP and multi-way planar graph separation
Journal of Algorithms
Roads, codes, and spatiotemporal queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Multiple-source shortest paths in planar graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Tightening non-simple paths and cycles on surfaces
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Many distances in planar graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Online geometric reconstruction
Proceedings of the twenty-second annual symposium on Computational geometry
Splitting (complicated) surfaces is hard
Proceedings of the twenty-second annual symposium on Computational geometry
Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time
Proceedings of the twenty-second annual symposium on Computational geometry
Planar graphs, negative weight edges, shortest paths, and near linear time
Journal of Computer and System Sciences - Special issue on FOCS 2001
Oracles for bounded-length shortest paths in planar graphs
ACM Transactions on Algorithms (TALG)
Partitioning planar graphs with costs and weights
Journal of Experimental Algorithmics (JEA)
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
Journal of the ACM (JACM)
Improved shortest path algorithms for nearly acyclic directed graphs
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Multiple source shortest paths in a genus g graph
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Splitting (complicated) surfaces is hard
Computational Geometry: Theory and Applications
Succinct geometric indexes supporting point location queries
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
Graph-Theoretic Concepts in Computer Science
Discrete Applied Mathematics
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
On the dilation spectrum of paths, cycles, and trees
Computational Geometry: Theory and Applications
An Approximation Scheme for Terrain Guarding
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
I/O and Space-Efficient Path Traversal in Planar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
An external memory data structure for shortest path queries (extended abstract)
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
FiGaRo: fine-grained software reconfiguration for wireless sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
ACM Transactions on Algorithms (TALG)
Single source shortest paths in H-minor free graphs
Theoretical Computer Science
Maximum flows and parametric shortest paths in planar graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Succinct representations of separable graphs
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Algorithms and theory of computation handbook
On the discrete unit disk cover problem
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Improved algorithms for min cut and max flow in undirected planar graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Shortest non-trivial cycles in directed surface graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
A survey of geodesic paths on 3D surfaces
Computational Geometry: Theory and Applications
Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Improved distance queries in planar graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Min-cuts and shortest cycles in planar graphs in O(n log log n) time
ESA'11 Proceedings of the 19th European conference on Algorithms
Tightening Nonsimple Paths and Cycles on Surfaces
SIAM Journal on Computing
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
Global minimum cuts in surface embedded graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Cache-oblivious planar shortest paths
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
External data structures for shortest path queries on planar digraphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Exact and approximation algorithms for computing the dilation spectrum of paths, trees, and cycles
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Minimum cuts and shortest non-separating cycles via homology covers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximate shortest path queries on weighted polyhedral surfaces
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms (TALG)
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
I/O-Efficient algorithms on near-planar graphs
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
On the integral plane two-commodity flow problem
Operations Research Letters
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
ACM Transactions on Algorithms (TALG)
Localized geometric query problems
Computational Geometry: Theory and Applications
Counting and sampling minimum cuts in genus g graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Approximating the diameter of planar graphs in near linear time
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |