Alpha-algorithms for incremental planarity testing (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
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
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
An empirical study of dynamic graph algorithms
Journal of Experimental Algorithmics (JEA)
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Dynamic two-connectivity with backtracking
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Planarity of the 2-Level Cactus Model
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Single-link failure detection in all-optical networks using monitoring cycles and paths
IEEE/ACM Transactions on Networking (TON)
A simple algorithm for triconnectivity of a multigraph
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Algorithms and theory of computation handbook
Fast recovery from dual-link or single-node failures in IP networks using tunneling
IEEE/ACM Transactions on Networking (TON)
SRLG failure localization in optical networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |