Fast transformation of temporal plans for efficient execution
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
BOS is boss: a case for bulk-synchronous object systems
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
A graph-based system for network-vulnerability analysis
Proceedings of the 1998 workshop on New security paradigms
Buckets, heaps, lists, and monotone priority queues
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A computational study of routing algorithms for realistic transportation networks
Journal of Experimental Algorithmics (JEA)
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Graph Collapsing in Shortest Path Auction Algorithms
Computational Optimization and Applications
Dijkstra's algorithm on-line: an empirical case study from public railroad transport
Journal of Experimental Algorithmics (JEA)
Finding shortest paths in large network systems
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
High-Performance Algorithm Engineering for Computational Phylogenetics
The Journal of Supercomputing - Special issue on computational issues in fluid dynamics optimization and simulation
Experiments with the auction algorithm for the shortest path problem
Nordic Journal of Computing
High-Performance Algorithm Engineering for Computational Phylogenetics
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Shortest Path Algorithms: Engineering Aspects
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Coping with Inconsistent Constraint Specifications
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
A Simple Shortest Path Algorithm with Linear Average Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Selecting Problems for Algorithm Evaluation
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Cycles in Generalized Networks
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Computers and Operations Research
Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept
Computational Optimization and Applications
Design issues and performance improvements in routing strategy on the internet workflow
International Journal of Network Management
Δ-stepping: a parallelizable shortest path algorithm
Journal of Algorithms
Experimental analysis of dynamic all pairs shortest path algorithms
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
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Parallel implementation of a transportation network model
Journal of Parallel and Distributed Computing
Efficient transitive closure of sparse matrices over closed semirings
Theoretical Computer Science - Algebraic methods in language processing
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Two fast algorithms for all-pairs shortest paths
Computers and Operations Research
A Multiple Pairs Shortest Path Algorithm
Transportation Science
A Zero-Space algorithm for Negative Cost Cycle Detection in networks
Journal of Discrete Algorithms
Optimization and evaluation of shortest path queries
The VLDB Journal — The International Journal on Very Large Data Bases
Journal of Symbolic Computation
Multiple UAVs path planning algorithms: a comparative study
Fuzzy Optimization and Decision Making
Point-to-Point Shortest Path Algorithms with Preprocessing
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Ontology driven road network analysis based on analytical network process technique
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
A comparison of solution strategies for biobjective shortest path problems
Computers and Operations Research
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computers and Industrial Engineering
LP-oriented upper bounds for the weighted stability number of a graph
Cybernetics and Systems Analysis
Efficiently indexing shortest paths by exploiting symmetry in graphs
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Discrete Event Dynamic Systems
Shortest-path feasibility algorithms: An experimental evaluation
Journal of Experimental Algorithmics (JEA)
Finding shortest paths on real road networks: the case for A*
International Journal of Geographical Information Science
New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels
Computational Optimization and Applications
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Rank-Sensitive Priority Queues
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Journal of Discrete Algorithms
Multi-type nearest neighbor queries in road networks with time window constraints
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Proceedings of the 3rd Workshop on Social Network Mining and Analysis
Efficient and scalable multi-geography route planning
Proceedings of the 13th International Conference on Extending Database Technology
Network-tree model and shortest path algorithm
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Characterization of type hierarchies with open specification
Proceedings of the 2nd international conference on Semantics in databases
Modeling spatio-temporal network computations: a summary of results
GeoS'07 Proceedings of the 2nd international conference on GeoSpatial semantics
Spatio-temporal network databases and routing algorithms: a summary of results
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Pregel: a system for large-scale graph processing
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
An Energy Efficient Middleware Architecture for Processing Spatial Alarms on Mobile Clients
Mobile Networks and Applications
Optimal placement of UV-based communications relay nodes
Journal of Global Optimization
The shortest path problem revisited: optimal routing for electric vehicles
KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Optimization of heuristic search using recursive algorithm selection and reinforcement learning
Annals of Mathematics and Artificial Intelligence
ESA'11 Proceedings of the 19th European conference on Algorithms
Application of shortest path search algorithm in disaster decision support system
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part I
A shortest path algorithm based on limited search heuristics
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
A new verification procedure for partially clairvoyant scheduling
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
An efficient label setting/correcting shortest path algorithm
Computational Optimization and Applications
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Capacity constrained routing algorithms for evacuation planning: a summary of results
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Stressing is better than relaxing for negative cost cycle detection in networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Generalized maneuvers in route planning
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
QoS-aware automatic service composition: a graph view
Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
The weak-heap data structure: Variants and applications
Journal of Discrete Algorithms
On an exact method for the constrained shortest path problem
Computers and Operations Research
Computing all-pairs shortest paths by leveraging low treewidth
Journal of Artificial Intelligence Research
Journal of Visual Communication and Image Representation
Determining and locating the closest available resources to mobile collaborators
Expert Systems with Applications: An International Journal
Computers and Operations Research
Efficient algorithms for the all pairs shortest path problem with limited edge costs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Sharing information for the all pairs shortest path problem
Theoretical Computer Science
| Hi-index | 0.02 |