Computing the binding number of a graph
Discrete Applied Mathematics
Augmenting graphs to meet edge-connectivity requirements
SIAM Journal on Discrete Mathematics
Applications of submodular functions
Surveys in combinatorics, 1993
A faster deterministic maximum flow algorithm
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
SIAM Journal on Discrete Mathematics
Graph Algorithms
Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |