IEEE/ACM Transactions on Networking (TON)
A branch-and-price algorithm for the Steiner tree packing problem
Computers and Operations Research
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Packing element-disjoint steiner trees
ACM Transactions on Algorithms (TALG)
On routing in VLSI design and communication networks
Discrete Applied Mathematics
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Perfect secrecy, perfect omniscience and steiner tree packing
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Secret key generation for a pairwise independent network model
IEEE Transactions on Information Theory
Perfect omniscience, perfect secrecy, and Steiner tree packing
IEEE Transactions on Information Theory
Packing element-disjoint steiner trees
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Automated knowledge source selection and service composition
Computational Optimization and Applications
| Hi-index | 0.13 |