Layered augmenting path algorithms
Mathematics of Operations Research
A matroid approach to finding edge connectivity and packing arborescences
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Applications of a poset representation to edge connectivity and graph rigidity
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Augmenting graphs to meet edge-connectivity requirements
SIAM Journal on Discrete Mathematics
Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
A faster algorithm for finding the minimum cut in a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Applications of submodular functions
Surveys in combinatorics, 1993
A representation for crossing set families with applications to submodular flow problems
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Augmenting undirected connectivity in RNC and in randomized Õ(n3) time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Deterministic Õ(nm) time edge-splitting in undirected graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Algorithms for graphic polymatroids and parametric s-Sets
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Computing edge-connectivity augmentation function in Õ(nm) time
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal augmentation to make a graph k-edge-connected and triconnected
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Augmenting undirected edge connectivity in Õ(n2) time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
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
Simultaneous well-balanced orientations of graphs
Journal of Combinatorial Theory Series B
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Well-balanced orientations of mixed graphs
Information Processing Letters
Primal-dual approach for directed vertex connectivity augmentation and generalizations
ACM Transactions on Algorithms (TALG)
Fast edge orientation for unweighted graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Augmenting edge-connectivity between vertex subsets
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Recent results on well-balanced orientations
Discrete Optimization
| Hi-index | 0.00 |