The following pages link to Algorithms and Computation (Q5712153):
Displaying 15 items.
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs (Q392198) (← links)
- Uniform multi-agent deployment on a ring (Q627178) (← links)
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
- Deterministic polynomial approach in the plane (Q2353250) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Gathering asynchronous oblivious mobile robots in a ring (Q2474070) (← links)
- Deterministic rendezvous in graphs (Q2509029) (← links)
- Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences (Q2799477) (← links)
- Asynchronous Deterministic Rendezvous on the Line (Q3599098) (← links)
- Deterministic Rendezvous in Restricted Graphs (Q5175104) (← links)
- Faster Treasure Hunt and Better Strongly Universal Exploration Sequences (Q5387786) (← links)
- Algorithms - ESA 2003 (Q5897245) (← links)
- Time versus cost tradeoffs for deterministic rendezvous in networks (Q6483581) (← links)