Hans L. Bodlaender Michael R. Fellows Michael T. Hallett Todd Wareham Tandy Warnow The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. 167-188 2000 244 Theor. Comput. Sci. 1-2 db/journals/tcs/tcs244.html#BodlaenderFHWW00 http://dx.doi.org/10.1016/S0304-3975(98)00342-9