Efficient splitting off algorithms for graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximating connectivity augmentation problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On shredders and vertex connectivity augmentation
Journal of Discrete Algorithms
Compacting cuts: a new linear formulation for minimum cut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Edge-splittings preserving local edge-connectivity of graphs
Discrete Applied Mathematics
The Set Connector Problem in Graphs
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Eulerian detachments with local edge-connectivity
Discrete Applied Mathematics
Compacting cuts: A new linear formulation for minimum cut
ACM Transactions on Algorithms (TALG)
Journal of Combinatorial Theory Series B
Degree Bounded Network Design with Metric Costs
SIAM Journal on Computing
Network design with edge-connectivity and degree constraints
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
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
An overview of algorithms for network survivability
ISRN Communications and Networking
| Hi-index | 0.00 |