The following pages link to THE TWO GUARDS PROBLEM (Q4030351):
Displaying 32 items.
- Searching for mobile intruders in circular corridors by two 1-searchers (Q643019) (← links)
- LR-visibility in polygons (Q676582) (← links)
- Searching a polygonal region by a group of stationary \(k\)-searchers (Q834883) (← links)
- Sweeping simple polygons with the minimum number of chain guards (Q845964) (← links)
- An efficient algorithm for the three-guard problem (Q1003478) (← links)
- An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons (Q1336739) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- Simple algorithms for searching a polygon with flashlights (Q1847385) (← links)
- Partially walking a polygon (Q2331219) (← 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)
- Characterizing and recognizing LR-visibility polygons (Q2448917) (← links)
- A unified and efficient solution to the room search problem (Q2479474) (← links)
- Hide-and-Seek: Algorithms for Polygon Walk Problems (Q3010428) (← links)
- GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA (Q3373056) (← links)
- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable (Q3502674) (← links)
- FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE (Q3562853) (← links)
- CLEARING A POLYGON WITH TWO 1-SEARCHERS (Q3628102) (← links)
- (Q4295485) (← links)
- EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS (Q4513235) (← links)
- The burglar problem with multiple options (Q4632844) (← links)
- (Q4659754) (← links)
- SEARCHING A POLYGONAL REGION FROM THE BOUNDARY (Q4682159) (← links)
- SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER (Q4682196) (← links)
- AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT (Q4818547) (← links)
- SEARCHING A ROOM BY TWO GUARDS (Q4818565) (← links)
- Finding all weakly-visible chords of a polygon in linear time (Q5056171) (← links)
- Partially Walking a Polygon (Q5091053) (← links)
- On hamiltonian triangulations in simple polygons (Extended Abstract) (Q5096949) (← links)
- Line-of-Sight Pursuit in Monotone and Scallop Polygons (Q5149564) (← links)
- (Q5501374) (← links)
- Algorithms and Computation (Q5712171) (← links)
