The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for on-line graph coloring
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Channel assignment and graph multicoloring
Handbook of wireless networks and mobile computing
The on-line first-fit algorithm for radio frequency assignment problems
Information Processing Letters
Theoretical Computer Science
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Randomized Lower Bounds for Online Path Coloring
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
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
Algorithms and Models for the On-Line Vertex-Covering
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Computer Science
Online promise problems with online width metrics
Journal of Computer and System Sciences
Online unit clustering: Variations on a theme
Theoretical Computer Science
Information Processing Letters
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
On the online unit clustering problem
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
On the online unit clustering problem
ACM Transactions on Algorithms (TALG)
On-line coloring of h-free bipartite graphs
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Designs, Codes and Cryptography
On the online track assignment problem
Discrete Applied Mathematics
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Online coloring graphs with high girth and high odd girth
Operations Research Letters
Theoretical Computer Science
Tight bounds for online vector bin packing
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Circumference, chromatic number and online coloring
Combinatorica
| Hi-index | 0.06 |