@inproceedings{12ce60503ac440e7b97c5a703452dc29,

title = "Max-Cut Parameterized above the Edwards-Erd{\H o}s Bound",

abstract = "We study the boundary of tractability for the max-cut problem in graphs. Our main result shows that max-cut above the edwards-erdos bound is fixed-parameter tractable: we give an algorithm that for any connected graph with n vertices and m edges finds a cut of size \frac{m}{2} + \frac{n-1}{4} + k \frac{m}{2} + \frac{n-1}{4} + k in time 2 o(k)·n 4, or decides that no such cut exists.this answers a long-standing open question from parameterized complexity that has been posed a number of times over the past 15 years.our algorithm is asymptotically optimal, under the exponential time hypothesis, and is strengthened by a polynomial-time computable kernel of polynomial size.",

author = "Robert Crowston and Mark Jones and Matthias Mnich",

year = "2012",

doi = "10.1007/978-3-642-31594-7_21",

language = "English",

isbn = "978-3-642-31593-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "242--253",

editor = "Artur Czumaj and Kurt Mehlhorn and Andrew Pitts and Roger Wattenhofer",

booktitle = "Automata, Languages and Programming",

address = "United States",

}