Before revision:  In this paper we present an FPT algorithm for matching cut problem for general graphs with running time O( 2^{O(k\log k)}n^{O(1)} ) . This is the first FPT algorithm for the MATCHING CUT where the dependence on the matching cut size as a parameter is explicit and bounded .
After revision:  In this paper we present an FPT algorithm for matching cut problem for general graphs with running time O( 2^{O(k\log k)}n^{O(1)} ) . This is the first FPT algorithm for the MATCHING CUT (and d-CUT) with an explicit dependence on this parameter. We also observe a lower bound of 2^{\Omega(k) .