SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
Discrete Applied Mathematics - Submodularity
Special edges, and approximating the smallest directed k-edge connected spanning subgraph
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the smallest k-edge connected spanning subgraph by LP-rounding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of submodular function minimisation on diamonds
Discrete Optimization
Hi-index | 0.05 |