Q5075825 (Q5075825): Difference between revisions

@@ Property / cites work @@
+A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Q3113681
@@ Property / cites work: Q3113681 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743378
@@ Property / cites work: Q5743378 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds Through Colors and IDs
@@ Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+New Limits to Classical and Quantum Instance Compression
+Normal rank
@@ Property / cites work @@
+Lossy Kernels for Hitting Subgraphs
@@ Property / cites work: Lossy Kernels for Hitting Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Lossy Kernels for Connected Dominating Set on Sparse Graphs
+Normal rank
@@ Property / cites work @@
+Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+Connected Feedback Vertex Set in Planar Graphs
@@ Property / cites work: Connected Feedback Vertex Set in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A completeness theory for polynomial (Turing) kernelization
+Normal rank
@@ Property / cites work @@
+Q5743381
@@ Property / cites work: Q5743381 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4967164
@@ Property / cites work: Q4967164 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization – Preprocessing with a Guarantee
@@ Property / cites work: Kernelization – Preprocessing with a Guarantee / rank @@
+Normal rank
@@ Property / cites work @@
+Lossy kernelization
@@ Property / cites work: Lossy kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+FPT algorithms for connected feedback vertex set
@@ Property / cites work: FPT algorithms for connected feedback vertex set / rank @@
+Normal rank
@@ Property / cites work @@
+A 4             <i>k</i>             <sup>2</sup>             kernel for feedback vertex set
+Normal rank
@@ Property / cites work @@
+The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
+Normal rank