An improved kernel for max-bisection above tight lower bound (Q1985605): Difference between revisions

@@ Property / cites work @@
+Parameterized computational complexity of Dodgson and Young elections
+Normal rank
@@ Property / cites work @@
+Approximating maximum agreement forest on multiple binary trees
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Some Extremal Properties of Bipartite Subgraphs
@@ Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4550236
@@ Property / cites work: Q4550236 / rank @@
+Normal rank
@@ Property / cites work @@
+\textsc{Max-Cut} parameterized above the Edwards-Erdős bound
+Normal rank
@@ Property / cites work @@
+Linear kernels and linear-time algorithms for finding large cuts
+Normal rank
@@ Property / cites work @@
+A note on approximating Max-Bisection on regular graphs
+Normal rank
@@ Property / cites work @@
+The RPR2 rounding technique for semidefinite programs
+Normal rank
@@ Property / cites work @@
+Dealing with several parameterized problems by random methods
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for edge biclique and related problems
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
+Normal rank
@@ Property / cites work @@
+Fixed-parameter complexity in AI and nonmonotonic reasoning
+Normal rank
@@ Property / cites work @@
+Note on maximal bisection above tight lower bound
@@ Property / cites work: Note on maximal bisection above tight lower bound / rank @@
+Normal rank
@@ Property / cites work @@
+A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
+Normal rank
@@ Property / cites work @@
+Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Q4654270
@@ Property / cites work: Q4654270 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced Judicious Bipartition is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
+Normal rank
@@ Property / cites work @@
+Bisections above Tight Lower Bounds
@@ Property / cites work: Bisections above Tight Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+A 2-approximation for the maximum satisfying bisection problem
+Normal rank
@@ Property / cites work @@
+A .699-approximation algorithm for Max-Bisection.
@@ Property / cites work: A .699-approximation algorithm for Max-Bisection. / rank @@
+Normal rank