Author of the publication

Max-Cut Parameterized above the Edwards-Erdős Bound.

, , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 242-253. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Note on Max Lin-2 above Average., , and . Inf. Process. Lett., 110 (11): 451-454 (2010)Fixed-Parameter Tractability of Satisfying beyond the Number of Variables., , , , , and . SAT, volume 7317 of Lecture Notes in Computer Science, page 355-368. Springer, (2012)A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application., , , and . IPEC, volume 6478 of Lecture Notes in Computer Science, page 84-94. Springer, (2010)Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints, , , , and . CoRR, (2012)Parameterized complexity of MaxSat Above Average., , , , and . Theor. Comput. Sci., (2013)Max-Cut Parameterized Above the Edwards-Erdős Bound., , and . Algorithmica, 72 (3): 734-757 (2015)Parameterized Complexity of MaxSat above Average., , , , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 184-194. Springer, (2012)Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound., , and . FSTTCS, volume 18 of LIPIcs, page 400-411. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Parameterized Complexity of MaxSat Above Average, , , , and . CoRR, (2011)Maximum Balanced Subgraph Problem Parameterized Above Lower Bound, , , and . CoRR, (2012)