For a collection F of graphs, given a graph G and an integer k, the F -Contraction problem asks whether we can contract k edges in G to obtain a graph in F. F -Contraction is well studied and known to be C-complete for several classes F. Heggerners et al. [Algorithmica (2014)] were the first to explicitly study contraction problems in the realm of parameterized complexity. They presented FPT algorithms for Tree-Contraction and Path-Contraction. In this paper, we study contraction to a class larger than trees, namely, cactus graphs. We present an FPT algorithm for Cactus-Contraction that runs in (Formula Presented) time for some constant c. © 2018, Springer International Publishing AG, part of Springer Nature.