Gathering of oblivious robots on infinite grids with minimum traveled distance (Q528200): Difference between revisions

@@ Property / cites work @@
+How to meet asynchronously at polynomial cost
@@ Property / cites work: How to meet asynchronously at polynomial cost / rank @@
+Normal rank
@@ Property / cites work @@
+Gathering of asynchronous robots with limited visibility
+Normal rank
@@ Property / cites work @@
+Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
+Normal rank
@@ Property / cites work @@
+Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
+Normal rank
@@ Property / cites work @@
+Gathering asynchronous oblivious mobile robots in a ring
+Normal rank
@@ Property / cites work @@
+Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
+Normal rank
@@ Property / cites work @@
+Gathering on rings under the look-compute-move model
+Normal rank
@@ Property / cites work @@
+Gathering of robots on anonymous grids and trees without multiplicity detection
+Normal rank
@@ Property / cites work @@
+Optimal Gathering of Oblivious Robots in Anonymous Graphs
+Normal rank
@@ Property / cites work @@
+Q4352313
@@ Property / cites work: Q4352313 / rank @@
+Normal rank
@@ Property / cites work @@
+Network Exploration by Silent and Oblivious Robots
+Normal rank
@@ Property / cites work @@
+The algebraic degree of geometric optimization problems
+Normal rank
@@ Property / cites work @@
+Euclidean Constructibility in Graph-Minimization Problems
+Normal rank