Vertex-to-point conflict-free chromatic guarding is NP-hard (Q2154089): Difference between revisions

@@ Property / cites work @@
+Conflict-free chromatic art gallery coverage
@@ Property / cites work: Conflict-free chromatic art gallery coverage / rank @@
+Normal rank
@@ Property / cites work @@
+On conflict-free chromatic guarding of simple polygons
+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 @@
+Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
+Normal rank
@@ Property / cites work @@
+Computational complexity of the chromatic art gallery problem for orthogonal polygons
+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 @@
+Planar 3-SAT with a clause/variable cycle
@@ Property / cites work: Planar 3-SAT with a clause/variable cycle / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
+Normal rank