Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Bar-Noy, A., Mayer, A., Schieber, B., Sudan, M.: Guaranteeing fair service to persistent dependent tasks. SIAM Journal on Computing 27, 1168–1189 (1998)
2. Borowiecki, P.: Characterization of graphs critical for First-Fit graph coloring. In: 13. Workshop on Discrete Optimization, Burg, pp. 8–12 (1998)
3. Borowiecki, P.: On-line coloring of graphs. In: Kubale, M. (ed.) Graph colorings. Contemporary Mathematics 352, pp. 21–33. American Mathematical Society (2004)
4. Borowiecki, P.: On-line
$\cal P$
-coloring of graphs. Discussiones Mathematicae Graph Theory 26, 389–401 (2006)
5. Drozdowski, M.: Scheduling multiprocessor tasks - an overview. European J. Oper. Res. 94, 215–230 (1996)