Note on maximal bisection above tight lower bound (Q1675768): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1999270628
@@ Property / OpenAlex ID: W1999270628 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2848
@@ Property / arXiv ID: 1005.2848 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417644
@@ Property / cites work: Q5417644 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2784326
@@ Property / cites work: Q2784326 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4550236
@@ Property / cites work: Q4550236 / rank @@
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel Bounds for Disjoint Cycles and Disjoint Paths
+Normal rank
@@ Property / cites work @@
+Note on Max Lin-2 above average
@@ Property / cites work: Note on Max Lin-2 above average / rank @@
+Normal rank
@@ Property / cites work @@
+Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above Average
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / 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 @@
+Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover problem parameterized above and below tight bounds
+Normal rank
@@ Property / cites work @@
+Betweenness parameterized above tight lower bound
@@ Property / cites work: Betweenness parameterized above tight lower bound / rank @@
+Normal rank
@@ Property / cites work @@
+A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
+Normal rank
@@ Property / cites work @@
+The linear arrangement problem parameterized above guaranteed value
+Normal rank
@@ Property / cites work @@
+Fixed-parameter complexity of minimum profile problems
+Normal rank
@@ Property / cites work @@
+Approximation and intractability results for the maximum cut problem and its variants
+Normal rank
@@ Property / cites work @@
+Q4255576
@@ Property / cites work: Q4255576 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterizing above Guaranteed Values: MaxSat and MaxCut
+Normal rank
@@ Property / cites work @@
+Parameterizing above or below guaranteed values
@@ Property / cites work: Parameterizing above or below guaranteed values / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of König subgraph problems and above-guarantee vertex cover
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval Completion Is Fixed Parameter Tractable
@@ Property / cites work: Interval Completion Is Fixed Parameter Tractable / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1675768