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
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
Computing edge-connectivity augmentation function in Õ(nm) time
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
On shredders and vertex connectivity augmentation
Journal of Discrete Algorithms
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
Sparse certificates and removable cycles in l-mixed p-connected graphs
Operations Research Letters
Hi-index | 0.00 |