On-line randomized call control revisited
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Randomized Lower Bounds for Online Path Coloring
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Approximating Call-Scheduling Makespan in All-Optical Networks
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
Oblivious routing on node-capacitated and directed graphs
ACM Transactions on Algorithms (TALG)
Journal of Experimental Algorithmics (JEA)
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Survey on Oblivious Routing Strategies
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Online packet-routing in grids with bounded buffers
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Nash equilibria in all-optical networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Hi-index | 0.00 |