Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
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
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
An Experimental Study of Dynamic Algorithms for Directed Graphs
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A fully dynamic algorithm for distributed shortest paths
Theoretical Computer Science - Latin American theoretical informatics
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
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)
Maintaining Longest Paths Incrementally
Constraints
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks
IEEE Transactions on Computers
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
ACM Transactions on Algorithms (TALG)
A dynamic topological sort algorithm for directed acyclic graphs
Journal of Experimental Algorithmics (JEA)
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A Practical Temporal Constraint Management System for Real-Time Applications
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Adaptive algorithms for routing and traffic engineering in stochastic networks
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Partially dynamic efficient algorithms for distributed shortest paths
Theoretical Computer Science
Average-case analysis of incremental topological ordering
Discrete Applied Mathematics
Average-case analysis of online topological ordering
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Accomplishing approximate FCFS fairness without queues
HiPC'07 Proceedings of the 14th international conference on High performance computing
Algorithms and theory of computation handbook
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
Incremental graph pattern matching
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Maintaining distributed logic programs incrementally
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Updating directed minimum cost spanning trees
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Incremental algorithms for inter-procedural analysis of safety properties
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Query preserving graph compression
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Graph pattern matching revised for social network analysis
Proceedings of the 15th International Conference on Database Theory
A bounded incremental test generation algorithm for finite state machines
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
Using genetic algorithms for navigation planning in dynamic environments
Applied Computational Intelligence and Soft Computing
Efficient property preservation checking of model refinements
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Making queries tractable on big data with preprocessing: through the eyes of complexity theory
Proceedings of the VLDB Endowment
| Hi-index | 5.23 |