Searching a polygonal region by a group of stationary \(k\)-searchers (Q834883): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2004.06.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2048236631
@@ Property / OpenAlex ID: W2048236631 / 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 @@
+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 @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+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 @@
+Searching for mobile intruders in a polygonal region by a group of mobile searchers
+Normal rank