Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-016-0216-x
@@ Property / DOI: 10.1007/s00453-016-0216-x / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2176388081
@@ Property / OpenAlex ID: W2176388081 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07642
@@ Property / arXiv ID: 1511.07642 / rank @@
+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 @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952637
@@ Property / cites work: Q4952637 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric red-blue set cover for unit squares and related problems
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+Red-blue covering problems and the consecutive ones property
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster fixed-parameter tractable algorithms for matching and packing problems
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+On two techniques of combining branching and treewidth
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Point Line Cover
@@ Property / cites work: Point Line Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Covering things with things
@@ Property / cites work: Covering things with things / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Independence and Domination on Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-016-0216-X
@@ Property / DOI: 10.1007/S00453-016-0216-X / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1679222