A data structure for dynamic trees
Journal of Computer and System Sciences
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
Short length versions of Menger's theorem
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Using random sampling to find maximum flows in uncapacitated undirected graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Better random sampling algorithms for flows in undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Random Sampling in Cut, Flow, and Network Design Problems
Mathematics of Operations Research
Beyond the flow decomposition barrier
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Flows in undirected unit capacity networks
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Random sampling in residual graphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Faster Algorithm for Finding Disjoint Paths in Grids
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems
Discrete Applied Mathematics
Primal-dual approach for directed vertex connectivity augmentation and generalizations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Primal-dual approach for directed vertex connectivity augmentation and generalizations
ACM Transactions on Algorithms (TALG)
Pattern Recognition Letters
Maximum Bipartite Flow in Networks with Adaptive Channel Width
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On computing minimum (s,t)-cuts in digraphs
Information Processing Letters
Maximum bipartite flow in networks with adaptive channel width
Theoretical Computer Science
Quantum algorithms for matching and network flows
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Reconstructing edge-disjoint paths
Operations Research Letters
An improved parameterized algorithm for the minimum node multiway cut problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |