SEARCHING A POLYGONAL REGION FROM THE BOUNDARY (Q4682159): Difference between revisions

@@ Property / author @@
-Masafumi Yamashita
@@ Property / author: Masafumi Yamashita / rank @@
-Normal rank
@@ Property / author @@
+Masafumi Yamashita
@@ Property / author: Masafumi Yamashita / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
+Normal rank
@@ Property / cites work @@
+Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon
+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 Optimal Algorithm for Finding the Kernel of a Polygon
+Normal rank
@@ Property / cites work @@
+SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
+Normal rank
@@ Property / cites work @@
+The Searchlight Scheduling Problem
@@ Property / cites work: The Searchlight Scheduling Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Searching for a Mobile Intruder in a Polygonal Region
+Normal rank
@@ Property / cites work @@
+Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
+Normal rank
@@ Property / cites work @@
+Two-Guard Walkability of Simple Polygons
@@ Property / cites work: Two-Guard Walkability of Simple Polygons / rank @@
+Normal rank