On minimum stars, minimum Steiner stars, and maximum matchings
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Simplicity and hardness of the maximum traveling salesman problem under geometric distances
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The geometric maximum traveling salesman problem
Journal of the ACM (JACM)
An improved approximation algorithm for virtual private network design
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Two-phase routing, scheduling and power control for wireless mesh networks with variable traffic
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Generalized survivable network
IEEE/ACM Transactions on Networking (TON)
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Oblivious routing of highly variable traffic in service overlays and IP backbones
IEEE/ACM Transactions on Networking (TON)
Locally restorable routing of highly variable traffic
IEEE/ACM Transactions on Networking (TON)
On the Complexity of the Asymmetric VPN Problem
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Inter-domain routing: Algorithms for QoS guarantees
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analyzing the performance of deferred reservations
Computer Networks: The International Journal of Computer and Telecommunications Networking
Guaranteed performance routing of unpredictable traffic with fast path restoration
IEEE/ACM Transactions on Networking (TON)
More adaptive robust stable routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Approximability of robust network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Network design via core detouring for problems without a core
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
INFORMS Journal on Computing
The VPN Problem with Concave Costs
SIAM Journal on Discrete Mathematics
Computers and Operations Research
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
Mathematics of Operations Research
Multiple-layer network planning with scenario-based traffic forecast
EUNICE'11 Proceedings of the 17th international conference on Energy-aware communications
An exact algorithm for robust network design
INOC'11 Proceedings of the 5th international conference on Network optimization
Traffic-oblivious routing in the hose model
IEEE/ACM Transactions on Networking (TON)
End-to-end restorable oblivious routing of hose model traffic
IEEE/ACM Transactions on Networking (TON)
New approaches for virtual private network design
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Virtual private network design: a proof of the tree routing conjecture on ring networks
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Provisioning a virtual private network under the presence of non-communicating groups
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Competitive and deterministic embeddings of virtual networks
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Design of trees in the hose model: The balanced case
Operations Research Letters
Static and dynamic routing under disjoint dominant extreme demands
Operations Research Letters
On improving optimal oblivious routing
Operations Research Letters
Flow-based load-balancing architecture for the agile all-photonic network
Photonic Network Communications
Models and algorithms for robust network design with several traffic scenarios
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
Journal of Combinatorial Optimization
The robust network loading problem with dynamic routing
Computational Optimization and Applications
Journal of the ACM (JACM)
Competitive and deterministic embeddings of virtual networks
Theoretical Computer Science
| Hi-index | 0.00 |