Summary: The bipartite contraction problem takes as input an \(n\)-vertex graph \(G\) and an integer \(k\), and the task is to determine whether we can obtain a bipartite graph from \(G\) by a sequence of at most \(k\) edge contractions. We show that bipartite contraction is fixed-parameter tractable when parameterized by \(k\). Despite a strong resemblance between bipartite contraction and the classical odd cycle transversal (OCT) problem, the methods developed to tackle OCT do not seem to be directly applicable to bipartite contraction. To obtain our result, we combine several techniques and concepts that are central in parameterized complexity: iterative compression, irrelevant vertices, and important separators. To the best of our knowledge, this is the first time the irrelevant vertex technique and the concept of important separators are applied in unison. Furthermore, our algorithm may serve as a comprehensible example of the usage of the irrelevant vertex technique.