The following pages link to (Q4952719):
Displayed 19 items.
- Studying the stochastic capturing of moving intruders by mobile sensors (Q356177) (← links)
- Capture bounds for visibility-based pursuit evasion (Q482339) (← links)
- Link distance and shortest path problems in the plane (Q634253) (← links)
- Searching for mobile intruders in circular corridors by two 1-searchers (Q643019) (← links)
- A property of random walks on a cycle graph (Q740121) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- Sweeping simple polygons with the minimum number of chain guards (Q845964) (← links)
- Escaping offline searchers and isoperimetric theorems (Q955225) (← links)
- An efficient algorithm for the three-guard problem (Q1003478) (← links)
- Simple algorithms for searching a polygon with flashlights (Q1847385) (← links)
- Optimum sweeps of simple polygons with two guards (Q2445401) (← links)
- Minimization of the maximum distance between the two guards patrolling a polygonal region (Q2445875) (← links)
- Mobile sensor intrusion detection under any shape of curve (Q2450539) (← links)
- A unified and efficient solution to the room search problem (Q2479474) (← links)
- Hide-and-Seek: Algorithms for Polygon Walk Problems (Q3010428) (← links)
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear (Q3512447) (← links)
- Minimum Time Multi-UGV Surveillance (Q3589730) (← links)
- Link Distance and Shortest Path Problems in the Plane (Q3638449) (← links)
- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem (Q5387746) (← links)