Author:
Bar-Yehuda Reuven,Kutiel Gilad,Rawitz Dror
Publisher
Springer International Publishing
Reference12 articles.
1. Bachoore, E.H., Bodlaender, H.L.: Convex recoloring of leaf-colored trees. Technical report UU-CS–010, Department of Information and Computing Sciences, Utrecht University (2006)
2. Bar-Yehuda, R., Feldman, I., Rawitz, D.: Improved approximation algorithm for convex recoloring of trees. Theory Comput. Syst. 43(1), 3–18 (2008)
3. Bodlaender, H.L., Fellows, M.R., Langston, M.A., Ragan, M.A., Rosamond, F.A., Weyer, M.: Quadratic kernelization for convex recoloring of trees. Algorithmica 61(2), 362–388 (2011)
4. Lecture Notes in Computer Science;MB Campêlo,2013
5. Kammer, F., Tholey, T.: The complexity of minimum convex coloring. Discrete Appl. Math. 160(6), 810–833 (2012)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献