ACM Computing Surveys (CSUR)
Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Admission Control to Minimize Rejections
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Scaling properties of the Internet graph
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Path kernels and multiplicative updates
The Journal of Machine Learning Research
Journal of Scheduling - Special issue: On-line algorithm part I
On the scaling of congestion in the internet graph
ACM SIGCOMM Computer Communication Review
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Power in unity: forming teams in large-scale community systems
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
IEEE/ACM Transactions on Networking (TON)
Off-line admission control for advance reservations in star networks
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
Hi-index | 0.00 |