On-line coloring of sparse random graphs and random trees

The on-line first-fit algorithm for radio frequency assignment problems

Information Processing Letters

Online vertex colorings of random graphs without monochromatic subgraphs

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Optimal time slot assignment for mobile ad hoc networks

IWDC'05 Proceedings of the 7th international conference on Distributed Computing

Average-case complexity of backtrack search for coloring sparse random graphs

Journal of Computer and System Sciences