1. Briggs, P., Cooper, K.D., Torczon, L.: Improvements to graph coloring register allocation. ACM Transactions on Programming Languages and Systems 16(3), 428–455 (1994)
2. Buchsbaum, A.L., Karloff, H., Kenyon, C., Reingold, N., Thorup, M.: OPT versus LOAD in dynamic storage allocation. In: Proceedioings of the 35th Annual ACM Symposium on Therory of Computing (STOC), pp. 556–564 (2003)
3. Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S.: Restricted strip covering and the sensor cover problem. The Conference version appears in Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1056–1063 (2007), The full version is at http://arxiv.org/PS_cache/cs/pdf/0605/0605102v1.pdf
4. Chaitin, G.J.: Register allocation & spilling via graph coloring. In: Proceedings of the SIGPLAN Symposium on Compiler Construction, pp. 98–105. ACM Press, New York (1982)
5. Chow, F.C., Hennessy, J.L.: The priority-based coloring approach to register allocation. ACM Transactions on Programming Languages and Systems 12(4), 501–536 (1990)