Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Derandomization through approximation: an NC algorithm for minimum cuts
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Sub-linear distributed algorithms for sparse certificates and biconnected components
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Improved approximation algorithms for uniform connectivity problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fast algorithms for k-shredders and k-node connectivity augmentation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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)
Average case analysis of dynamic graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Using randomized sparsification to approximate minimum cuts
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
Approximating unweighted connectivity problems in parallel
Information and Computation
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A Near Optimal Algorithm for Vertex Connectivity Augmentation
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Independence free graphs and vertex connectivity augmentation
Journal of Combinatorial Theory Series B
Sparse connectivity certificates via MA orderings in graphs
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
An efficient algorithm to solve connectivity problem on trapezoid graphs
Journal of Applied Mathematics and Computing
Sparse certificates and removable cycles in l-mixed p-connected graphs
Operations Research Letters
| Hi-index | 0.00 |