A. Appel and L. George, Coalescing challenge, 2000.

A. W. Appel and L. George, Optimal spilling for CISC machines with few registers, Proc. of the ACM SIGPLAN Conference PLDI'01, pp.243-253, 2001.

F. Bouchez, A. Darte, C. Guillon, and F. Rastello, Register allocation and spill complexity under SSA, 2005.

F. Bouchez, A. Darte, and F. Rastello, On the Complexity of Register Coalescing, International Symposium on Code Generation and Optimization (CGO'07), pp.102-114, 2007.
DOI : 10.1109/CGO.2007.26

P. Briggs, Register allocation via graph coloring, 1992.

P. Briggs, K. Cooper, and L. Torczon, Improvements to graph coloring register allocation, ACM Transactions on Programming Languages and Systems, vol.16, issue.3, pp.428-455, 1994.
DOI : 10.1145/177492.177575
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.253

P. Brisk, F. Dabiri, J. Macbeth, and M. Sarrafzadeh, Polynomial time graph coloring register allocation, 14th International Workshop on Logic and Synthesis, 2005.

G. Chaitin, M. Auslander, A. Chandra, J. Cocke, M. Hopkins et al., Register allocation via coloring, Computer Languages, vol.6, issue.1, pp.47-57, 1981.
DOI : 10.1016/0096-0551(81)90048-5

R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck, Efficiently computing static single assignment form and the control dependence graph, ACM Transactions on Programming Languages and Systems, vol.13, issue.4, pp.451-490, 1991.
DOI : 10.1145/115372.115320

L. George and A. W. Appel, Iterated register coalescing, ACM Transactions on Programming Languages and Systems, vol.18, issue.3, pp.300-324, 1996.
DOI : 10.1145/229542.229546
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4803

M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 1980.

D. Grund and S. Hack, A Fast Cutting-Plane Algorithm for Optimal Coalescing, Compiler Construction, pp.111-125, 2007.
DOI : 10.1007/978-3-540-71229-9_8

S. Hack, D. Grund, and G. Goos, Register Allocation for Programs in SSA-Form, Compiler Construction, 2006.
DOI : 10.1007/11688839_20

A. Leung and L. George, A new mlrisc register allocator, 1999.

J. Park and S. Moon, Optimistic register coalescing, ACM Transactions on Programming Languages and Systems, vol.26, issue.4, 2004.
DOI : 10.1145/1011508.1011512
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.9438

F. M. Pereira and J. Palsberg, Register Allocation Via Coloring of Chordal Graphs, Proc. of APLAS'05, Asian Symp. on Progr. Languages and Systems, pp.315-329, 2005.
DOI : 10.1007/11575467_21

F. Rastello, F. Deferrì, and C. Guillon, Optimizing translation out of SSA using renaming constraints, International Symposium on Code Generation and Optimization, 2004. CGO 2004., pp.265-278, 2004.
DOI : 10.1109/CGO.2004.1281680

V. C. Sreedhar, R. D. Ju, D. M. Gillies, and V. Santhanam, Translating Out of Static Single Assignment Form, SAS'99, pp.194-210, 1999.
DOI : 10.1007/3-540-48294-6_13

S. R. Vegdahl, Using node merging to enhance graph coloring, Proc. of the ACM SIG- PLAN Conf. PLDI'99, pp.150-154, 1999.