A separator theorem for graphs of bounded genus
Journal of Algorithms
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Parallel algorithms for minimum cuts and maximum flows in planar networks
Journal of the ACM (JACM)
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Fast and efficient solution of path algebra problems
Journal of Computer and System Sciences
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Introduction to algorithms
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Maintaining biconnected components of dynamic planar graphs (extended abstract)
Proceedings of the 18th international colloquium on Automata, languages and programming
A unified geometric approach to graph separators
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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
Efficient parallel shortest-paths in digraphs with a separator decomposition
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Scaling algorithms for the shortest paths problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
A Fully Dynamic Data Structure for Reachability in Planar Digraphs
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Data structures for on-line updating of minimum spanning trees
STOC '83 Proceedings of the fifteenth 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
Fully dynamic output bounded single source shortest path problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for finding disjoint paths in grids
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Shortest paths in an arrangement with k line orientations
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
Constructing minimum energy mobile wireless networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Constructing minimum energy mobile wireless networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
ICDT '99 Proceedings of the 7th International Conference on Database Theory
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Compact Routing Tables for Graphs of Bounded Genus
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Computing the Girth of a Planar Graph
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Topological Peeling and Implementation
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An Experimental Study and Comparison of Topological Peeling and Topological Walk
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Finding an Optimal Path without Growing the Tree
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Decomposable multi-parameter matroid optimization problems
Theoretical Computer Science - Latin American theoretical informatics
Finding an optimal path without growing the tree
Journal of Algorithms
Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL
ACM Transactions on Database Systems (TODS)
The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
Graph-Theoretic Concepts in Computer Science
An algorithm for computing simple k-factors
Information Processing Letters
Reducing the memory required to find a geodesic shortest path on a large mesh
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A faster algorithm for computing the girth of planar and bounded genus graphs
ACM Transactions on Algorithms (TALG)
Narrow-Shallow-Low-Light Trees with and without Steiner Points
SIAM Journal on Discrete Mathematics
Fréchet-Distance on road networks
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Improved algorithms for replacement paths problems in restricted graphs
Operations Research Letters
Parallel dynamic spt update algorithm in OSPF
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Journal of Discrete Algorithms
| Hi-index | 0.00 |