  We present an algorithm that finds a feedback arc set of size $k$ in a
tournament in time $n^{O(1)}2^{O(\sqrt{k})}$. This is asymptotically faster
than the running time of previously known algorithms for this problem.
