Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes (Q2945667): Difference between revisions

@@ Property / cites work @@
+Guarding polyominoes
@@ Property / cites work: Guarding polyominoes / rank @@
+Normal rank
@@ Property / cites work @@
+The art gallery theorem for polyominoes
@@ Property / cites work: The art gallery theorem for polyominoes / rank @@
+Normal rank
@@ Property / cites work @@
+Partition into cliques for cubic graphs: Planar case, complexity and approximation
+Normal rank
@@ Property / cites work @@
+A combinatorial theorem in plane geometry
@@ Property / cites work: A combinatorial theorem in plane geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability results for guarding polygons and terrains
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038729
@@ Property / cites work: Q4038729 / rank @@
+Normal rank
@@ Property / cites work @@
+On guarding the vertices of rectilinear domains
@@ Property / cites work: On guarding the vertices of rectilinear domains / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of art gallery problems
@@ Property / cites work: Computational complexity of art gallery problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
+Normal rank
@@ Property / cites work @@
+POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
+Normal rank