Sweeping simple polygons with the minimum number of chain guards (Q845964): Difference between revisions

@@ Property / cites work @@
+Q4952719
@@ Property / cites work: Q4952719 / rank @@
+Normal rank
@@ Property / cites work @@
+AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
@@ Property / cites work: AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+THE TWO GUARDS PROBLEM
@@ Property / cites work: THE TWO GUARDS PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
+Normal rank
@@ Property / cites work @@
+SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
+Normal rank
@@ Property / cites work @@
+Searching for a Mobile Intruder in a Polygonal Region
+Normal rank
@@ Property / cites work @@
+SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
@@ Property / cites work: SEARCHING A POLYGONAL REGION FROM THE BOUNDARY / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Geometry and Graph Theory
@@ Property / cites work: Combinatorial Geometry and Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank