A general approximation technique for constrained forest problems
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Escaping a grid by edge-disjoint paths
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A parallel implementation of an asynchronous team to the point-to-point connection problem
Parallel Computing - Special issue: Parallel computing in numerical optimization
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
Routing for power minimization in the speed scaling model
IEEE/ACM Transactions on Networking (TON)
The k-path tree matroid and its applications to survivable network design
Discrete Optimization
| Hi-index | 0.04 |