Deterministic Õ(nm) time edge-splitting in undirected graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Planarity of the 2-Level Cactus Model
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Minimum Cuts of Simple Graphs in Almost Always Linear Time
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
A simple and fast min-cut algorithm
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A new and improved algorithm for the 3-cut problem
Operations Research Letters
Hi-index | 0.00 |