A categorized bibliography on incremental computation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The connectivity carcass of a vertex subset in a graph and its incremental maintenance
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
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
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
An Experimental Study of Dynamic Algorithms for Directed Graphs
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
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)
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Algorithms and theory of computation handbook
Evaluating temporal graphs built from texts via transitive reduction
Journal of Artificial Intelligence Research
Extraction of feature models from formal contexts
Proceedings of the 15th International Software Product Line Conference, Volume 2
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
Incremental pattern matching for the efficient computation of transitive closure
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Efficient storage and retrieval in agent protocol libraries using subsumption hierarchies
Multiagent and Grid Systems
| Hi-index | 0.00 |