An on-line graph coloring algorithm with sublinear performance ratio
Discrete Mathematics
Lower bounds for on-line graph coloring
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Parallel and on-line graph coloring
Journal of Algorithms
Information Processing Letters
Tight bounds for online vector bin packing
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |