The following pages link to Searching in the plane (Q690242):
Displaying 34 items.
- A tight lower bound for semi-synchronous collaborative grid exploration (Q5090903) (← links)
- (Q5091040) (← links)
- Competitive Searching for a Line on a Line Arrangement. (Q5091041) (← links)
- Linear rendezvous with asymmetric clocks (Q5091103) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- An Improved Online Algorithm for the Traveling Repairperson Problem on a Line (Q5092364) (← links)
- Position-independent near optimal searching and on-line recognition in star polygons (Q5096946) (← links)
- Linear Search with Terrain-Dependent Speeds (Q5283387) (← links)
- Finding defectives on a line by random docking and interval group tests (Q5367521) (← links)
- (Q5708535) (← links)
- Fast two-robot disk evacuation with wireless communication (Q5915701) (← links)
- Time-energy tradeoffs for evacuation by two robots in the wireless model (Q5919064) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- Lower bounds in on-line geometric searching (Q5931368) (← links)
- The ultimate strategy to search on \(m\) rays? (Q5941439) (← links)
- Parallel searching on \(m\) rays (Q5943313) (← links)
- On-line single-server dial-a-ride problems (Q5958715) (← links)
- Best-of-both-worlds analysis of online search (Q6066770) (← links)
- Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs (Q6075758) (← links)
- Parametrized Metrical Task Systems (Q6084418) (← links)
- Impact of knowledge on the cost of treasure hunt in trees (Q6087562) (← links)
- Search on a Line by Byzantine Robots (Q6114825) (← links)
- Weighted online search (Q6133641) (← links)
- Optimal circle search despite the presence of faulty robots (Q6161451) (← links)
- Algorithms for \(p\)-Faulty Search on a half-line (Q6174824) (← links)
- Online search with a hint (Q6186319) (← links)
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs (Q6195335) (← links)
- Competitive searching in polygons—Beyond generalised streets (Q6487943) (← links)
- Tight bounds for deterministic high-dimensional grid exploration (Q6535010) (← links)
- Evacuation of equilateral triangles by mobile agents of limited communication range (Q6536151) (← links)
- Optimal circle search despite the presence of faulty robots (Q6536163) (← links)
- Competitive searching over terrains (Q6547937) (← links)
- A new competitive algorithm for agent searching in unknown streets (Q6567764) (← links)
- Overcoming probabilistic faults in disoriented linear search (Q6614002) (← links)
