A categorized bibliography on incremental computation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
Optimal and efficient clock synchronization under drifting clocks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fully dynamic output bounded single source shortest path problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
New dynamic SPT algorithm based on a ball-and-string model
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Knowledge and Data 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
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
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)
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
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Anytime search in dynamic graphs
Artificial Intelligence
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Incremental tractable reasoning about qualitative temporal constraints
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Average-case analysis of incremental topological ordering
Discrete Applied Mathematics
Incremental speech translation
Incremental speech translation
Average-case analysis of online topological ordering
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Algorithms and theory of computation handbook
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
| Hi-index | 0.00 |