Mixed-approach algorithms for transitive closure (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Core algorithms for autonomous monitoring of distributed systems
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
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)
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
A fully dynamic algorithm for maintaining the transitive closure
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A data structure for arc insertion and regular path finding
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A fully dynamic algorithm for maintaining the transitive closure
Journal of Computer and System Sciences - STOC 1999
A faster and simpler fully dynamic transitive closure
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
An Experimental Study of Dynamic Algorithms for Directed Graphs
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Building knowledge base management systems
The VLDB Journal — The International Journal on Very Large Data Bases
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)
Artificial Intelligence
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Incremental heuristic search in AI
AI Magazine
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier
Journal of the ACM (JACM)
A faster and simpler fully dynamic transitive closure
ACM Transactions on Algorithms (TALG)
An experimental study of algorithms for fully dynamic transitive closure
Journal of Experimental Algorithmics (JEA)
Updating recursive XML views of relations
Journal of Computer Science and Technology
On the complexity of paths avoiding forbidden pairs
Discrete Applied Mathematics
Algorithms and theory of computation handbook
An experimental study of algorithms for fully dynamic transitive closure
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Associative version of italiano's decremental algorithm for the transitive closure problem
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Complexity of the path avoiding forbidden pairs problem revisited
Discrete Applied Mathematics
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
| Hi-index | 0.89 |