Pages that link to "Item:Q1416614"
From MaRDI portal
The following pages link to The theory of search games and rendezvous. (Q1416614):
Displayed 50 items.
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- Anonymous meeting in networks (Q262278) (← links)
- Infrastructure security games (Q297288) (← links)
- Optimal search and ambush for a hider who can escape the search region (Q322755) (← links)
- Edge search number of cographs (Q415273) (← links)
- A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources (Q438788) (← links)
- Searching for an axis-parallel shoreline (Q443717) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Screening and hiding versus search (Q486938) (← links)
- Simultaneous approximation of multi-criteria submodular function maximization (Q489121) (← links)
- Ambush and active search in multistage predator-prey interactions (Q493043) (← links)
- Deterministic symmetric rendezvous with tokens in a synchronous torus (Q540154) (← links)
- A foraging problem: sit-and-wait versus active predation (Q621674) (← links)
- A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Rendezvous of heterogeneous mobile agents in edge-weighted networks (Q896142) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Search for an immobile entity on a network (Q933506) (← links)
- Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
- Equilibria of two-sided matching games with common preferences (Q1041991) (← links)
- Patrolling a perimeter (Q1926970) (← links)
- Mapping simple polygons: how robots benefit from looking back (Q1939675) (← links)
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols (Q1954192) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← 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)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Weighted search games (Q2378340) (← 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)
- 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)
- Searching symmetric networks with Utilitarian-Postman paths (Q3057096) (← links)
- Synchronous Rendezvous for Location-Aware Agents (Q3095348) (← links)
- An Asymptotic Solution of Dresher’s Guessing Game (Q3098098) (← links)
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
- Black Hole Search in Directed Graphs (Q3408170) (← links)
- Technical note: Find a hidden “treasure” (Q3442877) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)