Q5743381 (Q5743381): Difference between revisions

@@ Property / cites work @@
+Polynomial-time data reduction for dominating set
@@ Property / cites work: Polynomial-time data reduction for dominating set / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417644
@@ Property / cites work: Q5417644 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization: New Upper and Lower Bound Techniques
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Q3113681
@@ Property / cites work: Q3113681 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel Bounds for Disjoint Cycles and Disjoint Paths
+Normal rank
@@ Property / cites work @@
+Advice classes of parametrized tractability
@@ Property / cites work: Advice classes of parametrized tractability / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for kernelizations and other preprocessing procedures
+Normal rank
@@ Property / cites work @@
+Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+Incompressibility through Colors and IDs
@@ Property / cites work: Incompressibility through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Faster fixed-parameter tractable algorithms for matching and packing problems
+Normal rank
@@ Property / cites work @@
+Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
+Normal rank
@@ Property / cites work @@
+Q5743378
@@ Property / cites work: Q5743378 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549693
@@ Property / cites work: Q3549693 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
+Normal rank
@@ Property / cites work @@
+Linear Problem Kernels for NP-Hard Problems on Planar Graphs
+Normal rank
@@ Property / cites work @@
+On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
+Normal rank
@@ Property / cites work @@
+Q5743381
@@ Property / cites work: Q5743381 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
+Normal rank
@@ Property / cites work @@
+Two Edge Modification Problems without Polynomial Kernels
+Normal rank
@@ Property / cites work @@
+Preprocessing of Min Ones Problems: A Dichotomy
@@ Property / cites work: Preprocessing of Min Ones Problems: A Dichotomy / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
+Normal rank
@@ Property / cites work @@
+A 4             <i>k</i>             <sup>2</sup>             kernel for feedback vertex set
+Normal rank