Pages that link to "Item:Q1416614"

The following pages link to The theory of search games and rendezvous. (Q1416614):

Displaying 50 items.

• Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
• Byzantine gathering in polynomial time (Q2146872) (← links)
• Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) (Q2148885) (← links)
• A search game on a hypergraph with booby traps (Q2173302) (← links)
• Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
• Search and rescue in the face of uncertain threats (Q2184077) (← links)
• Competitive search in a network (Q2184175) (← links)
• Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
• Interruptible algorithms for multiproblem solving (Q2197326) (← links)
• Meeting in a polygon by anonymous oblivious robots (Q2204780) (← links)
• Deterministic treasure hunt in the plane with angular hints (Q2205634) (← links)
• Treasure evacuation with one robot on a disk (Q2220826) (← links)
• Online failure diagnosis in interdependent networks (Q2226505) (← links)
• Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
• Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
• Beachcombing on strips and islands (Q2285133) (← links)
• Searching for a non-adversarial, uncooperative agent on a cycle (Q2285151) (← links)
• Search for an immobile hider on a stochastic network (Q2286995) (← links)
• Asynchronous approach in the plane: a deterministic polynomial algorithm (Q2318113) (← links)
• Approximate solutions for expanding search games on general networks (Q2327672) (← links)
• Search for an immobile hider in a known subset of a network (Q2328862) (← links)
• Search games on a network with travelling and search costs (Q2349413) (← links)
• Deterministic polynomial approach in the plane (Q2353250) (← links)
• Optimal discrete search with technological choice (Q2354015) (← links)
• Byzantine gathering in networks (Q2359766) (← links)
• Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
• Weighted search games (Q2378340) (← links)
• Collision-free network exploration (Q2396820) (← links)
• Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
• A common notion of clockwise can help in planar rendezvous (Q2433433) (← links)
• Map construction of unknown graphs by multiple agents (Q2456354) (← links)
• Line-of-sight rendezvous (Q2475830) (← links)
• Online searching with turn cost (Q2503358) (← links)
• Searching on a line: a complete characterization of the optimal solution (Q2513671) (← links)
• Rendezvous in networks in spite of delay faults (Q2629214) (← links)
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q2672445) (← links)
• Pebble guided optimal treasure hunt in anonymous graphs (Q2672573) (← 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)
• Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) (Q2947016) (← links)
• A Caching Game with Infinitely Divisible Hidden Material (Q2949985) (← links)
• Codes, lower bounds, and phase transitions in the symmetric rendezvous problem (Q2953697) (← links)
• Search Games: A Review (Q2961390) (← links)
• Search Games for an Immobile Hider (Q2961391) (← links)
• Tools to Manage Search Games on Lattices (Q2961392) (← links)
• Some Cinderella Ruckle Type Games (Q2961396) (← links)
• Rendezvous Problem (Q2961403) (← links)
• Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty (Q2961404) (← links)
• Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model (Q2961405) (← links)