Pages that link to "Item:Q528203"
From MaRDI portal
The following pages link to Mutual visibility by luminous robots without collisions (Q528203):
Displaying 25 items.
- Complete visibility for robots with lights in \(\mathrm{O}(1)\) time (Q2007914) (← links)
- On the mutual visibility in Cartesian products and triangle-free graphs (Q2096353) (← links)
- On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis (Q2097333) (← links)
- Meeting in a polygon by anonymous oblivious robots (Q2204780) (← links)
- Mutual visibility in graphs (Q2668324) (← links)
- Mutual visibility on grid by asynchronous luminous robots (Q2672588) (← links)
- Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement (Q2803812) (← links)
- Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds (Q5087082) (← links)
- Explicit Communication Among Stigmergic Robots (Q5384466) (← links)
- Arbitrary pattern formation by asynchronous opaque robots with lights (Q5919044) (← links)
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement (Q5919050) (← links)
- Variety of mutual-visibility problems in graphs (Q6049930) (← links)
- Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality (Q6052703) (← links)
- TRAVERSING A GRAPH IN GENERAL POSITION (Q6090185) (← links)
- Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products (Q6090820) (← links)
- The canonical amoebot model: algorithms and concurrency control (Q6099032) (← links)
- Perpetual torus exploration by myopic luminous robots (Q6155243) (← links)
- Mutual-visibility sets in Cartesian products of paths and cycles (Q6196223) (← links)
- Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights (Q6488454) (← links)
- Mutual-visibility problems on graphs of diameter two (Q6568863) (← links)
- Mutual visibility of luminous robots despite angular inaccuracy (Q6590092) (← links)
- Mutual-visibility in strong products of graphs via total mutual-visibility (Q6611058) (← links)
- Fault-tolerant mutual visibility without any axis agreement in presence of mobility failure (Q6652472) (← links)
- The \(k\)-distance mutual-visibility problem in graphs (Q6661087) (← links)
- Total mutual-visibility in Hamming graphs (Q6667291) (← links)
