A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162): Difference between revisions

@@ Property / cites work @@
+Integer Programming: Methods, Uses, Computations
@@ Property / cites work: Integer Programming: Methods, Uses, Computations / 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 @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of losing width
@@ Property / cites work: On the hardness of losing width / rank @@
+Normal rank
@@ Property / cites work @@
+On Multiway Cut Parameterized above Lower Bounds
@@ Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Raising The Bar For V<scp>ertex</scp> C<scp>over</scp>: Fixed-parameter Tractability Above A Higher Guarantee
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
+Normal rank
@@ Property / cites work @@
+Q4967164
@@ Property / cites work: Q4967164 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Parameterized Algorithms Using Linear Programming
+Normal rank
@@ Property / cites work @@
+Q4133994
@@ Property / cites work: Q4133994 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterizing above Guaranteed Values: MaxSat and MaxCut
+Normal rank
@@ Property / cites work @@
+A parameterized view on matroid optimization problems
+Normal rank
@@ Property / cites work @@
+The complexity of König subgraph problems and above-guarantee vertex cover
+Normal rank
@@ Property / cites work @@
+Q2904774
@@ Property / cites work: Q2904774 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Q3135082
@@ Property / cites work: Q3135082 / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of Menger's graph theorem
@@ Property / cites work: Applications of Menger's graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Flowers and Vertex Cover
@@ Property / cites work: Paths, Flowers and Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Almost 2-SAT is fixed-parameter tractable
@@ Property / cites work: Almost 2-SAT is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/16m1104585
+Normal rank
@@ Property / OpenAlex ID @@
+W2545198300
@@ Property / OpenAlex ID: W2545198300 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129456941
@@ Property / Wikidata QID: Q129456941 / rank @@
+Normal rank