(k,n-k)-Max-Cut: An O∗(2p)-Time Algorithm and a Polynomial Kernel - Saurabh, Saket; Zehavi, Meirav (Algorithmica, 2018)
Keywords: Algorithm Analysis and Problem Complexity; Algorithms; Computer Science; Computer Systems Organization and Communication Networks; Data Structures and Information Theory; Dynamic programming; Mathematics of Computing; Polynomials; Set theory; Theory of Computation; Trees; Bounded search tree; Parameterized algorithm; Kernel; Max-Cut