Author:
Epstein Leah,van Stee Rob
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Lecture Notes in Computer Science;T.M. Chan,2007
2. Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. SIAM Journal on Computing 33(6), 1417–1440 (2004)
3. Gyárfás, A., Lehel, J.: On-line and first-fit colorings of graphs. J. Graph Theory 12, 217–227 (1988)
4. Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congr. Numer. 33, 143–153 (1981)
5. Kierstead, H.A.: Coloring graphs on-line. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art, pp. 281–305. Springer, Heidelberg (1998)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献