The parameterized complexity of unique coverage and its variants (Q2392923): Difference between revisions

@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized hashing and parent-identifying codes.
@@ Property / cites work: Generalized hashing and parent-identifying codes. / rank @@
+Normal rank
@@ Property / cites work @@
+On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
+Normal rank
@@ Property / cites work @@
+A hypergraph approach to the identifying parent property: The case of multiple parents
+Normal rank
@@ Property / cites work @@
+Perfect Code is \(W[1]\)-complete
@@ Property / cites work: Perfect Code is \(W[1]\)-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
+Normal rank
@@ Property / cites work @@
+Combination Can Be Hard: Approximability of the Unique Coverage Problem
+Normal rank
@@ Property / cites work @@
+Incompressibility through Colors and IDs
@@ Property / cites work: Incompressibility through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579437
@@ Property / cites work: Q3579437 / rank @@
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Budgeted Unique Coverage Problem and Color-Coding
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of the Unique Coverage Problem
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions
+Normal rank