Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Escaping a grid by edge-disjoint paths
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Globally Optimal Regions and Boundaries as Minimum Ratio Weight Cycles
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
I/O-optimal algorithms for planar graphs using separators
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Efficient Algorithms for k-Terminal Cuts on Planar Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Partitioning Planar Graphs with Costs and Weights
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Route planning and map inference with global positioning traces
Computer Science in Perspective
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Journal of Algorithms
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
How to draw the minimum cuts of a planar graph
Computational Geometry: Theory and Applications
A new approach to dynamic all pairs shortest paths
Journal of the ACM (JACM)
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
A 4-geometry maze router and its application on multiterminal nets
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient query processing on spatial networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Tightening non-simple paths and cycles on surfaces
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An O (n log n) algorithm for maximum st-flow in a directed planar graph
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
An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks
IEEE Transactions on Computers
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
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
Planar graphs, negative weight edges, shortest paths, and near linear time
Journal of Computer and System Sciences - Special issue on FOCS 2001
Partitioning planar graphs with costs and weights
Journal of Experimental Algorithmics (JEA)
On the stabbing number of a random Delaunay triangulation
Computational Geometry: Theory and Applications
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Finding shortest contractible and shortest separating cycles in embedded graphs
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)
Discrete Applied Mathematics
Minimax Regret Single-Facility Ordered Median Location Problems on Networks
INFORMS Journal on Computing
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Goal-directed shortest-path queries using precomputed cluster distances
Journal of Experimental Algorithmics (JEA)
Engineering planar separator algorithms
Journal of Experimental Algorithmics (JEA)
Link Distance and Shortest Path Problems in the Plane
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Computing the Girth of a Planar Graph in O(n logn) Time
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Shortest paths in time-dependent FIFO networks using edge load forecasts
Proceedings of the Second International Workshop on Computational Transportation Science
Finding shortest contractible and shortest separating cycles in embedded graphs
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
New results on minimax regret single facility ordered median location problems on networks
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Finding shortest non-trivial cycles in directed graphs on surfaces
Proceedings of the twenty-sixth annual symposium on Computational geometry
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
Shortest paths in planar graphs with real lengths in O(n log2n/ log log n) time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Shortest vertex-disjoint two-face paths in planar graphs
ACM Transactions on Algorithms (TALG)
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Computing the Girth of a Planar Graph in $O(n \logn)$ Time
SIAM Journal on Discrete Mathematics
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Improved algorithms for min cut and max flow in undirected planar graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Link distance and shortest path problems in the plane
Computational Geometry: Theory and Applications
Shortest non-trivial cycles in directed surface graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
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
Flow computations on imprecise terrains
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Multiple-source single-sink maximum flow in directed planar graphs in O(diameter ċ n log n) time
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
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
SIAM Journal on Discrete Mathematics
Tightening Nonsimple Paths and Cycles on Surfaces
SIAM Journal on Computing
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Exact distance oracles for planar graphs
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
Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Localized and compact data-structure for comparability graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Shortest non-crossing walks in the plane
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
Computing replacement paths in surface embedded graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
GD'11 Proceedings of the 19th international conference on Graph Drawing
How to walk your dog in the mountains with no magic leash
Proceedings of the twenty-eighth annual symposium on Computational geometry
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Discrete Optimization
On shortest disjoint paths in planar graphs
Discrete Optimization
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Operations Research Letters
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Faster approximation of distances in graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Counting and sampling minimum cuts in genus g graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
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)
Journal of Discrete Algorithms
| Hi-index | 0.00 |