ACM Computing Surveys (CSUR)
Dynamic session management for static and mobile users: a competitive on-line algorithmic approach
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Temporary tasks assignment resolved
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive on-line switching policies
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On-line load balancing of temporary tasks revisited
Theoretical Computer Science
Off-line temporary tasks assignment
Theoretical Computer Science
IEEE Transactions on Parallel and Distributed Systems
Flexible Load Balancing in Distributed Information Agent Systems
Proceedings of the 9th ECCAI-ACAI/EASSS 2001, AEMAS 2001, HoloMAS 2001 on Multi-Agent-Systems and Applications II-Selected Revised Papers
On-Line Load Balancing of Temporary Tasks Revisited
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Off-Line Temporary Tasks Assignment
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
On-Line Load Banancing in a Hierarchical Server Topology
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
The Home Model and Competitive Algorithms for Load Balancing in a Computing Cluster
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
On-line algorithms for the channel assignment problem in cellular networks
Discrete Applied Mathematics
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Load-Balanced Short-Path Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Semi-matchings for bipartite graphs and load balancing
Journal of Algorithms
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms (TALG)
Confidently Cutting a Cake into Approximately Fair Pieces
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
On designing truthful mechanisms for online scheduling
Theoretical Computer Science
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Online load balancing made simple: greedy strikes back
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Randomized algorithms for online bounded bidding
Information Processing Letters
Online rescheduling of multiple picking agents for warehouse management
Robotics and Computer-Integrated Manufacturing
A robust PTAS for machine covering and packing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Offline file assignments for online load balancing
Information Processing Letters
Online Optimization with Uncertain Information
ACM Transactions on Algorithms (TALG)
On designing truthful mechanisms for online scheduling
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A lower bound for on-line scheduling on uniformly related machines
Operations Research Letters
Dividing a Territory Among Several Vehicles
INFORMS Journal on Computing
Collecting information by power-aware mobile agents
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Journal of Scheduling
Lower bounds for online makespan minimization on a small number of related machines
Journal of Scheduling
| Hi-index | 0.00 |