Vertex Cover Structural Parameterization Revisited (Q3181056): Difference between revisions

@@ Property / Wikidata QID @@
+Q60488384
@@ Property / Wikidata QID: Q60488384 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00770
@@ Property / arXiv ID: 1603.00770 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel bounds for disjoint cycles and disjoint paths
+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 @@
+Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Vertex Cover Structural Parameterization Revisited
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+A unified approximation algorithm for node-deletion problems
+Normal rank
@@ Property / cites work @@
+Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
+Normal rank
@@ Property / cites work @@
+Q5363786
@@ Property / cites work: Q5363786 / rank @@
+Normal rank