1. Bousquet, N., Daligault, J., Thomassé, S.: Multicut is FPT. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 459–468. ACM, New York (2011),
http://doi.acm.org/10.1145/1993636.1993698
2. Cǎlinescu, G., Fernandes, C.G., Reed, B.: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms 48(2), 333–359 (2003),
http://www.sciencedirect.com/science/article/pii/S0196677403000737
3. Chawla, S., Krauthgamer, R., Kumar, R., Rabani, Y., Sivakumar, D.: On the hardness of approximating multicut and sparsest-cut. Computational Complexity 15(2), 94–114 (2006),
http://dx.doi.org/10.1007/s00037-006-0210-9
4. Chen, J., Liu, Y., Lu, S., O’Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5) (2008)
5. Lecture Notes in Computer Science;R. Chitnis,2013