The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants (Q3507345): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-69311-6_30
+Normal rank
@@ Property / OpenAlex ID @@
+W2116542451
@@ Property / OpenAlex ID: W2116542451 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Capacitated Rectangle Stabbing
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for hitting objects with straight lines
+Normal rank
@@ Property / cites work @@
+Q4474116
@@ Property / cites work: Q4474116 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
+Normal rank
@@ Property / cites work @@
+Covering things with things
@@ Property / cites work: Covering things with things / rank @@
+Normal rank
@@ Property / cites work @@
+Station Location - Complexity and Approximation.
@@ Property / cites work: Station Location - Complexity and Approximation. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank