A 2O(k)poly(n) algorithm for the parameterized Convex Recoloring problem

In this paper we present a parameterized algorithm that solves the Convex Recoloring problem for trees in O(k256∗poly(n)). This improves the currently best upper bound of O(kk(k/log k)∗poly(n)) achieved by Moran and Snir.