Amortized efficiency of list update and paging rules
Communications of the ACM
An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Call preemption in communication networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Lower bounds for on-line graph coloring
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized competitive algorithms for admission control in general networks
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficient routing and scheduling algorithms for optical networks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Scheduling data transfers in a network and the set scheduling problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling multicasts on unit-capacity trees and meshes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Online througput-competitive algorithm for multicast routing and admission control
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-line randomized call control revisited
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-line complexity of monotone set systems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Efficient on-line communication in cellular networks
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Approximation algorithms for routing and call scheduling in all-optical chains and rings
Theoretical Computer Science
Competitive Analysis of On-line Randomized Call Control in Cellular Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
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
Online Call Admission in Optical Networks with Larger Demands
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Scheduling multicasts on unit-capacity trees and meshes
Journal of Computer and System Sciences
COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS
Probability in the Engineering and Informational Sciences
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
Journal of Scheduling - Special issue: On-line algorithm part I
Distributed online call control on general networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An online throughput-competitive algorithm for multicast routing and admission control
Journal of Algorithms
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
Journal of Experimental Algorithmics (JEA)
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Journal of Computer and System Sciences
Online coloring of hypergraphs
Information Processing Letters
Deterministic online optical call admission revisited
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
New bounds on the competitiveness of randomized online call control in cellular networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |