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
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Lifelong Planning for Mobile Robots
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
A fully dynamic algorithm for distributed shortest paths
Theoretical Computer Science - Latin American theoretical informatics
Eighteenth national conference on Artificial intelligence
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
An Experimental Study of Dynamic Algorithms for Transitive Closure
Journal of Experimental Algorithmics (JEA)
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Journal of Algorithms
Artificial Intelligence
Incremental heuristic search in AI
AI Magazine
A new approach to dynamic all pairs shortest paths
Journal of the ACM (JACM)
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Updating Paths in Time-Varying Networks Given Arc Weight Changes
Transportation Science
A shortest path algorithm with novel heuristics for dynamic transportation networks
International Journal of Geographical Information Science
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
The BDD-Based Dynamic A* Algorithm for Real-Time Replanning
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Shortest path discovery problems: a framework, algorithms and experimental results
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Adaptive algorithms for routing and traffic engineering in stochastic networks
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
DD* lite: efficient incremental search with state dominance
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Partially dynamic efficient algorithms for distributed shortest paths
Theoretical Computer Science
Efficient best path monitoring in road networks for instant local traffic information
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
Algorithms and theory of computation handbook
Dynamic arc-flags in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Survey of Motion Planning Literature in the Presence of Uncertainty: Considerations for UAV Guidance
Journal of Intelligent and Robotic Systems
Updating directed minimum cost spanning trees
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Computing replacement paths in surface embedded graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
BDDRPA*: an efficient BDD-Based incremental heuristic search algorithm for replanning
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Spatial big-data challenges intersecting mobility and cloud computing
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Finding Alternative Shortest Paths in Spatial Networks
ACM Transactions on Database Systems (TODS)
Using genetic algorithms for navigation planning in dynamic environments
Applied Computational Intelligence and Soft Computing
Enhancing the computation of distributed shortest paths on real dynamic networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
A loop-free shortest-path routing algorithm for dynamic networks
Theoretical Computer Science
The minimum constraint removal problem with three robotics applications
International Journal of Robotics Research
| Hi-index | 0.00 |