Efficient splitting off algorithms for graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Perfect arborescence packing in preflow mincut graphs
Proceedings of the seventh 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
Directed network design with orientation constraints
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Polyhedral Structure of Submodular and Posi-modular Systems
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Simultaneous well-balanced orientations of graphs
Journal of Combinatorial Theory Series B
Well-balanced orientations of mixed graphs
Information Processing Letters
Approximate min--max theorems for Steiner rooted-orientations of graphs and hypergraphs
Journal of Combinatorial Theory Series B
Fast edge orientation for unweighted graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
ACM Transactions on Sensor Networks (TOSN)
Recent results on well-balanced orientations
Discrete Optimization
Towards minimizing k-submodular functions
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |