Improved FPT algorithm for feedback vertex set problem in bipartite tournament

We present an O(k3n2+n3) time FPT algorithm for the feedback vertex set problem in a bipartite tournament on n vertices with integral weights. This improves the previously best known O(k3.12n4) time FPT algorithm for the problem.