The following pages link to Searching in the plane (Q690242):
Displaying 50 items.
- Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) (Q2148885) (← links)
- Leaves on the line and in the plane (Q2184619) (← links)
- Deterministic treasure hunt in the plane with angular hints (Q2205634) (← links)
- Priority evacuation from a disk: the case of \(n \geq 4\) (Q2210503) (← links)
- A tight lower bound for semi-synchronous collaborative grid exploration (Q2220396) (← links)
- Treasure evacuation with one robot on a disk (Q2220826) (← links)
- Beachcombing on strips and islands (Q2285133) (← links)
- Searching for a non-adversarial, uncooperative agent on a cycle (Q2285151) (← links)
- Priority evacuation from a disk: the case of \(n = 1,2,3\) (Q2285157) (← links)
- Greedy metric minimum online matchings with random arrivals (Q2294274) (← links)
- Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
- Group search of the plane with faulty robots (Q2326387) (← links)
- Walking in streets with minimal sensing (Q2355994) (← links)
- Fast rendezvous on a cycle by agents with different speeds (Q2357150) (← links)
- Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
- The ANTS problem (Q2401118) (← links)
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q2415368) (← links)
- Multi-target ray searching problems (Q2453158) (← links)
- Online searching with turn cost (Q2503358) (← links)
- Honey-pot constrained searching with local sensory information (Q2507866) (← links)
- Searching on a line: a complete characterization of the optimal solution (Q2513671) (← links)
- Online search for a hyperplane in high-dimensional Euclidean space (Q2671802) (← links)
- Pebble guided optimal treasure hunt in anonymous graphs (Q2672573) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (Q2680178) (← links)
- Optimal Distributed Searching in the Plane with and Without Uncertainty (Q2803811) (← links)
- A General Framework for Searching on a Line (Q2803819) (← links)
- Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
- Walking in Streets with Minimal Sensing (Q2867134) (← links)
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) (Q2947016) (← links)
- Search Games: A Review (Q2961390) (← links)
- Online Graph Exploration: New Results on Old and New Algorithms (Q3012942) (← links)
- (Q3035115) (← links)
- MULTIDIMENSIONAL ONLINE MOTION PLANNING FOR A SPHERICAL ROBOT (Q3070042) (← links)
- Deterministic Meeting of Sniffing Agents in the Plane* (Q3174747) (← links)
- Treasure hunt with barely communicating agents (Q3300812) (← links)
- God save the queen (Q3305734) (← links)
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (Q3451755) (← links)
- A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line (Q3453279) (← links)
- Treasure Hunt with Advice (Q3460725) (← links)
- COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS (Q3575385) (← links)
- Competitive Algorithms for Layered Graph Traversal (Q4210157) (← links)
- LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS (Q4682162) (← links)
- Walking streets faster (Q5054825) (← links)
- Lower bounds in on-line geometric searching metric searching (Q5055955) (← links)
- Querying with Uncertainty (Q5056054) (← links)
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle (Q5056057) (← links)
- Going home through an unknown street (Q5057428) (← links)
- Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations (Q5066876) (← links)
- (Q5090453) (← links)
