757 entries. Keys are used as [Key] citations throughout the catalogue. Each entry says which models and problems cite it and in what role; filter by model, role and kind of publication.
Shannon1951Mazeconference
Claude E. Shannon (1951). Presentation of a maze-solving machine. Transactions of the 8th Conference on Cybernetics (Macy Conference), pp. 173–180.
No DOI; citation details as given by Disser et al. 2019. The link is a popular account of the machine (Theseus, first prototype 1950), not the paper.
Bellman1963Optimaljournal
Richard Bellman (1963). An Optimal Search. SIAM Review 5(3):274.
Problem statement posing linear search. Metadata from Crossref; not read, cited as reported by Czyzowicz2021Byzantine and Brandt2020Rays.
Beck1964Linearjournal
Anatole Beck (1964). On the linear search problem. Israel Journal of Mathematics 2(4):221–228.
Blum1978Compassconference
Manuel Blum, Dexter Kozen (1978). On the power of the compass (or, why mazes are easier to search than graphs). FOCS 1978, pp. 132–142.
Checked against the full text: two pebbles, or two cooperating automata, search every maze; no three automata search all finite cubic embedded graphs (Theorem 6.1).
Budach1978Labyrinthsjournal
Lothar Budach (1978). Automata and labyrinths. Mathematische Nachrichten 86:195–282.
Aleliunas1979Randomconference
Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff (1979). Random walks, universal traversal sequences, and the complexity of maze problems. FOCS 1979, pp. 218–223.
Rollik1980Planarjournal
Hans-Anton Rollik (1980). Automaten in planaren Graphen. Acta Informatica 13(3):287–298.
First appeared in 1979.
Kutten1988Stepwiseconference
Shay Kutten (1988). Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed networks, or: Traversing one way streets with no map. ICCC 1988 (Computer Communication Technologies for the 90's), pp. 446–452.
Cited by Italiano et al. 2025 as the origin of the deficiency; reference copied from that paper's bibliography on 1 November 2026; no DOI; full text not read.
Dudek1991Roboticjournal
G. Dudek, M. Jenkin, E. Milios, D. Wilkes (1991). Robotic exploration as graph construction. IEEE Transactions on Robotics and Automation 7(6):859–865.
Toffoli1991Programmablejournal
Tommaso Toffoli, Norman Margolus (1991). Programmable matter: Concepts and realization. Physica D: Nonlinear Phenomena 47(1–2):263–272.
Coined the term programmable matter. Metadata from Crossref; not read, cited as reported by DiLuna2020Shape, Emek2019Deterministic and Dufoulon2021Efficient.
BaezaYates1993Searchingjournal
Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins (1993). Searching in the Plane. Information and Computation 106(2):234–252.
Rivest1993Homingjournal
Ronald L. Rivest, Robert E. Schapire (1993). Inference of finite automata using homing sequences. Information and Computation 103(2):299–347.
First appeared in 1989.
Found by web search on 1 November 2026 (survey of single-agent exploration of directed graphs); metadata checked against Crossref; abstract and first page read in a scanned copy of the journal version.
Bender1994Teamconference
Michael A. Bender, Donna K. Slonim (1994). The power of team exploration: two robots can learn unlabeled directed graphs. FOCS 1994, pp. 75–85.
Found by web search on 1 November 2026 (survey of single-agent exploration of directed graphs); metadata checked against Crossref; abstract read; results as reported in Bender et al. 2002 and the abstract.
Kalyanasundaram1994Constructingjournal
Bala Kalyanasundaram, Kirk R. Pruhs (1994). Constructing competitive tours from local information. Theoretical Computer Science 130(1):125–138.
First appeared in 1993.
Added on 28 October 2026 as the origin of online exploration of weighted graphs; metadata from Crossref; not read (no open copy).
BaezaYates1995Paralleljournal
Ricardo A. Baeza-Yates, René Schott (1995). Parallel searching in the plane. Computational Geometry 5(3):143–154.
Metadata from Crossref. Full text read: Section 2.2 treats two robots searching for a point on a line, with communication (time \(3D\) when both must reach it) and without (time \(9D\), waiting half the time).
Kao1996Randomizedjournal
Ming-Yang Kao, John H. Reif, Stephen R. Tate (1996). Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. Information and Computation 131(1):63–79.
First appeared in 1993.
Priezzhev1996Eulerianjournal
V. B. Priezzhev, Deepak Dhar, Abhishek Dhar, Supriya Krishnamurthy (1996). Eulerian Walkers as a Model of Self-Organized Criticality. Physical Review Letters 77(25):5079–5082.
Flocchini1998Directionjournal
Paola Flocchini, Bernard Mans, Nicola Santoro (1998). Sense of direction: Definitions, properties, and classes. Networks 32(3):165–180.
First appeared in 1995.
Metadata from Crossref. Not read; cited by Dobrev et al. 2006 as the source of the formal definition of sense of direction, which is used in the black hole search knowledge axis.
Ando1999Convergencejournal
Hideki Ando, Yoshinobu Oasa, Ichiro Suzuki, Masafumi Yamashita (1999). Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transactions on Robotics and Automation 15(5):818–828.
Deng1999Exploringjournal
Xiaotie Deng, Christos H. Papadimitriou (1999). Exploring an unknown graph. Journal of Graph Theory 32(3):265–297.
First appeared in 1990.
Flocchini1999Hardconference
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer (1999). Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. ISAAC 1999, LNCS 1741, pp. 93–102.
Checked against the full text: introduces the asynchronous (CORDA) model and studies pattern formation without common handedness.
Albers2000Exploringjournal
Susanne Albers, Monika R. Henzinger (2000). Exploring unknown environments. SIAM Journal on Computing 29(4):1164–1188.
First appeared in 1997.
Barriere2002Captureconference
Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro (2002). Capture of an intruder by mobile agents. SPAA 2002, pp. 200–209.
Bender2002Pebblejournal
Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil Vadhan (2002). The power of a pebble: exploring and mapping directed graphs. Information and Computation 176(1):1–21.
First appeared in 1998.
DOI from Crossref; bounds read in the journal manuscript. STOC 1998 version: doi 10.1145/276698.276759.
Defago2002Circleconference
Xavier Défago, Akihiko Konagaya (2002). Circle formation for oblivious anonymous mobile robots with no common sense of orientation. POMC 2002, pp. 97–104.
Koucky2002Backtrackingjournal
Michal Koucký (2002). Universal traversal sequences with backtracking. Journal of Computer and System Sciences 65(4):717–726.
First appeared in 2001.
Alpern2003Theorybook
Steve Alpern, Shmuel Gal (2003). The Theory of Search Games and Rendezvous. International Series in Operations Research & Management Science 55, Kluwer Academic Publishers.
Yanovski2003Antjournal
Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein (2003). A distributed ant algorithm for efficiently patrolling a network. Algorithmica 37(3):165–186.
Metadata from Crossref. Full text read (Algorithmica version).
Diks2004Treejournal
Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc (2004). Tree exploration with little memory. Journal of Algorithms 51(1):38–63.
First appeared in 2002.
Fraigniaud2004Digraphsconference
Pierre Fraigniaud, David Ilcinkas (2004). Digraphs exploration with little memory. STACS 2004, pp. 246–257.
Read in the HAL author copy of the STACS version (hal-00339719): model, Theorems 1 to 4 and the conclusion; its text layer cannot be extracted, so it was read from page images.
Gervasi2004Flockingjournal
Vincenzo Gervasi, Giuseppe Prencipe (2004). Coordination without communication: the case of the flocking problem. Discrete Applied Mathematics 144(3):324–344.
Cohen2005Gravitationaljournal
Reuven Cohen, David Peleg (2005). Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM Journal on Computing 34(6):1516–1528.
First appeared in 2004.
Fleischer2005Exploringconference
Rudolf Fleischer, Gerhard Trippen (2005). Exploring an unknown graph efficiently. ESA 2005, pp. 11–22.
Flocchini2005Limitedjournal
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer (2005). Gathering of asynchronous robots with limited visibility. Theoretical Computer Science 337(1–3):147–168.
First appeared in 2001.
Fraigniaud2005Automatonjournal
Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg (2005). Graph exploration by a finite automaton. Theoretical Computer Science 345(2–3):331–344.
First appeared in 2004.
Fraigniaud2005Spaceconference
Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil (2005). Space Lower Bounds for Graph Exploration via Reduced Automata. SIROCCO 2005, LNCS 3499, pp. 140–154.
Peleg2005Swarmsconference
David Peleg (2005). Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges. IWDC 2005, LNCS 3741, pp. 1–12.
Checked against the full text: suggests "colors, flags or visible indicator lights" and \(O(1)\) bits of stable memory for robots.
Agmon2006Faultjournal
Noa Agmon, David Peleg (2006). Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots. SIAM Journal on Computing 36(1):56–82.
Czyzowicz2006Complexityjournal
Jurek Czyzowicz, Dariusz Kowalski, Euripides Markou, Andrzej Pelc (2006). Complexity of Searching for a Black Hole. Fundamenta Informaticae 71(2–3):229–242.
DeMarco2006Asynchronousjournal
Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro (2006). Asynchronous deterministic rendezvous in graphs. Theoretical Computer Science 355(3):315–326.
First appeared in 2005.
Dessmark2006Deterministicjournal
Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc (2006). Deterministic rendezvous in graphs. Algorithmica 46(1):69–96.
First appeared in 2003.
Dobrev2006Searchingjournal
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro (2006). Searching for a black hole in arbitrary networks: optimal mobile agents protocols. Distributed Computing 19(1).
First appeared in 2002.
Fraigniaud2006Collectivejournal
Pierre Fraigniaud, Leszek Gąsieniec, Dariusz R. Kowalski, Andrzej Pelc (2006). Collective tree exploration. Networks 48(3):166–177.
First appeared in 2004.
Fraigniaud2006Oracleconference
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc (2006). Oracle size: a new measure of difficulty for communication tasks. PODC 2006, pp. 179–187.
Metadata from Crossref. Not read; cited by Cohen et al. 2008 among works on short information supplied in advance (the advice paradigm).
Fraigniaud2006Reducedchapter
Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil (2006). The reduced automata technique for graph exploration space lower bounds. Theoretical Computer Science: Essays in Memory of Shimon Even, LNCS, pp. 1–26.
First appeared in 2005.
Reingold2006Pseudorandomconference
Omer Reingold, Luca Trevisan, Salil Vadhan (2006). Pseudorandom walks on regular digraphs and the RL vs. L problem. STOC 2006, pp. 457–466.
First appeared in 2005. Read: the ECCC report TR05-022 (2005): abstract and introduction.
Found by web search on 1 November 2026 (survey of single-agent exploration of directed graphs); metadata checked against Crossref; abstract and introduction read in the ECCC report.
Das2007Mapjournal
Shantanu Das, Paola Flocchini, Shay Kutten, Amiya Nayak, Nicola Santoro (2007). Map construction of unknown graphs by multiple agents. Theoretical Computer Science 385(1–3):34–48.
Dobrev2007Ringjournal
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro (2007). Mobile Search for a Black Hole in an Anonymous Ring. Algorithmica 48(1):67–90.
First appeared in 2001.
Dynia2007Mapsconference
Mirosław Dynia, Jakub Łopuszański, Christian Schindelhauer (2007). Why robots need maps. SIROCCO 2007, pp. 41–50.
Efrima2007Modelsconference
Asaf Efrima, David Peleg (2007). Distributed Models and Algorithms for Mobile Robot Systems. SOFSEM 2007, LNCS 4362, pp. 70–87.
Metadata from Crossref. Full text read: Section 6.3 adds a two-state signalling light to solve partitioning with a randomized algorithm.
Klasing2007Hardnessjournal
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco (2007). Hardness and approximation results for Black Hole Search in arbitrary networks. Theoretical Computer Science 384(2–3):201–221.
Other versions- SIROCCO 2005, as “Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs” doi:10.1007/11429647_17
First appeared in 2005.
Prencipe2007Impossibilityjournal
Giuseppe Prencipe (2007). Impossibility of gathering by a set of autonomous mobile robots. Theoretical Computer Science 384(2–3):222–231.
First appeared in 2005. Read: the SIROCCO 2005 version.
The conference version (SIROCCO 2005) was read; the journal version was not.
Xin2007Fasterconference
Qin Xin (2007). Faster treasure hunt and better strongly universal exploration sequences. ISAAC 2007, pp. 549–560.
Blin2008Chasingjournal
Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial (2008). Distributed chasing of network intruders. Theoretical Computer Science 399(1–2):12–37.
First appeared in 2006.
Metadata from Crossref (SIROCCO 2006 version: doi 10.1007/11780823_7). Full text read.
Cohen2008Labeljournal
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg (2008). Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms 4(4).
First appeared in 2005.
Cohen2008Spreadingjournal
Reuven Cohen, David Peleg (2008). Local spreading algorithms for autonomous robot systems. Theoretical Computer Science 399(1–2):71–82.
First appeared in 2006.
Dieudonne2008Circlejournal
Yoann Dieudonné, Ouiddad Labbani-Igbida, Franck Petit (2008). Circle formation of weak mobile robots. ACM Transactions on Autonomous and Adaptive Systems 3(4), article 16.
First appeared in 2006. Read: arXiv v1 (2006).
Flocchini2008Arbitraryjournal
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer (2008). Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theoretical Computer Science 407(1–3):412–447.
Flocchini2008Deploymentjournal
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro (2008). Self-deployment of mobile sensors on a ring. Theoretical Computer Science 402(1):67–80.
First appeared in 2006.
Flocchini2008Hypercubesjournal
Paola Flocchini, Miao Jun Huang, Flaminia L. Luccio (2008). Decontamination of hypercubes by mobile agents. Networks 52(3):167–178.
First appeared in 2005.
Fraigniaud2008Advicejournal
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc (2008). Tree exploration with advice. Information and Computation 206(11):1276–1287.
First appeared in 2006.
Metadata from Crossref (MFCS 2006 version: doi 10.1007/11821069_2). Not read; cited by Miller & Pelc 2015b as earlier work on advice for mobile agents.
Gasieniec2008Periodicjournal
Leszek Gąsieniec, Ralf Klasing, Russell Martin, Alfredo Navarra, Xiaohui Zhang (2008). Fast periodic graph exploration with constant memory. Journal of Computer and System Sciences 74(5).
First appeared in 2007.
Conference version at SIROCCO 2007.
Ilcinkas2008Portsjournal
David Ilcinkas (2008). Setting port numbers for fast graph exploration. Theoretical Computer Science 401:236–242.
First appeared in 2006.
Klasing2008Ringjournal
Ralf Klasing, Euripides Markou, Andrzej Pelc (2008). Gathering asynchronous oblivious mobile robots in a ring. Theoretical Computer Science 390(1):27–39.
First appeared in 2006.
Kowalski2008Meetjournal
Dariusz R. Kowalski, Adam Malinowski (2008). How to meet in anonymous network. Theoretical Computer Science 399(1–2):141–156.
First appeared in 2006.
Full text read; the bound is Corollary 4.1.
Reingold2008Undirectedjournal
Omer Reingold (2008). Undirected connectivity in log-space. Journal of the ACM 55(4), article 17.
First appeared in 2005.
Czyzowicz2009Directedconference
Jurek Czyzowicz, Stefan Dobrev, Rastislav Královič, Stanislav Miklík, Dana Pardubská (2009). Black hole search in directed graphs. SIROCCO 2009, LNCS 5869, pp. 182–194.
Found by web search on 1 November 2026 (survey of single-agent exploration of directed graphs); metadata checked against Crossref; model and theorem statements read.
Czyzowicz2009Fatjournal
Jurek Czyzowicz, Leszek Gąsieniec, Andrzej Pelc (2009). Gathering few fat mobile robots in the plane. Theoretical Computer Science 410(6–7):481–499.
First appeared in 2006.
Dieudonne2009Scatterjournal
Yoann Dieudonné, Franck Petit (2009). Scatter of robots. Parallel Processing Letters 19(1):175–184.
First appeared in 2007. Read: arXiv v1 (2007).
Efrima2009Partitionjournal
Asaf Efrima, David Peleg (2009). Distributed algorithms for partitioning a swarm of autonomous mobile robots. Theoretical Computer Science 410(14):1355–1368.
First appeared in 2007.
Ilcinkas2009Monotonicityjournal
David Ilcinkas, Nicolas Nisse, David Soguet (2009). The cost of monotonicity in distributed graph searching. Distributed Computing 22(2):117–127.
First appeared in 2007.
Miyazaki2009Restrictedjournal
Shuichi Miyazaki, Naoyuki Morimoto, Yasuo Okabe (2009). The Online Graph Exploration Problem on Restricted Graphs. IEICE Transactions on Information and Systems E92-D(9):1620–1627.
Added on 28 October 2026 for the tight deterministic ratio on weighted cycles and the lower bound 2 for unweighted graphs in online exploration; metadata from Crossref; read in full (J-STAGE copy) on 28 October 2026: Theorems 1–2 (cycles) and 4–5 (unweighted graphs, lower bound also on planar graphs).
Blin2010Exclusiveconference
Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil (2010). Exclusive perpetual ring exploration without chirality. DISC 2010, LNCS 6343, pp. 312–327.
Metadata from Crossref. Read in the HAL research report inria-00464206 (2010): model, Lemmas 1–14, Theorem 1. The DISC version was not read.
Chalopin2010Mapconference
Jérémie Chalopin, Shantanu Das, Adrian Kosowski (2010). Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. OPODIS 2010, pp. 119–134.
Chalopin2010Silentconference
Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro (2010). Network exploration by silent and oblivious robots. WG 2010, LNCS 6410, pp. 208–219.
Metadata from Crossref. Not read: no open copy found.
Clement2010Costjournal
Julien Clement, Xavier Défago, Maria Gradinariu Potop-Butucaru, Taisuke Izumi, Stephane Messika (2010). The cost of probabilistic agreement in oblivious robot networks. Information Processing Letters 110(11):431–438.
First appeared in 2008. Read: arXiv v1 (2008).
Devismes2010Smallconference
Stéphane Devismes (2010). Optimal exploration of small rings. WRAS 2010 (Third International Workshop on Reliability, Availability, and Security), 9:1–9:6.
Metadata from Crossref. Read in the author's copy (VERIMAG page) on 28 October 2026: Theorem 5 gives a probabilistic protocol for four robots on rings of \(n\) nodes with \(4 < n \le 8\) in the semi-synchronous model with multiplicity detection. Flocchini et al. 2013 describes it as an optimal probabilistic algorithm for small rings.
Dieudonne2010Leaderconference
Yoann Dieudonné, Franck Petit, Vincent Villain (2010). Leader election problem versus pattern formation problem. DISC 2010, pp. 267–281.
First appeared in 2009. Read: arXiv v3 (2012).
Fekete2010Rectilinearconference
Sándor Fekete, Chris Gray, Alexander Kröller (2010). Evacuation of Rectilinear Polygons. Combinatorial Optimization and Applications, pp. 21-30.
Flocchini2010Treejournal
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro (2010). Remembering without memory: tree exploration by asynchronous oblivious robots. Theoretical Computer Science 411(14–15):1583–1598.
First appeared in 2008.
Metadata from Crossref. Not read (open copy on HAL).
GanChaudhuri2010Transparentconference
Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya (2010). Gathering Asynchronous Transparent Fat Robots. ICDCIT 2010, LNCS 5966, pp. 170–175.
Kuhn2010Dynamicconference
Fabian Kuhn, Nancy Lynch, Rotem Oshman (2010). Distributed computation in dynamic networks. STOC 2010, pp. 513–522.
Introduces T-interval connectivity (T = 1: connected in every round); token-circulation impossibility in 1-interval connected graphs. Metadata from Crossref; abstract and introduction read in the authors' full version.
Lamani2010Ringconference
Anissa Lamani, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil (2010). Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots. SIROCCO 2010, LNCS 6058, pp. 183–196.
First appeared in 2009. Read: arXiv v1 (2009).
Read in arXiv 0910.0832v1 (October 2009), which has an appendix with a four-robot SSYNC algorithm for odd n; the SIROCCO version was not read.
Ambuhl2011Treejournal
Christoph Ambühl, Leszek Gąsieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang (2011). Tree exploration with logarithmic memory. ACM Transactions on Algorithms 7(2), article 17.
First appeared in 2007.
Bandettini2011Survey preprint
Alberto Bandettini, Fabio Luporini, Giovanni Viglietta (2011). A Survey on Open Problems for Mobile Robots. arXiv preprint.
Metadata from arXiv. Read (Sections 1–2): survey of the CORDA/ATOM models, multiplicity detection, limited visibility and fat robots. Preprint, not peer reviewed.
Bonnet2011Gridconference
François Bonnet, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil (2011). Asynchronous exclusive perpetual grid exploration without sense of direction. OPODIS 2011, LNCS 7109, pp. 251–265.
Metadata from Crossref. Not read (open copy on HAL).
Bouzid2011Homonymsconference
Zohir Bouzid, Anissa Lamani (2011). Robot Networks with Homonyms: The Case of Patterns Formation. SSS 2011, pp. 92–107.
Read: arXiv v1 (2011).
CordLandwehr2011Convergenceconference
Andreas Cord-Landwehr, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, Sven Kurras, Marcus Märtens, Friedhelm Meyer auf der Heide, Christoph Raupach, Kamil Swierkot, Daniel Warner, Christoph Weddemann, Daniel Wonisch (2011). A new approach for analyzing convergence algorithms for mobile robots. ICALP 2011, pp. 650–661.
Czyzowicz2011Patrollingconference
Jurek Czyzowicz, Leszek Gąsieniec, Adrian Kosowski, Evangelos Kranakis (2011). Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds. ESA 2011, pp. 701–712.
Degener2011Tightconference
Bastian Degener, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, Roger Wattenhofer (2011). A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. SPAA 2011, pp. 139–148.
Full text read: \(\Theta(n^2)\) rounds for the algorithm of Ando et al. (Theorems 5.1 and 6.14).
Flocchini2011Linejournal
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro (2011). How many oblivious robots can explore a line. Information Processing Letters 111(20):1027–1031.
Metadata from Crossref. Not read.
Guilbault2011Asynchronousconference
Samuel Guilbault, Andrzej Pelc (2011). Asynchronous rendezvous of anonymous agents in arbitrary graphs. OPODIS 2011, pp. 421–434.
Katreniak2011Convergenceconference
Branislav Katreniak (2011). Convergence with limited visibility by asynchronous mobile robots. SIROCCO 2011, pp. 125–137.
Full text read (SIROCCO 2011). The counterexample to the algorithm of Ando et al. is in the appendix of a full version, not read.
Kosowski2011Synchronousjournal
Adrian Kosowski, Alfredo Navarra, Cristina M. Pinotti (2011). Synchronous black hole search in directed graphs. Theoretical Computer Science 412(41):5752–5759.
First appeared in 2009.
Found by web search on 1 November 2026 (survey of single-agent exploration of directed graphs); metadata checked against Crossref; abstract, results and theorem statements read.
Casteigts2012TVGjournal
Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro (2012). Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems 27(5):387–408.
First appeared in 2010.
Unified TVG framework and hierarchy of classes (Class 5 recurrent connectivity, Class 9 always connected, Class 10 T-interval connectivity). Metadata from Crossref; introduction and Section 5 read in the arXiv version.
Cieliebak2012Gatheringjournal
Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro (2012). Distributed Computing by Mobile Robots: Gathering. SIAM Journal on Computing 41(4):829–879.
First appeared in 2003.
Czyzowicz2012Everywherejournal
Jurek Czyzowicz, Andrzej Pelc, Arnaud Labourel (2012). How to meet asynchronously (almost) everywhere. ACM Transactions on Algorithms 8(4), article 37.
First appeared in 2010.
Czyzowicz2012Forgetjournal
Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc (2012). How to meet when you forget: log-space rendezvous in arbitrary graphs. Distributed Computing 25(2):165–178.
First appeared in 2010.
Czyzowicz2012Periodicjournal
Jurek Czyzowicz, Stefan Dobrev, Leszek Gąsieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung (2012). More efficient periodic traversal in anonymous undirected graphs. Theoretical Computer Science 444:60–76.
First appeared in 2009. Read: arXiv v1 (2009).
Dieudonne2012Tokensjournal
Yoann Dieudonné, Andrzej Pelc (2012). Deterministic network exploration by a single agent with Byzantine tokens. Information Processing Letters 112(12):467–470.
Flocchini2012Bookbook
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro (2012). Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool.
Metadata from Crossref. Only the abstract was read (via Semantic Scholar); used for the 'minimal capabilities' framing of the field.
Flocchini2012PingPongjournal
Paola Flocchini, David Ilcinkas, Nicola Santoro (2012). Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles. Algorithmica 62(3–4):1006–1033.
First appeared in 2008.
Izumi2012TwoRobotsjournal
Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita (2012). The gathering problem for two oblivious robots with unreliable compasses. SIAM Journal on Computing 41(1):26–46.
First appeared in 2011. Read: arXiv v1 (2011).
Kosowski2012Decompositionjournal
Adrian Kosowski, Alfredo Navarra (2012). Graph decomposition for memoryless periodic exploration. Algorithmica 63(1–2):26–38.
First appeared in 2009.
Zhang2012Ratiojournal
Liang Hu, Meng Zhang, Yi Zhang, Jijun Tang (2012). Label-Guided Graph Exploration with Adjustable Ratio of Labels. International Journal of Foundations of Computer Science 23(04):903–929.
Other versions- arXiv preprint 1204.2955, 2012
Metadata from arXiv. Abstract read.
Agathangelou2013Fatconference
Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas (2013). A distributed algorithm for gathering many fat mobile robots in the plane. PODC 2013, pp. 250–259.
First appeared in 2012. Read: arXiv v1 (2012).
Bouzid2013Crashconference
Zohir Bouzid, Shantanu Das, Sebastien Tixeuil (2013). Gathering of Mobile Robots Tolerating Multiple Crash Faults. ICDCS 2013, pp. 337–346.
First appeared in 2012. Read: arXiv v1 (2012).
Chalopin2013Dataconference
Jérémie Chalopin, Shantanu Das, Matúš Mihalák, Paolo Penna, Peter Widmayer (2013). Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS 2013, LNCS, pp. 111–122.
Read: the authors' copy.
Added on 28 October 2026 as the origin of collaborative delivery, which Chalopin et al. 2021 says it first studied; metadata from Crossref and HAL. Read in full on 29 October 2026 in the authors' copy on Penna's page, found through a Google search (the HAL record has no file).
Datta2013Localconference
Ajoy K. Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit (2013). Ring exploration by oblivious agents with local vision. ICDCS 2013, pp. 347–356.
First appeared in 2012.
Metadata from Crossref. Checked against the arXiv version (“Ring Exploration with Oblivious Myopic Robots”, May 2012, which treats \(\varphi = 1, 2, 3\)): contribution, Theorems 3.1–3.2, Corollary 3.2 and the synchronous algorithms of Section 3.2. The \(\varphi = 2, 3\) results also appeared as an SSS 2013 brief announcement (doi 10.1007/978-3-319-03089-0_31), not read.
Delporte2013Homonymsjournal
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The (2013). Byzantine agreement with homonyms. Distributed Computing 26(5–6):321–340.
First appeared in 2010.
Metadata from Crossref; conference version PODC 2011, pp. 21–30, doi:10.1145/1993806.1993810. Full text read: defines processes with \(\ell\) identifiers among \(n\) (homonyms).
Devismes2013Probabilisticjournal
Stéphane Devismes, Franck Petit, Sébastien Tixeuil (2013). Optimal probabilistic ring exploration by semi-synchronous oblivious robots. Theoretical Computer Science 498:10–27.
First appeared in 2009.
Metadata from Crossref (SIROCCO version: doi 10.1007/978-3-642-11476-2_16). Read in INRIA research report RR-6838 (February 2009, titled 'Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots', atomic cycles): model, Corollary 2, Theorem 3. The journal version was not read.
Dieudonne2013Geoleaderjournal
Yoann Dieudonné, Florence Levé, Franck Petit, Vincent Villain (2013). Deterministic geoleader election in disoriented anonymous systems. Theoretical Computer Science 506:43–54.
First appeared in 2012. Read: arXiv v1 (2012).
Dobrev2013Tokensjournal
Stefan Dobrev, Paola Flocchini, Rastislav Královič, Nicola Santoro (2013). Exploring an unknown dangerous graph using tokens. Theoretical Computer Science 472:28–45.
First appeared in 2006.
Flocchini2013Ringjournal
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro (2013). Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. Algorithmica 65(3):562–583.
First appeared in 2007.
Read in the HAL author version of the journal paper and the OPODIS 2007 version (hal-00339884).
Fraigniaud2013Delaysjournal
Pierre Fraigniaud, Andrzej Pelc (2013). Delays induce an exponential memory gap for rendezvous in trees. ACM Transactions on Algorithms 9(2), article 17.
First appeared in 2008. Read: arXiv v1 (2011).
Viglietta2013Rendezvousconference
Giovanni Viglietta (2013). Rendezvous of Two Robots with Visible Bits. ALGOSENSORS 2013, pp. 291–306.
First appeared in 2012. Read: arXiv v2 (2012).
Xu2013Groupsconference
Yinfeng Xu, Lan Qin (2013). Strategies of Groups Evacuation from a Convex Region in the Plane. Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, pp. 250-260.
Bonnet2014Metricsconference
François Bonnet, Xavier Défago, Franck Petit, Maria Potop-Butucaru, Sébastien Tixeuil (2014). Discovering and assessing fine-grained metrics in robot networks protocols. SRDS Workshops 2014, pp. 50–59.
Other versions- SSS 2012 brief announcement, LNCS, pp. 282–284, as “Brief Announcement: Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols” doi:10.1007/978-3-642-33536-5_28
First appeared in 2012.
Metadata from Crossref. Abstract read (OpenAlex); no open copy found. A brief announcement appeared at SSS 2012 (doi 10.1007/978-3-642-33536-5_28).
Chalopin2014Lineconference
Jérémie Chalopin, Riko Jacob, Matúš Mihalák, Peter Widmayer (2014). Data Delivery by Energy-Constrained Mobile Agents on a Line. ICALP 2014, LNCS, pp. 423–434.
Read: the authors' copy.
Added on 28 October 2026 (found through Semantic Scholar while placing the delivery papers); read in full in the authors' copy on Chalopin's page.
Czyzowicz2014Evacuatingconference
Jurek Czyzowicz, Leszek Gąsieniec, Thomas Gorry, Evangelos Kranakis, Russell Martin, Dominik Pajak (2014). Evacuating Robots via Unknown Exit in a Disk. DISC 2014, pp. 122–136.
Search in geometric domains ›
Evacuation (posed the problem; introductory result in disk-two-f2f; current best in disk-two-wireless, disk-three-wireless, disk-three-f2f, disk-many-wireless, disk-many-f2f; lower bound in disk-two-wireless, disk-three-wireless, disk-three-f2f, disk-many-wireless, disk-many-f2f, disk-byzantine-wireless, disk-byzantine-f2f, disk-crash-f2f) ·
Chauffeuring a crashed robot (cited in text) ·
model description
Derakhshandeh2014Amoebotbrief announcement
Zahra Derakhshandeh, Shlomi Dolev, Robert Gmyr, Andréa W. Richa, Christian Scheideler, Thim Strothmann (2014). Amoebot - a new model for programmable matter. SPAA 2014 brief announcement, pp. 220–222.
Dieudonne2014Mischiefjournal
Yoann Dieudonné, Andrzej Pelc, David Peleg (2014). Gathering Despite Mischief. ACM Transactions on Algorithms 11(1).
First appeared in 2012.
DiLuna2014Robotsconference
Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Nicola Santoro, Giovanni Viglietta (2014). Robots with Lights: Overcoming Obstructed Visibility Without Colliding. SSS 2014, LNCS 8756, pp. 150–164.
Read: arXiv v1 (2014).
Dumitrescu2014Fencejournal
Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth (2014). On Fence Patrolling by Mobile Agents. The Electronic Journal of Combinatorics 21(3):P3.4.
Metadata from Crossref. Full text read (open access): Theorem 1 disproves Conjecture 2 of Czyzowicz et al. 2011 for unidirectional circle patrolling.
Higashikawa2014Onlinejournal
Yuya Higashikawa, Naoki Katoh, Stefan Langerman, Shin-ichi Tanigawa (2014). Online graph exploration algorithms for cycles and trees by multiple searchers. Journal of Combinatorial Optimization 28(2):480–495.
TaShma2014Deterministicjournal
Amnon Ta-Shma, Uri Zwick (2014). Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Transactions on Algorithms 10(3), article 12.
First appeared in 2007.
Wei2014Convexconference
Qi Wei, Xuehou Tan, Bo Jiang, Lijuan Wang (2014). On-Line Strategies for Evacuating from a Convex Region in the Plane. Combinatorial Optimization and Applications, pp. 74-85.
Different authors from Li & Xu 2017, which has a similar title.
Yamauchi2014Randomizedconference
Yukiko Yamauchi, Masafumi Yamashita (2014). Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots. DISC 2014, LNCS, pp. 137–151.
Metadata from Crossref. Full text read: ASYNC, chirality, \(n \ge 5\), no multiplicities in the initial configuration or the pattern.
Bramas2015WaitFreeconference
Quentin Bramas, Sébastien Tixeuil (2015). Wait-Free Gathering Without Chirality. SIROCCO 2015, pp. 313–327.
Chalopin2015Anonymousconference
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin (2015). Anonymous Graph Exploration with Binoculars. DISC 2015, LNCS, pp. 107–122.
Other versions- AlgoTel 2015 (in French), as “Exploration de graphes anonymes avec des jumelles” link
Read: arXiv v1 (2015).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref; the AlgoTel paper is a French summary.
Chalopin2015Limitconference
Jérémie Chalopin, Shantanu Das, Paweł Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemysław Uznański (2015). Limit Behavior of the Multi-agent Rotor-Router System. DISC 2015, LNCS, pp. 123–139.
Read: the HAL version.
Found by the backfill search of 27 October 2026 and read (HAL version). Venue from Crossref.
Chrobak2015GroupSearchconference
Marek Chrobak, Leszek Gąsieniec, Thomas Gorry, Russell Martin (2015). Group Search on the Line. SOFSEM 2015, LNCS, pp. 164–176.
Czyzowicz2015Beachcombersjournal
Jurek Czyzowicz, Leszek Gąsieniec, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie (2015). The Beachcombers' Problem: Walking and searching with mobile robots. Theoretical Computer Science 608:201–218.
First appeared in 2013. Read: arXiv v1 (2013).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal and SIROCCO metadata from Crossref.
Czyzowicz2015Positionjournal
Jurek Czyzowicz, Leszek Gąsieniec, Adrian Kosowski, Evangelos Kranakis, Oscar Morales-Ponce, Eduardo Pacheco (2015). Position discovery for a system of bouncing robots. Information and Computation 244:122–133.
First appeared in 2012. Read: the HAL version.
Found by the backfill search of 27 October 2026 and read (HAL version). Journal metadata from Crossref.
Czyzowicz2015Wirelessconference
J. Czyzowicz, E. Kranakis, D. Krizanc, L. Narayanan, J. Opatrny, S. Shende (2015). Wireless Autonomous Robot Evacuation from Equilateral Triangles and Squares. ADHOC-NOW 2015, LNCS, pp. 181–194.
DAngelo2015Unifiedjournal
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan (2015). Computing on rings by oblivious robots: a unified approach for different tasks. Algorithmica 72(4):1055–1096.
Other versions- IPDPS Workshops 2013, APDCM
First appeared in 2013.
Metadata from Crossref. Read in the HAL author version: contribution, Theorems 1–8.
Das2015Mobileconference
Shantanu Das, Flaminia L. Luccio, Euripides Markou (2015). Mobile Agents Rendezvous in Spite of a Malicious Agent. ALGOSENSORS 2015, LNCS, pp. 211–224.
First appeared in 2014.
Found by the backfill search of 27 October 2026; abstract read.
Das2015Sequencesjournal
Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita (2015). Forming sequences of geometric patterns with oblivious mobile robots. Distributed Computing 28(2):131–145.
First appeared in 2010.
Datta2015Enablingconference
Ajoy K. Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit (2015). Enabling ring exploration with myopic oblivious robots. IPDPS Workshops 2015 (APDCM), pp. 490–499.
Metadata from Crossref. Abstract read (OpenAlex); no open copy found.
DEmidio2015Explorejournal
Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra (2015). Explore and repair graphs with black holes using mobile entities. Theoretical Computer Science 605:129–145.
Other versions- ADHOC-NOW 2013, LNCS 7960, pp. 136–147, as “Exploring and making safe dangerous networks using mobile entities”
First appeared in 2013.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (the TCS version, downloaded through a browser on 29 October 2026): model, theorems and lower bounds; the experiments were skimmed. The ADHOC-NOW 2013 version is named in the paper's own references.
Derakhshandeh2015Algorithmicbrief announcement
Zahra Derakhshandeh, Robert Gmyr, Andréa W. Richa, Christian Scheideler, Thim Strothmann (2015). An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems. NANOCOM 2015, ACM, pp. 1–2.
Found by the backfill search of 27 October 2026; abstract read. The ACM paper has two pages; the arXiv version is the full text.
Derakhshandeh2015Leaderconference
Zahra Derakhshandeh, Robert Gmyr, Thim Strothmann, Rida Bazzi, Andréa W. Richa, Christian Scheideler (2015). Leader Election and Shape Formation with Self-organizing Programmable Matter. DNA 21 (2015), pp. 117–132.
Other versions- PODC 2015 brief announcement, pp. 67–69, as “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter” doi:10.1145/2767386.2767451
Read: arXiv v2 (2016).
Dereniowski2015Fastjournal
Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pająk, Przemysław Uznański (2015). Fast collaborative graph exploration. Information and Computation 243:37–49.
First appeared in 2013.
Dereniowski2015Rendezvousjournal
Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Łukasz Kuszner (2015). Rendezvous of heterogeneous mobile agents in edge-weighted networks. Theoretical Computer Science 608:219–230.
First appeared in 2014.
Found by the backfill search of 27 October 2026; abstract read.
Dieudonne2015Polynomialjournal
Yoann Dieudonné, Andrzej Pelc, Vincent Villain (2015). How to meet asynchronously at polynomial cost. SIAM Journal on Computing 44(3):844–867.
First appeared in 2013.
Fujinaga2015Patternjournal
Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita (2015). Pattern formation by oblivious asynchronous mobile robots. SIAM Journal on Computing 44(3):740–785.
First appeared in 2012.
GanChaudhuri2015Leaderjournal
Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya (2015). Leader election and gathering for asynchronous fat robots without common chirality. Journal of Discrete Algorithms 33:171–192.
First appeared in 2012.
Jiang2015Groupschapter
Bo Jiang, Yuan Liu, Hao Zhang, Xuehou Tan (2015). An On-Line Strategy of Groups Evacuation from a Convex Region in the Plane. Mathematical Problems in Data Science, pp. 189-199.
Kawamura2015Fencejournal
Akitoshi Kawamura, Yusuke Kobayashi (2015). Fence patrolling by mobile agents with distinct speeds. Distributed Computing 28:147–154.
First appeared in 2012. Read: arXiv v1 (2014).
Krupke2015Parallelconference
Dominik Krupke, Michael Hemmer, James McLurkin, Yu Zhou, Sándor P. Fekete (2015). A Parallel Distributed Strategy for Arraying a Scattered Robot Swarm. IROS 2015, IEEE, pp. 2795–2802.
Read: arXiv v1 (2015).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Liu2015Groupsconference
Yuan Liu, Bo Jiang, Hao Zhang (2015). Online Strategies for Evacuating from a Convex Region by Groups in the Plane. 2015 Ninth International Conference on Frontier of Computer Science and Technology, pp. 178-183.
Menc2015Powerbrief announcement
Artur Menc, Dominik Pająk, Przemysław Uznański (2015). Brief announcement: On the power of one bit in graph exploration without backtracking. DISC 2015 (brief announcement).
Found by the backfill search of 27 October 2026; introduction read (HAL version).
Miller2015Fastjournal
Avery Miller, Andrzej Pelc (2015). Fast rendezvous with advice. Theoretical Computer Science 608:190–198.
First appeared in 2014.
Found by the backfill search of 27 October 2026; abstract and introduction read.
Miller2015Tradeoffsjournal
Avery Miller, Andrzej Pelc (2015). Tradeoffs between cost and information for rendezvous and treasure hunt. Journal of Parallel and Distributed Computing 83:159–167.
First appeared in 2014. Read: arXiv v1 (2015).
Ooshita2015Selfstabilizationjournal
Fukuhito Ooshita, Sébastien Tixeuil (2015). On the self-stabilization of mobile oblivious robots in uniform rings. Theoretical Computer Science 568:84–96.
First appeared in 2012.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (the TCS version, downloaded through a browser on 29 October 2026): model, impossibility proofs and theorem statements.
Pagli2015Nearjournal
Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta (2015). Getting close without touching: near-gathering for autonomous mobile robots. Distributed Computing 28(5):333–349.
First appeared in 2012. Read: arXiv v1 (2015).
Sharma2015Boundsconference
Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay (2015). Bounds on Mutual Visibility Algorithms. CCCG 2015, pp. 268–274.
Found by the backfill search of 27 October 2026; abstract read (the CCCG proceedings copy).
Sharma2015Optimalconference
Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay (2015). Mutual Visibility with an Optimal Number of Colors. ALGOSENSORS 2015, pp. 196–210.
Sudo2015Whiteboardsjournal
Yuichi Sudo, Daisuke Baba, Junya Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (2015). A Single Agent Exploration in Unknown Undirected Graphs with Whiteboards. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E98.A(10):2117–2128.
First appeared in 2010.
Vaidyanathan2015Logconference
Ramachandran Vaidyanathan, Costas Busch, Jerry L. Trahan, Gokarna Sharma, Suresh Rai (2015). Logarithmic-Time Complete Visibility for Robots with Lights. IPDPS 2015, pp. 375–384.
Abshoff2016Gatheringconference
Sebastian Abshoff, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide (2016). Gathering a Closed Chain of Robots on a Grid. IPDPS 2016, IEEE, pp. 689–699.
Other versions- arXiv preprint 1501.04877, 2015, as “Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case” link
First appeared in 2015.
Found by the backfill search of 27 October 2026; abstract read.
Anaya2014Convergecastjournal
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès (2016). Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica 74(1):117–155.
First appeared in 2012. Read: arXiv v1 (2016).
Found by the backfill search of 27 October 2026; read in full in arXiv v1 (2016), the journal text. The journal issue is dated January 2016 (online 2014).
Balamohan2016Tokensjournal
B. Balamohan, S. Dobrev, P. Flocchini, N. Santoro (2016). Exploring an unknown dangerous graph with a constant number of tokens. Theoretical Computer Science 610:169–181.
First appeared in 2012.
Bhagat2016Faulttolerantjournal
Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya (2016). Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement. Journal of Discrete Algorithms 36:50–62.
Other versions- WALCOM 2015, LNCS 8973, pp. 149–160, as “Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement” doi:10.1007/978-3-319-15612-5_14
First appeared in 2015.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the JDA version, downloaded through a browser on 29 October 2026).
Bockenhauer2016Online preprint
Hans-Joachim Böckenhauer, Janosch Fuchs, Ulla Karhumäki, Walter Unger (2016). Online Exploration of Rectangular Grids. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Bouchard2016Byzantinejournal
Sébastien Bouchard, Yoann Dieudonné, Bertrand Ducourthial (2016). Byzantine gathering in networks. Distributed Computing 29(6):435–457.
First appeared in 2015.
Bramas2016Probabilisticconference
Quentin Bramas, Sébastien Tixeuil (2016). Probabilistic asynchronous arbitrary pattern formation. SSS 2016, pp. 88–93.
Other versions- PODC 2016 brief announcement, as “Brief Announcement: Probabilistic Asynchronous Arbitrary Pattern Formation” doi:10.1145/2933057.2933074
First appeared in 2015.
Caissy2016Explorationjournal
David Caissy, Andrzej Pelc (2016). Exploration of Faulty Hamiltonian Graphs. International Journal of Foundations of Computer Science 27(07):809–827.
Found by the backfill search of 27 October 2026; abstract read.
Cannon2016Compressionconference
Sarah Cannon, Joshua J. Daymude, Dana Randall, Andréa W. Richa (2016). A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems. PODC 2016, pp. 279–288.
Read: arXiv v4 (2019).
Chalopin2015Rendezvousjournal
Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc (2016). Rendezvous in networks in spite of delay faults. Distributed Computing 29(3):187–205.
First appeared in 2014.
Found by the backfill search of 27 October 2026; abstract read.
Chalopin2016Binoculars preprint
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin (2016). Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions. arXiv preprint.
Other versions- AlgoTel 2016 (in French), as “Utiliser des jumelles pour explorer rapidement les graphes triangulés” link
Found by the backfill search of 27 October 2026 and read (arXiv v1). The AlgoTel paper is a French summary; no other version found in Crossref on 28 October 2026.
CordLandwehr2016Asymptoticallyconference
Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide (2016). Asymptotically Optimal Gathering on a Grid. SPAA 2016, ACM, pp. 301–312.
Found by the backfill search of 27 October 2026; abstract read.
Courtieu2016Certifiedconference
Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain (2016). Certified Universal Gathering in \(\mathbb{R}^2\) for Oblivious Mobile Robots. DISC 2016, LNCS, pp. 187–200.
First appeared in 2015. Read: arXiv 1506.01603 v1 (2015).
Found by the backfill search of 27 October 2026 and read (arXiv 1506.01603). Venue from Crossref; arXiv 1602.08361 is a later version.
Czyzowicz2016Communicationconference
Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter (2016). Communication Problems for Mobile Agents Exchanging Energy. SIROCCO 2016, LNCS, pp. 275–288.
First appeared in 2015. Read: arXiv v1 (2015).
Found by the backfill search of 27 October 2026; the theorem statements of arXiv v1 (2015), titled 'Algorithms for Communication Problems for Mobile Agents Exchanging Energy', were read.
Daadaa2015Networkjournal
Yassine Daadaa, Asif Jamshed, Mudassir Shabbir (2016). Network Decontamination with a Single Agent. Graphs and Combinatorics 32(2):559–581.
First appeared in 2013.
Found by the backfill search of 27 October 2026; abstract read.
DAngelo2016Gatheringjournal
Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra (2016). Gathering of robots on anonymous grids and trees without multiplicity detection. Theoretical Computer Science 610:158–168.
Other versions- SIROCCO 2012, LNCS 7355, pp. 327–338, as “Gathering of robots on anonymous grids without multiplicity detection”
First appeared in 2012.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the TCS version, downloaded through a browser on 29 October 2026). The SIROCCO 2012 version is named in the paper's own references.
DAngelo2016Unifiedjournal
Gianlorenzo D’Angelo, Alfredo Navarra, Nicolas Nisse (2016). A unified approach for gathering and exclusive searching on rings under weak assumptions. Distributed Computing 30(1):17–48.
Found by the backfill search of 27 October 2026; abstract read.
Das2016Lightsjournal
Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Masafumi Yamashita (2016). Autonomous mobile robots with lights. Theoretical Computer Science 609:171–184.
First appeared in 2012.
DEmidio2016Synchronousconference
Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra (2016). Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs. ICTCS 2015, Electronic Notes in Theoretical Computer Science 322:169–180.
First appeared in 2015.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (open ENTCS copy, downloaded through a browser on 29 October 2026): model and theorem statements. The meeting (16th Italian Conference on Theoretical Computer Science) is named in the reference list of D'Emidio et al. 2018, which extends it.
Derakhshandeh2016Universalconference
Zahra Derakhshandeh, Robert Gmyr, Andrea W. Richa, Christian Scheideler, Thim Strothmann (2016). Universal Shape Formation for Programmable Matter. SPAA 2016, pp. 289–299.
Dereniowski2016Boundsjournal
Dariusz Dereniowski, Adrian Kosowski, Dominik Pająk, Przemysław Uznański (2016). Bounds on the cover time of parallel rotor walks. Journal of Computer and System Sciences 82(5):802–816.
Read: the HAL version.
Found by the backfill search of 27 October 2026 and read (HAL version). Journal metadata from Crossref; a STACS 2014 version exists (cited by Kosowski & Pająk 2019) and was not looked up.
Dieudonne2016Anonymousjournal
Yoann Dieudonné, Andrzej Pelc (2016). Anonymous Meeting in Networks. Algorithmica 74(2):908–946.
First appeared in 2011.
Doan2017Perpetualconference
Ha Thi Thu Doan, François Bonnet, Kazuhiro Ogata (2016). Model checking of a mobile robots perpetual exploration algorithm. SOFL+MSVL 2016, LNCS 10189, pp. 201–219.
Metadata from Crossref. Not read: no open copy found.
Flocchini2016Constantjournal
Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita (2016). Rendezvous with constant memory. Theoretical Computer Science 621:57–72.
First appeared in 2013. Read: arXiv v1 (2013).
Flocchini2016Networkjournal
Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro (2016). Network decontamination under \(m\)-immunity. Discrete Applied Mathematics 201:114–129.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (the DAM version, downloaded through a browser on 29 October 2026): model, theorems and lower bounds.
Flocchini2016Universalconference
Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita (2016). Universal Systems of Oblivious Mobile Robots. SIROCCO 2016, LNCS, pp. 242–257.
Read: arXiv v4.
Found by the backfill search of 27 October 2026 and read (arXiv v4). Venue from Crossref.
Foerster2016Lowerjournal
Klaus-Tycho Foerster, Roger Wattenhofer (2016). Lower and upper competitive bounds for online directed graph exploration. Theoretical Computer Science 655:15–29.
Other versions- OPODIS 2012, as “Directed Graph Exploration” link
First appeared in 2012.
Found by web search on 1 November 2026 (survey of single-agent exploration of directed graphs); metadata checked against Crossref; full text not read. Abstract read.
Kameda2016Alternativejournal
Tsunehiko Kameda, Ichiro Suzuki, Masafumi Yamashita (2016). An alternative proof for the equivalence of ∞-searcher and 2-searcher. Theoretical Computer Science 634:108–119.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (the TCS version, downloaded through a browser on 29 October 2026): problem, theorem statements and the outline of the proof.
Klasing2016Multiagentjournal
Ralf Klasing, Adrian Kosowski, Dominik Pająk, Thomas Sauerwald (2016). The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. Distributed Computing 30(2):127–148.
First appeared in 2013. Read: the HAL version.
Found by the backfill search of 27 October 2026 and read (HAL version). Journal metadata from Crossref; the 2013 conference version was not looked up.
Korman2016Parallel preprint
Amos Korman, Yoav Rodeh (2016). Parallel Linear Search with no Coordination for a Randomly Placed Treasure. arXiv preprint.
Read: arXiv v2 (2016).
Found by the backfill search of 27 October 2026, where it was listed under the wrong authors (key Dobrev2018Hunt in the manifest); read (arXiv v2). A SIROCCO 2017 paper by the same authors, "Parallel Search with No Coordination" (doi:10.1007/978-3-319-72050-0_12), may be its published version; not checked.
Luccio2016Morejournal
Fabrizio Luccio, Linda Pagli (2016). More agents may decrease global work: A case in butterfly decontamination. Theoretical Computer Science 655:41–57.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (the TCS version, downloaded through a browser on 29 October 2026): model, protocols and their costs.
Mamino2016Squareconference
Marcello Mamino, Giovanni Viglietta (2016). Square formation by asynchronous oblivious robots. CCCG 2016.
Read: arXiv v2 (2016).
Michail2016Temporaljournal
Othon Michail, Paul G. Spirakis (2016). Traveling salesman problems in temporal graphs. Theoretical Computer Science 634:1–23.
First appeared in 2014.
Metadata from Crossref. Full text read (TCS version); introduces temporal graph exploration (TEXP) with the temporal graph given as input.
Miller2015Timejournal
Avery Miller, Andrzej Pelc (2016). Time versus cost tradeoffs for deterministic rendezvous in networks. Distributed Computing 29(1):51–64.
First appeared in 2014.
Found by the backfill search of 27 October 2026; abstract and introduction read.
Naz2016Distributedconference
Andre Naz, Benoit Piranda, Julien Bourgeois, Seth Copen Goldstein (2016). A distributed self-reconfiguration algorithm for cylindrical lattice-based modular robots. NCA 2016, IEEE, pp. 254–263.
Found by the backfill search of 27 October 2026; abstract read.
Sharma2016Completeconference
Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan, Costas Busch, Suresh Rai (2016). Complete Visibility for Robots with Lights in O(1) Time. SSS 2016, LNCS 10083, pp. 327–345.
Shibata2016Partialjournal
Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (2016). Partial gathering of mobile agents in asynchronous unidirectional rings. Theoretical Computer Science 617:1–11.
First appeared in 2015.
Found by the backfill search of 27 October 2026; abstract read.
Wei2016Affectedjournal
Qi Wei, Xuehou Tan, Bo Jiang, Lijuan Wang (2016). Evacuating from an Unknown Affected Area. International Journal of Pattern Recognition and Artificial Intelligence 30, pp. 1659022.
Wei2016Competitivejournal
Qi WEI, Xuehou TAN, Bo JIANG (2016). Competitive Strategies for Evacuating from an Unknown Affected Area. IEICE Transactions on Information and Systems E99.D(10):2585–2590.
Angelopoulos2017Optimal preprint
Spyros Angelopoulos, Konstantinos Panagiotou (2017). Optimal strategies for weighted ray search. arXiv preprint.
Read: arXiv v2 (2021).
Found by the backfill search of 27 October 2026 and read (arXiv v2). A JCSS article by the same authors, "Weighted online search" (2023, doi:10.1016/j.jcss.2023.05.002), may be its journal version; not seen.
Bampas2009LockInjournal
Evangelos Bampas, Leszek Gąsieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik (2017). Robustness of the Rotor–Router Mechanism. Algorithmica 78(3):869–895.
Other versions- DISC 2009, LNCS, pp. 423–435, as “Euler Tour Lock-In Problem in the Rotor-Router Model” doi:10.1007/978-3-642-04355-0_44
- OPODIS 2009, LNCS 5923, pp. 345–358, as “Robustness of the Rotor-router Mechanism”
First appeared in 2009. Read: DISC 2009 version (section and theorem numbers in notes refer to it), and the journal version (accepted manuscript, King's College London repository): there the cases \(P\)-all and \(A()P(\pi)\) open Section 3, and Theorems 3 and 4 of DISC are Theorems 4 and 5.
Metadata from Crossref. Full text read (DISC 2009, LNCS version). The journal version, which combines the DISC 2009 paper with the OPODIS 2009 paper on faults (versions named in its first footnote), was downloaded through a browser on 29 October 2026 and read on 29 October 2026.
Bartschi2017EnergyEfficientconference
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna (2017). Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS 2017, LIPIcs 66, 10:1–10:14.
First appeared in 2016. Read: arXiv v1 (2016), abstract, model and contributions.
Found by the backfill search of 27 October 2026; the model and contribution sections of arXiv v1 were read.
Bose2017Crash preprint
Kaustav Bose, Ranendu Adhikary, Sruti Gan Chaudhuri, Buddhadeb Sau (2017). Crash tolerant gathering on grid by asynchronous oblivious robots. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Bournat2017Perpetualconference
Marjorie Bournat, Swan Dubois, Franck Petit (2017). Computability of perpetual exploration in highly dynamic rings. ICDCS 2017, pp. 794–804.
Other versions- AlgoTel 2017 (in French), as “Quel est le nombre optimal de robots pour explorer un anneau hautement dynamique ?” link
First appeared in 2016.
Metadata from Crossref. Read in the HAL version: model, Table I, Theorems III.1–V.2.
Bramas2017RandomBitjournal
Quentin Bramas, Sébastien Tixeuil (2017). The Random Bit Complexity of Mobile Robots Scattering. International Journal of Foundations of Computer Science 28(2):111–133.
First appeared in 2013.
Brandt2017Collaborationconference
Sebastian Brandt, Felix Laufenberg, Yuezhou Lv, David Stolz, Roger Wattenhofer (2017). Collaboration Without Communication: Evacuating Two Robots from a Disk. CIAC 2017, pp. 104–115.
Chuangpishit2017Rendezvousconference
Huda Chuangpishit, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc (2017). Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults. ALGOSENSORS 2017, LNCS, pp. 70–83.
Found by the backfill search of 27 October 2026; abstract read.
Czyzowicz2017Collisionfreejournal
Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gąsieniec, Ralf Klasing, Adrian Kosowski, Dominik Pająk (2017). Collision-free network exploration. Journal of Computer and System Sciences 86:70–81.
First appeared in 2012. Read: HAL hal-00736276v1 (2012); theorem numbers refer to it.
Found by the backfill search of 27 October 2026 and read in full (the HAL report). Journal and LATIN metadata from Crossref.
Czyzowicz2017Exploringconference
Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel, Euripides Markou (2017). Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots. SOFSEM 2017, LNCS, pp. 381–395.
Found by the backfill search of 27 October 2026; abstract read.
Czyzowicz2017Faultyconference
Jurek Czyzowicz, Konstantinos Georgiou, Maxime Godon, Evangelos Kranakis, Danny Krizanc, Wojciech Rytter, Michał Włodarczyk (2017). Evacuation from a Disc in the Presence of a Faulty Robot. SIROCCO 2017, pp. 158–173.
Czyzowicz2017Linearconference
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil Shende (2017). Linear Search with Terrain-Dependent Speeds. CIAC 2017, LNCS, pp. 430–441.
Read: arXiv v1 (2017).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Czyzowicz2017Patrolmenjournal
Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Najmeh Taleb (2017). When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots. Algorithmica 79(3):925–940.
First appeared in 2015.
Daymude2017Improvedconference
Joshua J. Daymude, Robert Gmyr, Andréa W. Richa, Christian Scheideler, Thim Strothmann (2017). Improved Leader Election for Self-organizing Programmable Matter. ALGOSENSORS 2017, pp. 127–140.
Read: arXiv v3 (2017).
DeCarufel2017FaultInducedconference
Jean-Lou De Carufel, Paola Flocchini (2017). Fault-Induced Dynamics of Oblivious Robots on a Line. SSS 2017, LNCS, pp. 126–141.
Found by the backfill search of 27 October 2026; abstract read.
Derakhshandeh2017Coatingjournal
Zahra Derakhshandeh, Robert Gmyr, Andréa W. Richa, Christian Scheideler, Thim Strothmann (2017). Universal coating for programmable matter. Theoretical Computer Science 671:56–68.
First appeared in 2016. Read: arXiv v1 (2016).
DiLuna2017Mutualjournal
Giuseppe A. Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Federico Poloni, Nicola Santoro, Giovanni Viglietta (2017). Mutual visibility by luminous robots without collisions. Information and Computation 254:392–418.
First appeared in 2015. Read: arXiv v2 (2015).
Doan2018Modelconference
Ha Thi Thu Doan, François Bonnet, Kazuhiro Ogata (2017). Model Checking of Robot Gathering. OPODIS 2017, LIPIcs 95, 12:1–12:16.
Found by the backfill search of 27 October 2026 and read (LIPIcs version). Metadata from DataCite; the proceedings appeared in 2018.
Dobrev2018Treasureconference
Stefan Dobrev, Rastislav Královič, Dana Pardubská (2017). Treasure Hunt with Barely Communicating Agents. OPODIS 2017, LIPIcs 95, 14:1–14:16.
Found by the backfill search of 27 October 2026 and read (LIPIcs version). Metadata from DataCite; the proceedings appeared in 2018.
Fraigniaud2017Decidabilityjournal
Pierre Fraigniaud, Andrzej Pelc (2017). Decidability classes for mobile agents computing. Journal of Parallel and Distributed Computing 109:117–128.
First appeared in 2010. Read: arXiv v1 (2010).
Found by the backfill search of 27 October 2026; read in full in arXiv v1 (2010), the only arXiv version; theorem numbers refer to it, and the journal version was not seen. In the proof of Theorem 3.2 the problem teamsize is written once as \(|S| = k\) and elsewhere as \(|S| > k\).
Georgiou2017Searchingjournal
Konstantinos Georgiou, Evangelos Kranakis, Alexandra Steau (2017). Searching with Advice: Robot Fence-Jumping. Journal of Information Processing 25:559–571.
First appeared in 2016. Read: arXiv v1 (2016).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal metadata from Crossref; Crossref and the arXiv version spell the first author's name Kostantinos.
Li2017Convexconference
Songhua Li, Yinfeng Xu (2017). Online Strategies for Evacuating from a Convex Region in the Plane. Frontiers in Algorithmics, pp. 151-162.
Menc2017Rotorjournal
Artur Menc, Dominik Pająk, Przemysław Uznański (2017). Time and space optimality of rotor-router graph exploration. Information Processing Letters 127:17–20.
First appeared in 2015.
Metadata from Crossref. Checked against the full text (arXiv v3): Observation 1.1, Theorems 2.2 and 2.3.
Monde2017Selfstabilizingconference
Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (2017). Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility. SSS 2017, LNCS, pp. 172–186.
Read: arXiv v2.
Found by the backfill search of 27 October 2026 and read (arXiv v2). Venue from Crossref.
Okumura2017Rendezvousbrief announcement
Takashi Okumura, Koichi Wada, Yoshiaki Katayama (2017). Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights. SSS 2017 (brief announcement), LNCS, pp. 484–488.
Other versions- Adventures Between Lower Bounds and Higher Altitudes: Essays Dedicated to Juraj Hromkovič, LNCS 11011, pp. 434–448, 2018, as “Rendezvous of Asynchronous Mobile Robots with Lights” doi:10.1007/978-3-319-98355-4_25
Read: arXiv v1 (2017).
Pattanayak2017Convergenceconference
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid (2017). Convergence of Even Simpler Robots without Position Information. NETYS 2017, LNCS, pp. 69–85.
First appeared in 2016.
Found by the backfill search of 27 October 2026; abstract read.
Sharma2017Logarithmicconference
Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan, Costas Busch, Suresh Rai (2017). O(log N)-Time Complete Visibility for Asynchronous Robots with Lights. IPDPS 2017, pp. 513–522.
Sil2017Line preprint
Arijit Sil, Sruti Gan Chaudhuri (2017). Line Formation by Fat Robots under Limited Visibility. arXiv preprint.
Found by the backfill search of 27 October 2026 and read (arXiv v1). No published version in the manifest.
Sinay2017Maintainingconference
Mor Sinay, Noa Agmon, Oleg Maksimov, Sarit Kraus, David Peleg (2017). Maintaining Communication in Multi-Robot Tree Coverage. IJCAI 2017, pp. 4515–4522.
Found by the backfill search of 27 October 2026; abstract read.
Tomita2018Planeconference
Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (2017). Plane Formation by Synchronous Mobile Robots without Chirality. OPODIS 2017, LIPIcs 95, 13:1–13:17.
Found by the backfill search of 27 October 2026; abstract read.
Agarwalla2018DynamicRingsconference
Ankush Agarwalla, John Augustine, William K. Moses Jr., Madhav Sankar K., Arvind Krishna Sridhar (2018). Deterministic Dispersion of Mobile Robots in Dynamic Rings. ICDCN 2018.
First appeared in 2017. Read: arXiv v3 (2017).
Aljohani2018Faultsjournal
Aisha Aljohani, Gokarna Sharma (2018). Complete Visibility for Mobile Robots with Lights Tolerating Faults. International Journal of Networking and Computing 8(1):32–52.
Other versions- IPDPS Workshops 2017 (APDCM), pp. 834–841, as “Complete Visibility for Mobile Agents with Lights Tolerating a Faulty Agent” doi:10.1109/ipdpsw.2017.145
First appeared in 2017.
AndresArroyo2018Bridgingjournal
Marta Andrés Arroyo, Sarah Cannon, Joshua J. Daymude, Dana Randall, Andréa W. Richa (2018). A stochastic approach to shortcut bridging in programmable matter. Natural Computing 17:723–741.
First appeared in 2017. Read: arXiv v2 (2018).
Augustine2018Tradeoffsconference
John Augustine, William K. Moses Jr. (2018). Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs. ICDCN 2018.
Mobile agents on graphs ›
Collaborative exploration (introductory result in anonymous-n-agents) ·
Dispersion (posed the problem; introductory result in base, rooted, ring, tree; current best in tree-rooted; lower bound in base, rooted, async, ring, tree, tree-rooted, crash, byzantine, byzantine-ring, byzantine-grid) ·
model description First appeared in 2017. Read: arXiv v4 (2018).
Introduces the problem. All bounds are for \(k = n\); agents know \(n\) and \(m\).
Balabonski2018Certifiedconference
Thibaut Balabonski, Robin Pelle, Lionel Rieg, Sébastien Tixeuil (2018). A foundational framework for certified impossibility results with mobile robots on graphs. ICDCN 2018, 5:1–5:10.
Metadata from Crossref. Abstract read (OpenAlex).
Balabonski2018Synchronousjournal
Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain (2018). Synchronous Gathering without Multiplicity Detection: a Certified Algorithm. Theory of Computing Systems 63(2):200–218.
First appeared in 2016. Read: the HAL version.
Found by the backfill search of 27 October 2026 and read (HAL version). Journal metadata from Crossref; the 2016 conference version was not looked up.
Bampas2017Maximal preprint
Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Jan Hackfeld, Christina Karousatou (2018). Maximal Exploration of Trees with Energy-Constrained Agents. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read (arXiv v1, the only version).
Bampas2018Mobilejournal
Evangelos Bampas, David Ilcinkas (2018). On mobile agent verifiable problems. Information and Computation 260:51–71.
First appeared in 2015. Read: author version on HAL (hal-01820407, 2018).
Found by the backfill search of 27 October 2026; read in full in the author version on HAL. The AlgoTel paper is a French short version.
Bockenhauer2018Graph preprint
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger (2018). The Graph Exploration Problem with Advice. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Bodlaender2018Exploring preprint
Hans L. Bodlaender, Tom C. van der Zanden (2018). On Exploring Temporal Graphs of Small Pathwidth. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Bouchard2018Deterministicjournal
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit (2018). On deterministic rendezvous at a node of agents with arbitrary velocities. Information Processing Letters 133:39–43.
First appeared in 2017.
Found by the backfill search of 27 October 2026; abstract read.
Bournat2018Gracefullyconference
Marjorie Bournat, Swan Dubois, Franck Petit (2018). Gracefully Degrading Gathering in Dynamic Rings. SSS 2018, LNCS, pp. 349–364.
Found by the backfill search of 27 October 2026; abstract read.
Bramas2018Fourconference
Quentin Bramas, Sébastien Tixeuil (2018). Arbitrary pattern formation with four robots. SSS 2018, pp. 333–348.
Chuangpishit2017Patrollingconference
Huda Chuangpishit, Jurek Czyzowicz, Leszek Gąsieniec, Konstantinos Georgiou, Tomasz Jurdziński, Evangelos Kranakis (2018). Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits. SOFSEM 2018, LNCS, pp. 367–380.
First appeared in 2017. Read: arXiv v1 (2017).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Chuangpishit2019Averageconference
Huda Chuangpishit, Konstantinos Georgiou, Preeti Sharma (2018). Average Case - Worst Case Tradeoffs for Evacuating 2 Robots from the Disk in the Face-to-Face Model. ALGOSENSORS 2018, LNCS.
Read: arXiv v1 (2018).
Coppola2018Provable preprint
Mario Coppola, Jian Guo, Eberhard K. A. Gill, Guido C. H. E. de Croon (2018). Provable Emergent Pattern Formation by a Swarm of Anonymous, Homogeneous, Non-Communicating, Reactive Robots with Limited Relative Sensing and no Global Knowledge or Positioning. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Czyzowicz2016MultipleExitsjournal
Jurek Czyzowicz, Stefan Dobrev, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie (2018). Evacuating two robots from multiple unknown exits in a circle. Theoretical Computer Science 709:20–30.
First appeared in 2016. Read: the ICDCN 2016 version.
Czyzowicz2019Linearconference
Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis (2018). Linear Rendezvous with Asymmetric Clocks. OPODIS 2018, LIPIcs 125, 25:1–25:16.
Found by the backfill search of 27 October 2026; abstract read.
Das2018Distributedjournal
Deepanwita Das, Srabani Mukhopadhyaya (2018). Distributed algorithm for painting by a swarm of randomly deployed robots under limited visibility model. International Journal of Advanced Robotic Systems 15(5).
Found by the backfill search of 27 October 2026; read on 29 October 2026 (open access, downloaded through a browser on 29 October 2026): model, algorithm and correctness argument.
Daymude2018Coatingjournal
Joshua J. Daymude, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter, Andréa W. Richa, Christian Scheideler, Thim Strothmann (2018). On the runtime of universal coating for programmable matter. Natural Computing 17:81–96.
First appeared in 2016. Read: arXiv v4 (2017).
DEmidio2018Characterizingjournal
Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra (2018). Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane. Information and Computation 263:57–74.
Other versions- ICDCS 2016, IEEE, pp. 293–302, as “Characterizing the computational power of anonymous mobile robots”
- IWOCA 2015, LNCS 9538, pp. 136–147, as “About ungatherability of oblivious and asynchronous robots on anonymous rings”
First appeared in 2015.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the journal version, downloaded through a browser on 29 October 2026); the computer-assisted search was not rerun. The two earlier versions are named in its first footnote.
DiLuna2018Lineconference
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta (2018). Line Recovery by Programmable Particles. ICDCN 2018, ACM, pp. 1–10.
First appeared in 2017. Read: arXiv v1 (2017).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Elouasbi2018Deterministicjournal
Samir Elouasbi, Andrzej Pelc (2018). Deterministic Meeting of Sniffing Agents in the Plane. Fundamenta Informaticae 160(3):281–301.
First appeared in 2016.
Found by the backfill search of 27 October 2026; abstract read.
Feletti2018Opaqueconference
Caterina Feletti, Carlo Mereghetti, Beatrice Palano (2018). Uniform circle formation for swarms of opaque robots with lights. SSS 2018, pp. 317–332.
Gastineau2019Leaderconference
Nicolas Gastineau, Wahabou Abdou, Nader Mbarek, Olivier Togni (2018). Distributed Leader Election and Computation of Local Identifiers for Programmable Matter. ALGOSENSORS 2018, LNCS.
Read: arXiv v1 (2018).
Georgiou2018Symmetricconference
Konstantinos Georgiou, Jay Griffiths, Yuval Yakubov (2018). Symmetric Rendezvous with Advice: How to Rendezvous in a Disk. SIROCCO 2018, LNCS, pp. 121–133.
Found by the backfill search of 27 October 2026; abstract read.
Gmyr2018Shapeconference
Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler (2018). Shape Recognition by a Finite Automaton Robot. MFCS 2018, LIPIcs 117, 52:1–52:15.
Found by the backfill search of 27 October 2026; abstract read.
Gorain2018Deterministicjournal
Barun Gorain, Andrzej Pelc (2018). Deterministic Graph Exploration with Advice. ACM Transactions on Algorithms 15(1):1–17.
First appeared in 2016.
Found by the backfill search of 27 October 2026; abstract read.
Heriban2018Optimallyconference
Adam Heriban, Xavier Défago, Sébastien Tixeuil (2018). Optimally Gathering Two Robots. ICDCN 2018, pp. 1–10.
First appeared in 2017. Read: arXiv v1 (2017).
Ilcinkas2018Ringjournal
David Ilcinkas, Ahmed Mouhamadou Wade (2018). Exploration of the T-interval-connected dynamic graphs: the case of the ring. Theory of Computing Systems 62(5):1144–1160.
First appeared in 2013.
Izumi2018Connectivityjournal
Taisuke Izumi, Daichi Kaino, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil (2018). On time complexity for connectivity-preserving scattering of mobile robots. Theoretical Computer Science 738:42–52.
First appeared in 2010.
Liu2018Teamjournal
Zhiqiang Liu, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (2018). Team assembling problem for asynchronous heterogeneous mobile robots. Theoretical Computer Science 721:27–41.
Pattanayak2018TwoExitsbrief announcement
Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal, Stefan Schmid (2018). Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication. ICDCN 2018 (short paper).
First appeared in 2017. Read: arXiv v1 (2017).
Pelc2018Crashjournal
Andrzej Pelc (2018). Deterministic gathering with crash faults. Networks 72(2):182–199.
First appeared in 2017.
Gathering with motion and total crash faults; impossibility under full asynchrony (3-node clique argument), solved with fixed speeds. Metadata from Crossref; abstract and introduction read in the arXiv version.
Pelc2018Explorableconference
Andrzej Pelc (2018). Explorable Families of Graphs. SIROCCO 2018, LNCS, pp. 165–177.
Found by the backfill search of 27 October 2026; abstract read.
Pelc2018Usejournal
Andrzej Pelc (2018). Use of information, memory and randomization in asynchronous gathering. Journal of Computer and System Sciences 94:193–205.
First appeared in 2017.
Found by the backfill search of 27 October 2026; abstract read.
Porter2018Collaborativeconference
Alexandra Porter, Andrea Richa (2018). Collaborative Computation in Self-organizing Particle Systems. UCNC 2018, LNCS, pp. 188–203.
First appeared in 2017.
Found by the backfill search of 27 October 2026; abstract read.
Schmidt2018Efficientjournal
Arne Schmidt, Sheryl Manzoor, Li Huang, Aaron T. Becker, Sandor P. Fekete (2018). Efficient Parallel Self-Assembly Under Uniform Control Inputs. IEEE Robotics and Automation Letters 3(4):3521–3528.
Found by the backfill search of 27 October 2026; abstract read.
Sharma2018Fatconference
Gokarna Sharma, Rusul Alsaedi, Costas Busch, Supratik Mukhopadhyay (2018). The Complete Visibility Problem for Fat Robots with Lights. ICDCN 2018.
Tsuchida2020ByzantineTolerantjournal
Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue (2018). Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards. IEICE Transactions on Information and Systems E101.D(3):602–610.
Other versions- IEICE Transactions on Information and Systems E103.D(7):1672–1682, 2020, as “Byzantine-Tolerant Gathering of Mobile Agents in Asynchronous Arbitrary Networks with Authenticated Whiteboards” doi:10.1587/transinf.2019edp7311
Found by the backfill search of 27 October 2026; abstract read.
Acharjee2019Shorelineconference
Sumi Acharjee, Konstantinos Georgiou, Somnath Kundu, Akshaya Srinivasan (2019). Lower Bounds for Shoreline Searching With 2 or More Robots. OPODIS 2019, LIPIcs 153, 26:1–26:11.
Bagheri2019Trianglesconference
Iman Bagheri, Lata Narayanan, Jaroslav Opatrny (2019). Evacuation of Equilateral Triangles by Mobile Agents of Limited Communication Range. ALGOSENSORS 2019, LNCS, pp. 3–22.
Read: arXiv v1 (2019).
Balabonski2019Continuousconference
Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain (2019). Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots. NETYS 2019, LNCS, pp. 93–109.
Other versions- SSS 2018 (brief announcement), LNCS, pp. 404–408, as “Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots” doi:10.1007/978-3-030-03232-6_29
First appeared in 2018.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the HAL copy, CC BY).
Bampas2019Asynchronousjournal
Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil (2019). On asynchronous rendezvous in general graphs. Theoretical Computer Science 753:80–90.
First appeared in 2018.
Found by the backfill search of 27 October 2026; abstract read.
Bampas2019Speedsjournal
Evangelos Bampas, Jurek Czyzowicz, Leszek Gąsieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pająk (2019). Linear Search by a Pair of Distinct-Speed Robots. Algorithmica 81(1):317–342.
First appeared in 2016.
Bazzi2019Stationaryconference
Rida A. Bazzi, Joseph L. Briones (2019). Stationary and Deterministic Leader Election in Self-organizing Particle Systems. SSS 2019, LNCS, pp. 22–37.
Other versions- SSS 2018 brief announcement, LNCS, pp. 381–386, as “Brief Announcement: Deterministic Leader Election in Self-organizing Particle Systems” doi:10.1007/978-3-030-03232-6_25
First appeared in 2018.
Brief announcement at SSS 2018. The \(O(n^2)\) running time is stated in the abstract and Table 1 without proof.
Bhagat2019Visibilityconference
Subhash Bhagat, Krishnendu Mukhopadhyaya (2019). Mutual Visibility by Robots with Persistent Memory. FAW 2019, LNCS, pp. 144–155.
First appeared in 2017. Read: arXiv v1 (2017).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Bose2019Positionalconference
Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau (2019). Positional Encoding by Robots with Non-rigid Movements. SIROCCO 2019, LNCS, pp. 94–108.
Read: arXiv v1 (2019).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Bouchard2019Deterministicthesis
Sébastien Bouchard (2019). On the Deterministic Gathering of Mobile Agents. PhD thesis, Sorbonne Université.
Found by the backfill search of 27 October 2026; abstract read (HAL copy).
Bournat2019Highlyjournal
Marjorie Bournat, Ajoy K. Datta, Swan Dubois (2019). Self-stabilizing robots in highly dynamic environments. Theoretical Computer Science 772:88–110.
First appeared in 2016.
Metadata from Crossref (SSS version: doi 10.1007/978-3-319-49259-9_5). Read in the HAL author manuscript: model, Theorems 3.1, 3.2, 4.1, 5.1.
Cannon2019Separationconference
Sarah Cannon, Joshua J. Daymude, Cem Gökmen, Dana Randall, Andréa W. Richa (2019). A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. APPROX/RANDOM 2019, LIPIcs 145, 54:1–54:22.
Other versions- PODC 2018 brief announcement, pp. 483–485, as “Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems” doi:10.1145/3212734.3212792
First appeared in 2018. Read: arXiv v2 (2019).
Cicerone2019Asynchronousjournal
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra (2019). Asynchronous arbitrary pattern formation: the effects of a rigorous approach. Distributed Computing 32(2):91–132.
First appeared in 2017. Read: arXiv v2 (2018).
Clements2019Balancedjournal
Wyatt Clements, Costas Busch, Limeng Pu, Daniel Smith, Hsiao-Chun Wu (2019). Balanced Parallel Exploration of Orthogonal Regions. Algorithms 12(5):104.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (open access, downloaded through a browser on 29 October 2026): model, algorithm and theorems.
Coppola2019Provablejournal
Mario Coppola, Jian Guo, Eberhard Gill, Guido C. H. E. de Croon (2019). Provable self-organizing pattern formation by a swarm of robots with limited knowledge. Swarm Intelligence 13(1):59–94.
Found by the backfill search of 27 October 2026; abstract read.
Czyzowicz2019Energyconference
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil Shende (2019). Energy Consumption of Group Search on a Line. ICALP 2019, LIPIcs 132, 137:1–137:15.
Czyzowicz2019Energyoptimaljournal
Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter (2019). Energy-optimal broadcast and exploration in a tree using mobile agents. Theoretical Computer Science 795:362–374.
First appeared in 2017.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (the TCS version, downloaded through a browser on 29 October 2026): model, algorithms and theorems. The ALGOSENSORS 2017 presentation is named in the paper.
Czyzowicz2019FaultyLinejournal
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny (2019). Search on a Line with Faulty Robots. Distributed Computing 32(6):493–504.
First appeared in 2016. Read: the PODC 2016 version.
Local copy is the PODC 2016 version; theorem numbers refer to it.
Czyzowicz2019GroupSearchconference
Jurek Czyzowicz, Kostantinos Georgiou, Evangelos Kranakis (2019). Group Search and Evacuation. Lecture Notes in Computer Science Distributed Computing by Mobile Entities, 335-370.
Czyzowicz2019Planejournal
Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel (2019). Group search of the plane with faulty robots. Theoretical Computer Science 792, pp. 69-84.
Das2019Compactingconference
Shantanu Das, Giuseppe Antonio Di Luna, Linda Pagli, Giuseppe Prencipe (2019). Compacting and Grouping Mobile Agents on Dynamic Rings. TAMC 2019, LNCS, pp. 114–133.
Found by the backfill search of 27 October 2026; read on 29 October 2026 in the authors' camera-ready copy (repository of the University of Pisa, downloaded through a browser on 29 October 2026): model and theorems. Not a version of Das et al. 2021a, which has other authors and oblivious agents.
Das2019Gatheringjournal
Shantanu Das, Riccardo Focardi, Flaminia L. Luccio, Euripides Markou, Marco Squarcina (2019). Gathering of robots in a ring with mobile faults. Theoretical Computer Science 764:42–60.
Other versions- ICTCS 2016, CEUR Workshop Proceedings 1720 pdf
First appeared in 2016. Read: ICTCS 2016 version (abstract).
Found by the backfill search of 27 October 2026 (the manifest merged it with the SOFSEM 2019 grid paper of Das, Giachoudis, Luccio and Markou); abstract of the ICTCS 2016 version read.
Das2019Patrollingconference
Shantanu Das, Giuseppe A. Di Luna, Leszek A. Gąsieniec (2019). Patrolling on Dynamic Ring Networks. SOFSEM 2019, LNCS, pp. 150–163.
First appeared in 2018. Read: arXiv v1 (2018).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Das2019Surveyconference
Shantanu Das (2019). Graph Explorations with Mobile Agents. Distributed Computing by Mobile Entities, LNCS 11340, pp. 403–422.
Das2020Obliviousconference
Shantanu Das, Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita (2019). Oblivious Permutations on the Plane. OPODIS 2019, LIPIcs 153, 24:1–24:16.
Read: arXiv v1 (2019).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Metadata from DataCite; the proceedings appeared in 2020.
Devismes2019Torusjournal
Stéphane Devismes, Anissa Lamani, Franck Petit, Sébastien Tixeuil (2019). Optimal torus exploration by oblivious robots. Computing 101(9):1241–1264.
First appeared in 2015.
Metadata from Crossref (online 2018). Not read (open copy on HAL).
Disser2019Pebblesjournal
Yann Disser, Jan Hackfeld, Max Klimm (2019). Tight bounds for undirected graph exploration with pebbles and multiple agents. Journal of the ACM 66(6).
First appeared in 2016. Read: arXiv v1 (2018).
Disser2019Secondconference
Yann Disser, Sören Schmitt (2019). Evacuating Two Robots from a Disk: A Second Cut. SIROCCO 2019, pp. 200–214.
Read: arXiv v1 (2019).
Dolev2019Neighborhoodbrief announcement
Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada (2019). Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots. DISC 2019 (brief announcement), LIPIcs 146, 43:1–43:3.
Read: arXiv v1 (2019), the full version.
Found by the backfill search of 27 October 2026 and read (arXiv v1). Metadata from DataCite.
Ehresmann2019Distributedconference
Anne-Laure Ehresmann, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny (2019). Distributed Pattern Formation in a Ring. SIROCCO 2019, LNCS, pp. 215–229.
Found by the backfill search of 27 October 2026; abstract read.
Emek2019Deterministicconference
Yuval Emek, Shay Kutten, Ron Lavi, William K. Moses Jr. (2019). Deterministic Leader Election in Programmable Matter. ICALP 2019 (LIPIcs 132), 140.
Read: arXiv v1 (2019).
Fekete2019Connected preprint
Sándor P. Fekete, Eike Niehs, Christian Scheffer, Arne Schmidt (2019). Connected Assembly and Reconfiguration by Finite Automata. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Flocchini2019Gatheringconference
Paola Flocchini, Ryan Killick, Evangelos Kranakis, Nicola Santoro, Masafumi Yamashita (2019). Gathering and Election by Mobile Robots in a Continuous Cycle. ISAAC 2019, LIPIcs 149, 8:1–8:19.
Found by the backfill search of 27 October 2026 and read (LIPIcs version). Metadata from DataCite; no journal version found in Crossref on 28 October 2026.
Flocchini2019Synchronousconference
Paola Flocchini, Nicola Santoro, Koichi Wada (2019). On Memory, Communication, and Synchronous Schedulers When Moving and Computing. OPODIS 2019, LIPIcs 153, 25:1–25:17.
Georgiou2019SearchFetchjournal
Konstantinos Georgiou, George Karakostas, Evangelos Kranakis (2019). Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models. Discrete Mathematics & Theoretical Computer Science 21(3).
First appeared in 2016. Read: arXiv v6 (2019).
Conference version at ICORES 2017, doi:10.5220/0006091600150026.
Haeupler2019Optimalconference
Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister (2019). Optimal Strategies for Patrolling Fences. ICALP 2019, LIPIcs 132, 144:1–144:13.
First appeared in 2018. Read: arXiv v2 (2019); theorem numbers refer to it.
Found by the backfill search of 27 October 2026 and read (arXiv v2). Metadata from DataCite.
Ilcinkas2019Explorationconference
David Ilcinkas (2019). Oblivious robots on graphs: exploration. Distributed Computing by Mobile Entities, LNCS 11340, pp. 218–233.
Metadata from Crossref. Survey; read in the HAL author version.
Kosowski2019Doesjournal
Adrian Kosowski, Dominik Pająk (2019). Does adding more agents make a difference? A case study of cover time for the rotor-router. Journal of Computer and System Sciences 106:80–93.
First appeared in 2014. Read: the HAL version.
Found by the backfill search of 27 October 2026 and read (HAL version). Journal metadata from Crossref; the 2014 conference version was not looked up.
Kshemkalyani2019Efficientconference
Ajay D. Kshemkalyani, Faizan Ali (2019). Efficient Dispersion of Mobile Robots on Graphs. ICDCN 2019.
First appeared in 2018. Read: arXiv v1 (2018).
First paper with \(k \le n\), with asynchronous algorithms, and with an explicit termination column; proves the \(\Omega(k)\) time lower bound.
Kshemkalyani2019Fastconference
Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma (2019). Fast Dispersion of Mobile Robots on Arbitrary Graphs. ALGOSENSORS 2019 (LNCS 11931).
First appeared in 2018. Read: arXiv v3 (2019).
The paper states the time bound with a \(\log k\) factor; later papers restate it as \(\log \ell\). The arXiv preprint 1812.05352 covers both the ALGOSENSORS 2019 paper on arbitrary graphs and the WALCOM 2020 paper on grids.
Lechine2019Asynchronous preprint
Ulysse Léchine, Sébastien Tixeuil (2019). Asynchronous Scattering. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1). No published version found in Crossref on 28 October 2026.
Molla2019Randomnessconference
Anisur Rahaman Molla, William K. Moses Jr. (2019). Dispersion of Mobile Robots: The Power of Randomness. TAMC 2019 (LNCS 11436).
Read: arXiv v1 (2019).
Osula2019Minimizingconference
Dorota Osula (2019). Minimizing the Cost of Team Exploration. SOFSEM 2019, LNCS, pp. 392–405.
First appeared in 2017.
Found by the backfill search of 27 October 2026; abstract read.
Pattanayak2019Chauffeuringconference
Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal (2019). Chauffeuring a Crashed Robot from a Disk. ALGOSENSORS 2019, pp. 177–191.
Read: arXiv v1 (2019).
Pattanayak2019Crashjournal
Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal (2019). Gathering of mobile robots with weak multiplicity detection in presence of crash-faults. Journal of Parallel and Distributed Computing 123:145–155.
First appeared in 2016. Read: arXiv v1 (2016).
Pelc2019Cost preprint
Andrzej Pelc, Ram Narayan Yadav (2019). Cost vs. Information Tradeoffs for Treasure Hunt in the Plane. arXiv preprint.
Found by the backfill search of 27 October 2026 and read (arXiv v1). No published version in the manifest.
Pelc2019Surveyconference
Andrzej Pelc (2019). Deterministic rendezvous algorithms. Distributed Computing by Mobile Entities, LNCS 11340, pp. 423–454.
Read: arXiv v1 (2023).
Pelc2019Timeconference
Andrzej Pelc, Ram Narayan Yadav (2019). Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous. SPAA 2019, ACM, pp. 85–92.
First appeared in 2018.
Found by the backfill search of 27 October 2026; read in full (arXiv v1, 2018); their \(\delta\) is \(\tau\) here.
Shibata2019Partialjournal
Masahiro Shibata, Daisuke Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (2019). Partial Gathering of Mobile Agents in Arbitrary Networks. IEICE Transactions on Information and Systems E102.D(3):444–453.
Found by the backfill search of 27 October 2026; abstract read.
Almethen2020Pushingjournal
Abdullah Almethen, Othon Michail, Igor Potapov (2020). Pushing lines helps: Efficient universal centralised transformations for programmable matter. Theoretical Computer Science 830–831:43–59.
First appeared in 2019. Read: arXiv v1 (2019).
Conference version at ALGOSENSORS 2019.
Amir2019Fastconference
Michael Amir, Alfred M. Bruckstein (2020). Fast Uniform Dispersion of a Crash-prone Swarm. Robotics: Science and Systems XVI (RSS 2020).
First appeared in 2019. Read: arXiv v3 (2020).
Found by the backfill search of 27 October 2026 and read (arXiv v3). RSS metadata from Crossref.
Bartschi2020Collaborativejournal
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matúš Mihalák (2020). Collaborative delivery with energy-constrained mobile robots. Theoretical Computer Science 810:2–14.
First appeared in 2016. Read: arXiv v1 (2016).
Found by the backfill search of 27 October 2026; read in full in arXiv v1 (2016); theorem numbers refer to it.
Bose2020Arbitraryjournal
Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau (2020). Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theoretical Computer Science 815:213–227.
First appeared in 2018.
Found by the backfill search of 27 October 2026; abstract read.
Bose2020Fatconference
Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau (2020). Arbitrary Pattern Formation by Opaque Fat Robots with Lights. CALDAM 2020, LNCS 12016, pp. 347–359.
First appeared in 2019. Read: arXiv v1 (2019).
Bouchard2020Deterministicjournal
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit (2020). Deterministic Treasure Hunt in the Plane with Angular Hints. Algorithmica 82(11):3250–3281.
First appeared in 2018. Read: arXiv v1 (2020).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal and ISAAC metadata from Crossref and DataCite.
Bramas2020Standconference
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil (2020). Stand Up Indulgent Rendezvous. SSS 2020, LNCS, pp. 45–59.
Found by the backfill search of 27 October 2026; abstract read.
Bramas2021Infiniteconference
Quentin Bramas, Stéphane Devismes, Pascal Lafourcade (2020). Infinite grid exploration by disoriented robots. NETYS 2020, LNCS, pp. 129–145.
First appeared in 2019.
Metadata from Crossref (SIROCCO brief announcement doi 10.1007/978-3-030-24922-9_25). Abstract read in the arXiv version. The journal paper without chirality (Discrete Applied Mathematics 2025) is the journal version of Bramas et al. 2025a, not of this paper.
Brandt2020Onlinejournal
Sebastian Brandt, Klaus-Tycho Foerster, Jonathan Maurer, Roger Wattenhofer (2020). Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs. Theoretical Computer Science 839:176–185.
First appeared in 2019.
Found by the backfill search of 27 October 2026; abstract read.
Brandt2020Raysjournal
Sebastian Brandt, Klaus-Tycho Foerster, Benjamin Richner, Roger Wattenhofer (2020). Wireless evacuation on m rays with k searchers. Theoretical Computer Science 811:56–69.
First appeared in 2017.
Conference version at SIROCCO 2017.
Brandt2020Tightjournal
Sebastian Brandt, Jara Uitto, Roger Wattenhofer (2020). A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration. Distributed Computing 33(6):471–484.
First appeared in 2017.
Found by the backfill search of 27 October 2026; abstract read.
Braun2020Localconference
Michael Braun, Jannik Castenow, Friedhelm Meyer auf der Heide (2020). Local Gathering of Mobile Robots in Three Dimensions. SIROCCO 2020, LNCS, pp. 63–79.
Read: arXiv v1 (2020).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Castenow2020Gatheringjournal
Jannik Castenow, Matthias Fischer, Jonas Harbig, Daniel Jung, Friedhelm Meyer auf der Heide (2020). Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science 815:289–309.
First appeared in 2017.
Found by the backfill search of 27 October 2026; abstract read.
Chuangpishit2020MultiObjectivejournal
Huda Chuangpishit, Konstantinos Georgiou, Preeti Sharma (2020). A Multi-Objective Optimization Problem on Evacuating 2 Robots from the Disk in the Face-to-Face Model; Trade-Offs between Worst-Case and Average-Case Analysis. Information 11, 506.
First appeared in 2018.
Chuangpishit2020Trianglesjournal
Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan, Jaroslav Opatrny (2020). Evacuating equilateral triangles and squares in the face-to-face model. Computational Geometry 89:101624.
First appeared in 2017. Read: arXiv v1 (2018).
Coleman2020Minimizing preprint
Jared Coleman, Evangelos Kranakis, Oscar Morales-Ponce, Jaroslav Opatrný, Jorge Urrutia, Birgit Vogtenhuber (2020). Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Czyzowicz2018GodSaveQueenjournal
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil Shende (2020). Priority evacuation from a disk: the case of \(n = 1, 2, 3\). Theoretical Computer Science 806:595–616.
First appeared in 2018. Read: the FUN 2018 version.
Czyzowicz2018Priorityjournal
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil Shende (2020). Priority evacuation from a disk: the case of \(n \ge 4\). Theoretical Computer Science 846:91–102.
First appeared in 2018. Read: arXiv v1 (2018).
Czyzowicz2020Buildingjournal
Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc (2020). Building a Nest by an Automaton. Algorithmica 83(1):144–176.
First appeared in 2019.
Found by the backfill search of 27 October 2026; abstract read.
Czyzowicz2020FaceToFacejournal
Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jaroslav Opatrny, Birgit Vogtenhuber (2020). Evacuating Robots from a Disk Using Face-to-Face Communication. Discrete Mathematics & Theoretical Computer Science 22(4).
First appeared in 2015. Read: arXiv v5 (2020).
Czyzowicz2020Gatheringjournal
Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce (2020). Gathering in the plane of location-aware robots in the presence of spies. Theoretical Computer Science 836:94–109.
First appeared in 2017. Read: arXiv v1 (2017).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal metadata from Crossref.
Czyzowicz2020Searchingjournal
Jurek Czyzowicz, Stefan Dobrev, Maxime Godon, Evangelos Kranakis, Toshinori Sakai, Jorge Urrutia (2020). Searching for a non-adversarial, uncooperative agent on a cycle. Theoretical Computer Science 806:531–542.
First appeared in 2017.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the open TCS copy, downloaded through a browser).
DAngelo2020Silentjournal
Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe (2020). Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. IEEE Access 8:207619–207634.
Other versions- AAMAS 2020, pp. 276–284, as “Leader Election and Compaction for Asynchronous Silent Programmable Matter” pdf
Das2020Luminousjournal
Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro (2020). Forming Sequences of Patterns With Luminous Robots. IEEE Access 8:90577–90597.
First appeared in 2014.
Conference version at FUN 2014.
Daymude2020Hullconference
Joshua J. Daymude, Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Christian Scheideler, Andréa W. Richa (2020). Convex Hull Formation for Programmable Matter. ICDCN 2020, 2:1–2:10.
First appeared in 2018. Read: arXiv v2 (2019).
Defago2006Faultjournal
Xavier Défago, Maria Potop-Butucaru, Philippe Raipin-Parvédy (2020). Self-stabilizing gathering of mobile robots under crash or Byzantine faults. Distributed Computing 33(5):393–421.
Other versions- DISC 2006, LNCS, pp. 46–60, as “Fault-Tolerant and Self-stabilizing Mobile Robots Gathering” doi:10.1007/11864219_4
- Research report PI 1802, HAL inria-00069600, 2006, as “Fault-tolerant and Self-stabilizing Mobile Robots Gathering - Feasibility Study” pdflink
- Preprint, HAL hal-01275265 (the 2014 revision of the journal submission), as “Fault and Byzantine Tolerant Self-stabilizing Mobile Robots Gathering — Feasibility Study —” pdflink
First appeared in 2006.
Metadata from Crossref. Full texts of both versions read: the DISC 2006 version defers most proofs to a full version; the journal version, by three of the four authors (Gradinariu publishes as Potop-Butucaru), considerably extends it and has the proofs.
DiLuna2019Meetingjournal
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita (2020). Meeting in a polygon by anonymous oblivious robots. Distributed Computing 33(5):445–469.
First appeared in 2017.
Found by the backfill search of 27 October 2026; abstract read.
DiLuna2020Dynamicjournal
Giuseppe A. Di Luna, Stefan Dobrev, Paola Flocchini, Nicola Santoro (2020). Distributed exploration of dynamic rings. Distributed Computing 33(1):41–67.
First appeared in 2015. Read: arXiv v4 (2018).
DiLuna2020Gatheringjournal
Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta (2020). Gathering in dynamic rings. Theoretical Computer Science 811:79–98.
First appeared in 2017.
Found by the backfill search of 27 October 2026; abstract read.
DiLuna2020MobileRAMconference
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi (2020). Mobile RAM and Shape Formation by Programmable Particles. Euro-Par 2020, LNCS, pp. 343–358.
Read: arXiv v2 (2020).
DiLuna2020Shapejournal
Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi (2020). Shape formation by programmable particles. Distributed Computing 33:69–101.
First appeared in 2017. Read: arXiv v3 (2017).
Disser2020Generaljournal
Yann Disser, Frank Mousset, Andreas Noever, Nemanja Škorić, Angelika Steger (2020). A general lower bound for collaborative tree exploration. Theoretical Computer Science 811:70–78.
First appeared in 2016. Read: arXiv v1 (2016).
Dobrev2020Explorationconference
Stefan Dobrev, Rastislav Královič, Dana Pardubská (2020). Exploration of Time-Varying Connected Graphs with Silent Agents. SIROCCO 2020, LNCS, pp. 146–162.
Found by the backfill search of 27 October 2026; read in full (the open Springer chapter).
Dobrev2020Shorelineconference
Stefan Dobrev, Rastislav Královič, Dana Pardubská (2020). Improved Lower Bounds for Shoreline Search. Structural Information and Communication Complexity, pp. 80-90.
Flocchini2020Synchronization preprint
Paola Flocchini, Nicola Santoro, Masafumi Yamashita, Yukiko Yamauchi (2020). Synchronization by Asynchronous Mobile Robots with Limited Visibility. arXiv preprint.
Read: arXiv v2.
Found by the backfill search of 27 October 2026 and read (arXiv v2). No published version in the manifest.
Gastineau2020Leaderjournal
Nicolas Gastineau, Wahabou Abdou, Nader Mbarek, Olivier Togni (2020). Leader election and local identifiers for three-dimensional programmable matter. Concurrency and Computation: Practice and Experience 34(7):e6067.
Read: arXiv v1 (2020).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal metadata from Crossref (published online 2020, in the 2022 volume).
Gmyr2020Tilejournal
Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, Thim Strothmann (2020). Forming tile shapes with simple robots. Natural Computing 19:375–390.
First appeared in 2017.
Conference version at DNA 24 (2018), doi:10.1007/978-3-030-00030-1_8; first presented at EuroCG 2017 (non-archival), which the timeline counts as first appearance.
Gotoh2020Dynamicjournal
Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita, Toshimitsu Masuzawa (2020). Dynamic Ring Exploration with (H,S) View. Algorithms 13(6):141.
Other versions- SSS 2019, LNCS, pp. 165–177, as “Exploration of Dynamic Ring Networks by a Single Agent with the H-hops and S-time Steps View”
First appeared in 2019.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (open access, downloaded through a browser on 29 October 2026). The SSS 2019 version is named in the paper.
Hideg2020Fillingconference
Attila Hideg, Tamás Lukovszki (2020). Asynchronous filling by myopic luminous robots. ALGOSENSORS 2020, LNCS, pp. 108–123.
First appeared in 2019.
Metadata from Crossref. Abstract read in the arXiv version.
Ilcinkas2020Carrierbasedjournal
David Ilcinkas, Ahmed M. Wade (2020). Exploration of carrier-based time-varying networks: The power of waiting. Theoretical Computer Science 841:50–61.
Found by the backfill search of 27 October 2026; abstract read.
Jawhar2020Bikethesis
Khaled Jawhar (2020). Bike Assisted Linear Search and Evacuation. Master's thesis, Carleton University.
Found by the backfill search of 27 October 2026; abstract read.
Kawamura2020Simplejournal
Akitoshi Kawamura, Makoto Soejima (2020). Simple strategies versus optimal schedules in multi-agent patrolling. Theoretical Computer Science 839:195–206.
First appeared in 2014. Read: arXiv v3 (2021).
Kim2020Pairbot preprint
Yonghwan Kim, Yoshiaki Katayama, Koichi Wada (2020). Pairbot: A Novel Model for Autonomous Mobile Robot Systems Consisting of Paired Robots. arXiv preprint.
Read: arXiv v2 (2024).
Found by the backfill search of 27 October 2026 and read (arXiv v2). No published version in the manifest.
Kshemkalyani2020Dynamicconference
Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma (2020). Efficient Dispersion of Mobile Robots on Dynamic Graphs. ICDCS 2020.
Kshemkalyani2020Globalconference
Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma (2020). Dispersion of Mobile Robots in the Global Communication Model. ICDCN 2020.
First appeared in 2019. Read: arXiv v1 (2019).
The DFS bound claimed here (\(O(\min(m,k\Delta))\) time with \(O(\log(k+\Delta))\) bits) is weakened in the journal version; cite Kshemkalyani et al. 2022 for the DFS bounds.
Kshemkalyani2020Gridsconference
Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma (2020). Dispersion of Mobile Robots on Grids. WALCOM 2020 (LNCS 12049).
First appeared in 2018. Read: arXiv v3 (2019).
The arXiv version (shared with Kshemkalyani et al. 2019) says the agents have no consistent compass; later papers describe this setting as an oriented grid. To be checked against the WALCOM text. The arXiv preprint 1812.05352 covers both the ALGOSENSORS 2019 paper on arbitrary graphs and the WALCOM 2020 paper on grids.
Lamprou2020Fastjournal
Ioannis Lamprou, Russell Martin, Sven Schewe (2020). Fast two-robot disk evacuation with wireless communication. Theoretical Computer Science 846:38–60.
First appeared in 2016. Read: arXiv v1 (2016).
Conference version at DISC 2016, doi:10.1007/978-3-662-53426-7_1.
Miller2020Fastconference
Avery Miller, Ullash Saha (2020). Fast Byzantine Gathering with Visibility in Graphs. ALGOSENSORS 2020, LNCS, pp. 140–153.
Found by the backfill search of 27 October 2026; abstract read.
Oshrat2020Adversarialconference
Yaniv Oshrat, Noa Agmon, Sarit Kraus (2020). Adversarial Fence Patrolling: Non-Uniform Policies for Asymmetric Environments. AAAI 2020, pp. 10377–10384.
Found by the backfill search of 27 October 2026; abstract read.
Pattanayak2020Collaborativeconference
Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal (2020). Collaborative Evacuation of Mobile Robots. Proceedings of the 21st International Conference on Distributed Computing and Networking, 1-1.
Pattanayak2020Conicconference
Debasish Pattanayak, Klaus-Tycho Foerster, Partha Sarathi Mandal, Stefan Schmid (2020). Conic Formation in Presence of Faulty Robots. ALGOSENSORS 2020, LNCS, pp. 170–185.
Found by the backfill search of 27 October 2026; model and theorems read (arXiv v2, 2020, which the manifest also listed as 'Distributed Pattern Formation With Faulty Robots').
Pelc2020Latecomersconference
Andrzej Pelc, Ram Narayan Yadav (2020). Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane. ICDCN 2020, pp. 1–10.
First appeared in 2018.
Found by the backfill search of 27 October 2026; abstract read.
Sangnier2020Verificationjournal
Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru, Sébastien Tixeuil (2020). Parameterized verification of algorithms for oblivious robots on a ring. Formal Methods in System Design 56(1–3):55–89.
First appeared in 2017.
Metadata from Crossref (FMCAD version: doi 10.23919/FMCAD.2017.8102262). Section 4.5 read in the 2017 HAL research report; the journal version was not read.
Shibata2020Moveoptimaljournal
Masahiro Shibata, Norikazu Kawata, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (2020). Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings. Theoretical Computer Science 822:92–109.
Other versions- SIROCCO 2019, LNCS, pp. 277–292, as “Partial Gathering of Mobile Agents Without Identifiers or Global Knowledge in Asynchronous Unidirectional Rings” doi:10.1007/978-3-030-24922-9_19
First appeared in 2019.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the TCS version, downloaded through a browser on 29 October 2026).
Shintaku2020Knowledgeconference
Takahiro Shintaku, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (2020). Efficient Dispersion of Mobile Agents without Global Knowledge. SSS 2020 (LNCS 12514).
Read: arXiv v1 (2020).
Sun2020Byzantineconference
Xiaoming Sun, Yuan Sun, Jialin Zhang (2020). Better Upper Bounds for Searching on a Line with Byzantine Robots. Complexity and Approximation, LNCS 12000, pp. 151–171.
Afshani2021Approximationconference
Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang (2021). Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. WAFR 2020 (Algorithmic Foundations of Robotics XIV), Springer Proceedings in Advanced Robotics, pp. 107–123.
First appeared in 2020. Read: arXiv v3.
Found by the backfill search of 27 October 2026 and read (arXiv v3). Venue from Crossref.
Akitaya2021Characterizingconference
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán (2021). Characterizing Universal Reconfigurability of Modular Pivoting Robots. SoCG 2021, LIPIcs 189, 10:1–10:20.
First appeared in 2020.
Found by the backfill search of 27 October 2026; abstract read.
Akitaya2021Musketeersjournal
Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmović, Robin Flatland, Matias Korman, Belen Palop, Irene Parada, André van Renssen, Vera Sacristán (2021). Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. Algorithmica 83:1316–1351.
Read: arXiv v2 (2019).
Balabonski2021Computerbrief announcement
Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain (2021). Computer Aided Formal Design of Swarm Robotics Algorithms. SSS 2021 (short paper), LNCS, pp. 469–473.
Read: arXiv v1 (2021), the full version.
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref; the SSS paper has five pages.
Barel2021Probabilisticjournal
Ariel Barel, Thomas Dagès, Rotem Manor, Alfred M. Bruckstein (2021). Probabilistic Gathering of Agents with Simple Sensors. SIAM Journal on Applied Mathematics 81(2):620–640.
First appeared in 2019. Read: arXiv v2 (2020).
Found by the backfill search of 27 October 2026 and read (arXiv v2). Journal metadata from Crossref.
Bartschi2021Neargatheringjournal
Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matúš Mihalák (2021). Near-gathering of energy-constrained mobile agents. Theoretical Computer Science 849:35–46.
First appeared in 2019.
Found by the backfill search of 27 October 2026; abstract read (HAL version).
Bhagat2021kCirclejournal
Subhash Bhagat, Bibhuti Das, Abhinav Chakraborty, Krishnendu Mukhopadhyaya (2021). k-Circle Formation and k-epf by Asynchronous Robots. Algorithms 14(2):62.
Birx2021Improvedjournal
Alexander Birx, Yann Disser, Alexander V. Hopp, Christina Karousatou (2021). An improved lower bound for competitive graph exploration. Theoretical Computer Science 868:65–86.
First appeared in 2020.
Found by the backfill search of 27 October 2026; abstract read.
Bose2021Opaquejournal
Kaustav Bose, Manash Kumar Kundu, Ranendu Adhikary, Buddhadeb Sau (2021). Arbitrary pattern formation by asynchronous opaque robots with lights. Theoretical Computer Science 849:138–158.
First appeared in 2019. Read: arXiv v4 (2020).
Bose2022Patternconference
Kaustav Bose, Archak Das, Buddhadeb Sau (2021). Pattern Formation by Robots with Inaccurate Movements. OPODIS 2021, LIPIcs 217, 10:1–10:20.
First appeared in 2020.
Found by the backfill search of 27 October 2026; abstract read.
Bouchard2021Impactjournal
Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc (2021). Impact of knowledge on the cost of treasure hunt in trees. Networks 80(1):51–62.
Read: arXiv v1 (2025).
Found by the backfill search of 27 October 2026 and read (arXiv v1, posted in 2025). Journal metadata from Crossref (published online 2021, in the 2022 volume).
Castenow2021Gatheringconference
Jannik Castenow, Jonas Harbig, Daniel Jung, Till Knollmann, Friedhelm Meyer auf der Heide (2021). Gathering a Euclidean Closed Chain of Robots in Linear Time. ALGOSENSORS 2021, LNCS, pp. 29–44.
First appeared in 2020. Read: arXiv v2.
Found by the backfill search of 27 October 2026 and read (arXiv v2). Venue from Crossref.
Chalopin2021Collaborativejournal
Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matúš Mihalák (2021). Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theoretical Computer Science 868:87–96.
First appeared in 2019. Read: author version on HAL (hal-03287588).
Found by the backfill search of 27 October 2026; read in full in the author version on HAL.
Cicerone2020Methodologyjournal
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra (2021). A structured methodology for designing distributed algorithms for mobile entities. Information Sciences 574:111–132.
First appeared in 2020. Read: arXiv version (2020), titled 'A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study'.
Found by the backfill search of 27 October 2026; the arXiv version was read (model, case study and Theorem 3); the journal version, found on Crossref, was not seen.
Cicerone2021Breakingjournal
Serafino Cicerone (2021). Breaking Symmetries on Tessellation Graphs via Asynchronous Robots: The Line Formation Problem as a Case Study. IEEE Access 9:147855–147873.
Other versions- ICTCS 2020, CEUR-WS 2756, pp. 122–136, as “Breaking symmetries on tessellation graphs via asynchronous robots” link
First appeared in 2020.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (open access, downloaded through a browser on 29 October 2026). The ICTCS 2020 version is named in the paper's own references.
Cicerone2021Gatheringjournal
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra (2021). Gathering robots in graphs: The central role of synchronicity. Theoretical Computer Science 849:99–120.
Other versions- SIROCCO 2019, LNCS 11639, pp. 170–184, as “Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies”
First appeared in 2019. Read: the journal pre-proof (repository of the University of L'Aquila).
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 in the pre-proof, downloaded through a browser on 29 October 2026. The SIROCCO 2019 version is named in the paper's own references.
Cicerone2021Solvingjournal
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra (2021). Solving the Pattern Formation by Mobile Robots With Chirality. IEEE Access 9:88177–88204.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (open access, downloaded through a browser on 29 October 2026 from the repository of the University of L'Aquila).
Coleman2021Messageconference
Jared Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce (2021). Message Delivery in the Plane by Robots with Different Speeds. SSS 2021, LNCS, pp. 305–319.
Read: arXiv v1 (2021).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Czyzowicz2021Byzantinejournal
Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil Shende (2021). Search on a line by Byzantine robots. International Journal of Foundations of Computer Science 32(4):369–387.
First appeared in 2016. Read: arXiv v1 (2016).
Journal details from the research notes; DOI not checked.
Czyzowicz2021Gossipingjournal
Jurek Czyzowicz, Dariusz Dereniowski, Robert Ostrowski, Wojciech Rytter (2021). Gossiping by energy-constrained mobile agents in tree networks. Theoretical Computer Science 861:45–65.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (the TCS version, downloaded through a browser on 29 October 2026): model, structure of solutions and main theorems.
Czyzowicz2021Graphconference
Jurek Czyzowicz, Stefan Dobrev, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil Shende (2021). Graph Exploration by Energy-Sharing Mobile Agents. SIROCCO 2021, LNCS, pp. 185–203.
Found by the backfill search of 27 October 2026; abstract read (arXiv v1).
Czyzowicz2021GroupEvacuationconference
Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil Shende (2021). Group Evacuation on a Line by Agents with Different Communication Abilities. ISAAC 2021, LIPIcs 212, 57:1–57:24.
Czyzowicz2021NearMajorityconference
Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Grzegorz Stachowiak (2021). Search and evacuation with a near majority of faulty agents. SIAM Conference on Applied and Computational Discrete Algorithms (ACDA 2021).
Read: arXiv v1 (2026).
Czyzowicz2021TimeEnergyjournal
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil Shende (2021). Time-energy tradeoffs for evacuation by two robots in the wireless model. Theoretical Computer Science 852, 61-72.
First appeared in 2019. Read: arXiv v1 (2019).
Das2021Compactingjournal
Shantanu Das, Giuseppe Antonio Di Luna, Daniele Mazzei, Giuseppe Prencipe (2021). Compacting oblivious agents on dynamic rings. PeerJ Computer Science 7:e466.
Found by the backfill search of 27 October 2026; abstract read.
Das2021FiniteMemory preprint
Archak Das, Avisek Sharma, Buddhadeb Sau (2021). Power of Finite Memory and Finite Communication Robots under Asynchronous Scheduler. arXiv preprint.
Preprint, not peer reviewed.
Das2021Synchronizingconference
Deepanwita Das, Srabani Mukhopadhyaya, Mrityunjay Ghosh (2021). Synchronizing asynchronous mobile robots with limited visibility using lights. ICMAI 2021, Journal of Physics: Conference Series 1950:012015.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (open access, CC BY, downloaded through a browser on 29 October 2026). The paper names its authors D Das, S Mukhopadhyaya and Mrityunjay Ghosh; the first names are taken from the affiliations and e-mail address, as in Das & Mukhopadhyaya 2018.
Daymude2021Energyconference
Joshua J. Daymude, Andréa W. Richa, Jamison W. Weber (2021). Bio-Inspired Energy Distribution for Programmable Matter. ICDCN 2021, pp. 86–95.
First appeared in 2020. Read: arXiv v2 (2020).
Devillez2021Treeconference
Henri Devillez, Béni Egressy, Robin Fritsch, Roger Wattenhofer (2021). Two-Agent Tree Evacuation. SIROCCO 2021, LNCS, pp. 204–221.
Devismes2012Gridjournal
Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, Sébastien Tixeuil (2021). Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots. The Computer Journal 64(1):132–154.
First appeared in 2011. Read: arXiv v3 (2012).
DiLuna2021TuringMobilejournal
Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta (2021). TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications. Distributed Computing 35(2):105–122.
First appeared in 2017. Read: arXiv v2 (2018).
Found by the backfill search of 27 October 2026 and read (arXiv v2). Journal and DISC metadata from Crossref and DataCite.
Dufoulon2021Efficientconference
Fabien Dufoulon, Shay Kutten, William K. Moses Jr. (2021). Efficient Deterministic Leader Election for Programmable Matter. PODC 2021, pp. 103–113.
Read: arXiv v1 (2021).
Erlebach2021Temporaljournal
Thomas Erlebach, Michael Hoffmann, Frank Kammer (2021). On temporal graph exploration. Journal of Computer and System Sciences 119:1–18.
First appeared in 2015. Read: arXiv v3 (2021).
Georgiou2021Treasurejournal
Konstantinos Georgiou, George Karakostas, Evangelos Kranakis (2021). Treasure evacuation with one robot on a disk. Theoretical Computer Science 852:18–28.
First appeared in 2016.
Conference version at ALGOSENSORS 2016, doi:10.1007/978-3-319-53058-1_6.
Gotoh2021Dynamicjournal
Tsuyoshi Gotoh, Paola Flocchini, Toshimitsu Masuzawa, Nicola Santoro (2021). Exploration of dynamic networks: Tight bounds on the number of agents. Journal of Computer and System Sciences 122:1–18.
First appeared in 2019.
Heriban2021Unreliable preprint
Adam Heriban, Sébastien Tixeuil (2021). Unreliable Sensors for Reliable Efficient Robots. arXiv preprint.
Found by the backfill search of 27 October 2026 and read (arXiv v1). No published version in the manifest.
Ilcinkas2020Explorationjournal
David Ilcinkas, Ahmed M. Wade (2021). Exploration of Dynamic Cactuses with Sub-logarithmic Overhead. Theory of Computing Systems 65(2):257–273.
First appeared in 2020.
Found by the backfill search of 27 October 2026; abstract read.
Jawhar2021Bikejournal
Khaled Jawhar, Evangelos Kranakis (2021). Robot Evacuation on a Line Assisted by a Bike. Information 12(1):28.
Read: SOFSEM 2021.
Kamei2022Asynchronousconference
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada (2021). Asynchronous Gathering in a Torus. OPODIS 2021, LIPIcs 217, 9:1–9:17.
Found by the backfill search of 27 October 2026; abstract read.
Kant2021Fortconference
Kartikey Kant, Debasish Pattanayak, Partha Sarathi Mandal (2021). Fort Formation by an Automaton. COMSNETS 2021, pp. 540–547.
First appeared in 2020.
Found by the backfill search of 27 October 2026; abstract read.
Kupavskii2018Lowerjournal
Andrey Kupavskii, Emo Welzl (2021). Lower bounds for searching robots, some faulty. Distributed Computing 34(4):229–237.
First appeared in 2017. Read: arXiv v2 (2018).
Venue from the arXiv comment; DOI not checked.
Li2021Continuousjournal
Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan (2021). A continuous strategy for collisionless gathering. Theoretical Computer Science 852:41–60.
First appeared in 2017.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the TCS version, downloaded through a browser on 29 October 2026). The ALGOSENSORS 2017 version is named in the paper.
Molla2020WeakRingjournal
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr. (2021). Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots. Theoretical Computer Science 887:111–121.
First appeared in 2020. Read: arXiv v2 (2020).
Molla2021ByzantineGraphsconference
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr. (2021). Byzantine Dispersion on Graphs. IPDPS 2021.
Read: arXiv v2 (2021).
Nakai2021Asynchronousconference
Rikuo Nakai, Yuichi Sudo, Koichi Wada (2021). Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights. SSS 2021, LNCS, pp. 410–424.
Read: arXiv v2 (2021).
Nakamura2021Evacuationjournal
Junya Nakamura, Sayaka Kamei, Yukiko Yamauchi (2021). Evacuation from various types of finite two-dimensional square grid fields by a metamorphic robotic system. Concurrency and Computation: Practice and Experience 35(14):e6628.
First appeared in 2020. Read: arXiv v3 (2021).
Found by the backfill search of 27 October 2026 and read (arXiv v3). Journal and CANDAR metadata from Crossref (the journal article appeared online in 2021, in the 2023 volume).
Ozsoyeller2012Symmetricjournal
Deniz Ozsoyeller, Volkan Isler, Andrew Beveridge (2021). Symmetric Rendezvous in Planar Environments With and Without Obstacles. Proceedings of the AAAI Conference on Artificial Intelligence 26:2046–2052.
First appeared in 2012.
Found by the backfill search of 27 October 2026; abstract read.
Pattanayak2021Randomizedjournal
Debasish Pattanayak, John Augustine, Partha Sarathi Mandal (2021). Randomized gathering of asynchronous mobile robots. Theoretical Computer Science 858:64–80.
First appeared in 2019. Read: arXiv v1 (2019).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal metadata from Crossref.
Pattanayak2021Toleratingconference
Debasish Pattanayak, Gokarna Sharma, Partha Sarathi Mandal (2021). Dispersion of Mobile Robots Tolerating Faults. ICDCN 2021 Adjunct (WDALFR workshop).
Pelc2021Advicejournal
Andrzej Pelc, Ram Narayan Yadav (2021). Advice complexity of treasure hunt in geometric terrains. Information and Computation 281:104705.
First appeared in 2018. Read: arXiv v2.
Found by the backfill search of 27 October 2026 and read (arXiv v2). Journal metadata from Crossref.
Poudel2021FaultTolerantjournal
Pavan Poudel, Aisha Aljohani, Gokarna Sharma (2021). Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement. Theoretical Computer Science 850:116–134.
First appeared in 2018.
Poudel2021TimeOptimaljournal
Pavan Poudel, Gokarna Sharma (2021). Time-Optimal Gathering under Limited Visibility with One-Axis Agreement. Information 12(11):448.
First appeared in 2017.
QuattriniLi2021Searchingjournal
Alberto Quattrini Li, Francesco Amigoni, Nicola Basilico (2021). Searching for Optimal Off-Line Exploration Paths in Grid Environments for a Robot with Limited Visibility. Proceedings of the AAAI Conference on Artificial Intelligence 26(1):2060–2066.
Found by the backfill search of 27 October 2026; abstract read.
Rauch2021Chiralityconference
Arthur Rauch, Quentin Bramas, Stéphane Devismes, Pascal Lafourcade, Anissa Lamani (2021). Optimal exclusive perpetual grid exploration by luminous myopic robots without common chirality. NETYS 2021, LNCS, pp. 95–110.
Metadata from Crossref. Full text read. The two-robot impossibility (Theorem 1) is proved for visibility range 1 only, although the contributions state it for every finite range.
Sharma2021Constantjournal
Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan (2021). Constant-Time Complete Visibility for Robots with Lights: The Asynchronous Case. Algorithms 14(2):56.
First appeared in 2017.
Sharma2021Optimaljournal
Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan (2021). Optimal Randomized Complete Visibility on a Grid for Asynchronous Robots with Lights. International Journal of Networking and Computing 11(1):50–77.
First appeared in 2020.
Found by the backfill search of 27 October 2026; abstract read.
Stepkin2021Algorithmjournal
Andrey Viktorovich Stepkin, Alina Sergeevna Stepkina (2021). Algorithm of simple graph exploration by a collective of agents. Computer Research and Modeling 13(1):33–45.
Found by the backfill search of 27 October 2026; abstract read. In Russian; the Russian title reads 'Algorithm for recognising simple graphs by a collective of agents'.
Wade2021Explorationjournal
Ahmed Mouhamadou Wade (2021). Exploration with return of highly dynamic networks. International Journal of Advanced Research 9(10):315–319.
Found by the backfill search of 27 October 2026; abstract read.
Asahiro2022Monotonicjournal
Yuichi Asahiro, Ichiro Suzuki, Masafumi Yamashita (2022). Monotonic self-stabilization and its application to robust and adaptive pattern formation. Theoretical Computer Science 934:21–46.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (open access, downloaded through a browser on 29 October 2026): model, definitions and theorem statements; the proofs were not checked.
Bassil2022RePoStconference
Jad Bassil, Benoît Piranda, Abdallah Makhoul, Julien Bourgeois (2022). RePoSt: Distributed Self-Reconfiguration Algorithm for Modular Robots Based on Porous Structure. IROS 2022, IEEE, pp. 12651–12658.
Found by the backfill search of 27 October 2026; abstract read.
Bhagat2022Meetconference
Subhash Bhagat, Andrzej Pelc (2022). How to Meet at a Node of Any Connected Graph. DISC 2022, LIPIcs 246, 11:1–11:16.
Metadata from DataCite. Abstract, introduction and model read (open access). First synchronous rendezvous algorithm for locally finite, possibly infinite graphs; used for the rendezvous graph-size axis.
Bhagat2022Meetingjournal
Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya (2022). Gathering over Meeting Nodes in Infinite Grid. Fundamenta Informaticae 187(1):1–30.
First appeared in 2020.
Found by the backfill search of 27 October 2026 (the manifest filed it under Bhagat2022Optimal, a different paper: 'Optimal Gathering Over Weber Meeting Nodes in Infinite Grid', IJFCS 2022); abstract read (arXiv v3, the journal text).
Bhattacharya2022Treasureconference
Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal (2022). Treasure Hunt in Graph Using Pebbles. SSS 2022, LNCS, pp. 99–113.
Read: arXiv v1 (2022).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Bojko2022Dualconference
Dominik Bojko, Karol Gotfryd, Dariusz R. Kowalski, Dominik Pająk (2022). Tree Exploration in Dual-Memory Model. MFCS 2022 (LIPIcs 241), 22:1–22:16.
First appeared in 2021.
Metadata from DataCite and arXiv. Abstract and introduction read.
Bouchard2022Polynomialjournal
Sébastien Bouchard, Yoann Dieudonné, Anissa Lamani (2022). Byzantine gathering in polynomial time. Distributed Computing 35(3):235–263.
First appeared in 2018. Read: arXiv v1 (2018).
Bramas2022Beedroidsconference
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani (2022). Beedroids: how luminous autonomous swarms of UAVs can save the world?. FUN 2022 (LIPIcs 226), 7:1–7:21.
Metadata from DataCite. Abstract read.
Castenow2022Unifyingconference
Jannik Castenow, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide (2022). A unifying approach to efficient (near)-gathering of disoriented robots with limited visibility. OPODIS 2022 (LIPIcs 253), 15:1–15:25.
Read: arXiv v4 (2022).
Coleman2022Lineconference
Jared Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce (2022). Line Search for an Oblivious Moving Target. OPODIS 2022, LIPIcs 253, 12:1–12:19.
Search in geometric domains ›
Search for a moving target (introductory result in line-one-away-distance, line-one-away-none; current best in line-one-away-full, line-one-toward-full, line-one-toward-speed, line-one-toward-distance, line-one-toward-none; lower bound in line-one-away-full, line-one-toward-full, line-one-toward-speed, line-one-away-distance, line-one-toward-distance, line-one-away-none, line-one-toward-none) Found by the backfill search of 27 October 2026 and read in full (the LIPIcs version, 28 October 2026). Venue from DataCite.
Das2022Landmarkjournal
Archak Das, Kaustav Bose, Buddhadeb Sau (2022). Exploring a dynamic ring without landmark. Theoretical Computer Science 929:191–205.
First appeared in 2021. Read: arXiv v1 (2021).
Disser2022Spaceconference
Yann Disser, Max Klimm (2022). The Space Complexity of Undirected Graph Exploration. Lecture Notes in Computer Science , pp. 152–166.
Found by the backfill search of 27 October 2026; abstract read.
Doi2022Searchjournal
Keisuke Doi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (2022). Search by a metamorphic robotic system in a finite 2D square Grid. Information and Computation 285:104695.
First appeared in 2018. Read: arXiv v2 (2019), which carries the journal title.
Found by the backfill search of 27 October 2026 (keys Doi2018Exploration and Doi2022Search) and read (arXiv v2). Journal and SSS metadata from Crossref.
Eguchi2022Fastjournal
Ryota Eguchi, Naoki Kitamura, Taisuke Izumi (2022). Fast Neighborhood Rendezvous. IEICE Transactions on Information and Systems E105.D(3):597–610.
First appeared in 2020.
Found by the backfill search of 27 October 2026; abstract read.
Feldmann2022Coordinatingjournal
Michael Feldmann, Andreas Padalkin, Christian Scheideler, Shlomi Dolev (2022). Coordinating Amoebots via Reconfigurable Circuits. Journal of Computational Biology 29(4):317–343.
First appeared in 2021. Read: arXiv v1 (2021), titled "Accelerating Amoebots via Reconfigurable Circuits"; theorem numbers refer to it.
Found by the backfill search of 27 October 2026; the arXiv version was read (model, contributions, leader election). Journal and SSS metadata from Crossref; the SSS paper has five pages and is listed as a brief announcement by its length.
Georgiou2022Asymmetricconference
Konstantinos Georgiou, Nikos Giachoudis, Evangelos Kranakis (2022). Evacuation from a Disk for Robots with Asymmetric Communication. ISAAC 2022 (LIPIcs 248), 19:1–19:16.
Gorain2022Pebblejournal
Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit (2022). Pebble guided optimal treasure hunt in anonymous graphs. Theoretical Computer Science 922:61–80.
First appeared in 2021. Read: arXiv v1 (2021).
Hirose2022Weaklyjournal
Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue (2022). Weakly Byzantine Gathering with a Strong Team. IEICE Transactions on Information and Systems E105.D(3):541–555.
First appeared in 2020.
Found by the backfill search of 27 October 2026; abstract read.
Inoue2022Obliviousconference
Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (2022). Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. OPODIS 2022 (LIPIcs 253), 11:1–11:18.
Metadata from DataCite. Abstract read.
Izumi2022Deciding preprint
Taisuke Izumi, Kazuki Kakizawa, Yuya Kawabata, Naoki Kitamura, Toshimitsu Masuzawa (2022). Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices. arXiv preprint.
Found by the backfill search of 27 October 2026; read in full (arXiv v1, the only version), whose PDF is titled 'Deciding Graph Property by Single Mobile Agent: One-Bit Memory Suffices'. The paper says that a part of it was a brief announcement at PODC 2018: Kitamura, Kakizawa, Kawabata and Izumi, 'Graph Exploration Using Constant-Size Memory and Storage' (doi 10.1145/3212734.3212780), whose title covers only the depth-first search; that announcement was not seen.
Kedia2022Alignmentconference
Hridesh Kedia, Shunhao Oh, Dana Randall (2022). Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems. APPROX/RANDOM 2022, LIPIcs 245, 14.
Read: arXiv v2 (2022).
Kim2023Gatheringconference
Yonghwan Kim, Masahiro Shibata, Yuichi Sudo, Junya Nakamura, Yoshiaki Katayama, Toshimitsu Masuzawa (2022). Gathering of Mobile Robots with Defected Views. OPODIS 2022, LIPIcs 253, 14:1–14:18.
Found by the backfill search of 27 October 2026 and read (LIPIcs version). Metadata from DataCite; the proceedings appeared in 2023. arXiv 2208.08159 is titled as the brief announcement.
Kostitsyna2022Effectivebrief announcement
Irina Kostitsyna, Tom Peters, Bettina Speckmann (2022). Brief Announcement: An Effective Geometric Communication Structure for Programmable Matter. DISC 2022 (brief announcement), LIPIcs 246, 47:1–47:3.
Found by the backfill search of 27 October 2026; abstract read.
Kostitsyna2022FaultTolerantconference
Irina Kostitsyna, Christian Scheideler, Daniel Warner (2022). Fault-Tolerant Shape Formation in the Amoebot Model. DNA 28 (2022), LIPIcs 238, 9:1–9:22.
Other versions- SAND 2022 (brief announcement), LIPIcs 221, 23:1–23:3, as “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model” doi:10.4230/LIPIcs.SAND.2022.23
Found by the backfill search of 27 October 2026; abstract read.
Kshemkalyani2022GlobalJjournal
Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma (2022). Dispersion of mobile robots using global communication. Journal of Parallel and Distributed Computing 161:100–117.
Kundu2022Arbitrary preprint
Manash Kumar Kundu, Pritam Goswami, Satakshi Ghosh, Buddhadeb Sau (2022). Arbitrary pattern formation by asynchronous opaque robots on infinite grid. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read. Only the arXiv version (2205.03053) was found; the IJPEDS 2022 paper 'Arbitrary pattern formation by opaque fat robots on infinite grid' by the same group is a different paper.
Liu2022Squareconference
Luan Liu, Qi Wei, Yan Zhang, Jie Sun, Wenxin Zhang (2022). Online Algorithm for Evacuating Crashed Faulty Robots from A Square. 2022 IEEE 8th International Conference on Computer and Communications (ICCC), 2276-2280.
MoralesPonce2022Optimaljournal
Oscar Morales-Ponce (2022). Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots. Theoretical Computer Science 911:1–18.
First appeared in 2019. Read: arXiv v1 (2019).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal metadata from Crossref.
Nagahama2022Gridjournal
Shota Nagahama, Fukuhito Ooshita, Michiko Inoue (2022). Terminating grid exploration with myopic luminous robots. International Journal of Networking and Computing 12(1):73–102.
Mobile agents on graphs ›
Exploration by luminous robots (current best in grid-fsync-stop-chirality, grid-fsync-stop, grid-fsync-stop-chirality-phi2, grid-fsync-stop-phi2, grid-async-stop-chirality, grid-async-stop, grid-async-stop-chirality-phi2, grid-async-stop-phi2; other result in grid-fsync-stop-chirality, grid-fsync-stop, grid-fsync-stop-chirality-phi2, grid-fsync-stop-phi2, grid-async-stop-chirality-phi2, grid-async-stop-phi2; lower bound in grid-async-stop-chirality, grid-async-stop) First appeared in 2021.
Metadata from Crossref (workshop version doi 10.1109/IPDPSW52791.2021.00092). Checked against the full journal text: model, Table 1, Theorem 1 and the algorithm statements of Section 4.
Oh2022Foragingbrief announcement
Shunhao Oh, Dana Randall, Andréa W. Richa (2022). Brief Announcement: Foraging in Particle Systems via Self-Induced Phase Changes. DISC 2022 (brief announcement), LIPIcs 246, 51:1–51:3.
Read: arXiv v1 (2022), the full version, titled "Foraging in Particle Systems via Self-Induced Phase Changes".
Found by the backfill search of 27 October 2026 and read (the full version on arXiv). Metadata from DataCite. No peer-reviewed full version found in Crossref on 28 October 2026.
Ooshita2022Ringjournal
Fukuhito Ooshita, Sébastien Tixeuil (2022). Ring exploration with myopic luminous robots. Information and Computation 285:104702.
First appeared in 2018. Read: arXiv v1 (2018).
Metadata from Crossref (journal and SSS 2018 version, doi 10.1007/978-3-030-03232-6_20). Checked against the full text of the arXiv version (May 2018): model, Table 1, Theorems 3–18 and conclusion.
Rappel2022Exploration preprint
Ori Rappel, Joseph Ben-Asher, Alfred Bruckstein (2022). Exploration and Coverage with Swarms of Settling Agents. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Sardar2022Gridjournal
Madhumita Sardar, Deepanwita Das, Srabani Mukhopadhyaya (2022). Grid exploration by a swarm of autonomous robots with minimum repetitions. Theoretical Computer Science 933:67–87.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (the TCS version, downloaded through a browser on 29 October 2026): model, algorithms and their bounds.
Shibata2022Almostjournal
Masahiro Shibata, Yuichi Sudo, Junya Nakamura, Yonghwan Kim (2022). Almost uniform deployment of mobile agents in dynamic rings. Information and Computation 289:104949.
First appeared in 2020.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the journal version, downloaded through a browser on 29 October 2026).
Shibata2022Visibilityoptimaljournal
Masahiro Shibata, Masaki Ohyabu, Yuichi Sudo, Junya Nakamura, Yonghwan Kim, Yoshiaki Katayama (2022). Visibility-optimal gathering of seven autonomous mobile robots on triangular grids. International Journal of Networking and Computing 12(1):2–25.
First appeared in 2021.
Found by the backfill search of 27 October 2026; abstract read.
Shimoyama2022Cactusconference
Kohei Shimoyama, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (2022). One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles. SSS 2022 (invited paper), LNCS 13751, pp. 19–34.
Akitaya2023Reconfiguration preprint
Hugo A. Akitaya, Frederick Stock (2023). Reconfiguration of 3D Pivoting Modular Robots. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Alsaedi2022Fatconference
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen (2023). The Mutual Visibility Problem for Fat Robots. WADS 2023, LNCS 14079, pp. 15–28.
First appeared in 2022. Read: arXiv v3 (2026).
arXiv version 3 (2026) is titled "The Mutual Visibility Problem for Fat Robots with Lights".
Alsaedi2023Shortest preprint
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen (2023). Shortest Paths of Mutually Visible Robots. arXiv preprint.
Read: arXiv v2 (2025).
Found by the backfill search of 27 October 2026 and read (arXiv v2). No published version in the manifest.
Amir2023Patrolling preprint
Michael Amir, Dmitry Rabinovich, Alfred M. Bruckstein (2023). Patrolling Grids with a Bit of Memory. arXiv preprint.
Read: arXiv v2.
Found by the backfill search of 27 October 2026 and read (arXiv v2). No published version found in the manifest.
Arrighi2023Kernelizing preprint
Emmanuel Arrighi, Fedor V. Fomin, Petr Golovach, Petra Wolf (2023). Kernelizing Temporal Exploration Problems. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Asahiro2023Compatibilityconference
Yuichi Asahiro, Masafumi Yamashita (2023). Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract). SIROCCO 2023, LNCS, pp. 149–164.
Read: arXiv v7 (2023).
Found by the backfill search of 27 October 2026 and read (arXiv v7). Venue from Crossref.
Bansal2023Nearlyjournal
Nikhil Bansal, John Kuszmaul, William Kuszmaul (2023). A nearly tight lower bound for the d-dimensional cow-path problem. Information Processing Letters 182:106389.
First appeared in 2022. Read: arXiv v1 (2022).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal metadata from Crossref.
Bellitto2023Restlessconference
Thomas Bellitto, Cyril Conchon-Kerjan, Bruno Escoffier (2023). Restless Exploration of Periodic Temporal Graphs. SAND 2023, LIPIcs 257, 13:1–13:15.
Found by the backfill search of 27 October 2026; abstract read.
Bhattacharya2023Pebbleconference
Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal (2023). Pebble Guided Treasure Hunt in Plane. NETYS 2023, LNCS, pp. 141–156.
Read: arXiv v1 (2023).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Biswas2023Multiplebrief announcement
Mainak Biswas, Saif Rahaman, Moumita Mondal, Sruti Gan Chaudhuri (2023). Multiple Uniform Circle Formation by Fat Robots Under Limited Visibility. ICDCN 2023 (short paper), ACM, pp. 311–317.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the open ACM copy, downloaded through a browser on 29 October 2026). The manifest listed "Uniform Circle Formation by Swarm Robots Under Limited Visibility" (LNCS, 2019) as an earlier version; it is a different paper.
Bockenhauer2023Inportsconference
Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner (2023). Zero-Memory Graph Exploration with Unknown Inports. SIROCCO 2023, LNCS 13892, pp. 246–261.
Metadata from Crossref and arXiv. Checked against the full text (arXiv v1): model (Section 1.2), Theorems 1–9, 11 and the conclusion. Colour counts in this paper exclude the initial colour.
Bouchard2023Almostjournal
Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc (2023). Almost-optimal deterministic treasure hunt in unweighted graphs. ACM Transactions on Algorithms 19(3).
First appeared in 2020. Read: arXiv v5 (2021).
Bouchard2023Chatterjournal
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc (2023). Want to Gather? No Need to Chatter!. SIAM Journal on Computing 52(2):358–411.
First appeared in 2019. Read: arXiv v1 (2019).
Bramas2023Chiralityjournal
Quentin Bramas, Pascal Lafourcade, Stéphane Devismes (2023). Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality. Theoretical Computer Science 977:114162.
Mobile agents on graphs ›
Exploration by luminous robots (current best in grid-fsync-perpetual-chirality, grid-fsync-perpetual-chirality-phi2, grid-async-perpetual-chirality-phi2; other result in grid-fsync-perpetual-chirality-phi2; lower bound in grid-fsync-perpetual-chirality, grid-fsync-perpetual-chirality-phi2, grid-async-perpetual-chirality-phi2, grid-fsync-stop-chirality, grid-fsync-stop, grid-fsync-stop-chirality-phi2, grid-fsync-stop-phi2, grid-async-stop-chirality-phi2, grid-async-stop-phi2) First appeared in 2021.
Metadata from Crossref (ICDCN 2021 version doi 10.1145/3427796.3427834). Checked against the accepted manuscript on HAL: abstract, contribution, Table 1, model.
Bramas2023Indulgentjournal
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil (2023). Stand up indulgent gathering. Theoretical Computer Science 939:63–77.
First appeared in 2021. Read: arXiv v1 (2023).
Briones2023Asynchronousconference
Joseph L. Briones, Tishya Chhabra, Joshua J. Daymude, Andréa W. Richa (2023). Invited Paper: Asynchronous Deterministic Leader Election in Three-Dimensional Programmable Matter. ICDCN 2023, pp. 38–47.
First appeared in 2022. Read: arXiv v2 (2022).
Chand2023Coverconference
Prabhat Kumar Chand, Anisur Rahaman Molla, Sumathi Sivasubramaniam (2023). Run for Cover: Dominating Set via Mobile Agents. ALGOSENSORS 2023, pp. 133–150.
Read: arXiv v1 (2023).
Cicerone2023Arbitraryjournal
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra (2023). Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs. Theoretical Computer Science 942:1–20.
First appeared in 2020.
Found by the backfill search of 27 October 2026; abstract read.
Cicerone2023Mutualjournal
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra (2023). The geodesic mutual visibility problem: Oblivious robots on grids and trees. Pervasive and Mobile Computing 95:101842.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the open Elsevier copy, CC BY-NC-ND). The journal combines the trees paper of ICDCN 2023 and the grids paper of SSS 2023 Cicerone et al. 2023c.
Cicerone2023TimeOptimalconference
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra (2023). Time-Optimal Geodesic Mutual Visibility of Robots on Grids Within Minimum Area. SSS 2023, LNCS, pp. 385–399.
Read: arXiv v1 (2023).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Coleman2023Deliveryconference
Jared Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce (2023). Delivery to Safety with Two Cooperating Robots. Lecture Notes in Computer Science SOFSEM 2023: Theory and Practice of Computer Science, 359-371.
First appeared in 2022. Read: arXiv v2 (2022).
Coleman2023Snowbrief announcement
Jared Coleman, Oscar Morales-Ponce (2023). The Snow Plow Problem: Perpetual Maintenance by Mobile Agents on the Line. ICDCN 2023 (short paper), ACM, pp. 110–114.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the open ACM copy, CC BY).
Cosson2023BFDNconference
Romain Cosson, Laurent Massoulié, Laurent Viennot (2023). Efficient collaborative tree exploration with breadth-first depth-next. DISC 2023 (LIPIcs 281), paper 14.
Other versions- PODC 2023 brief announcement, pp. 24–27, as “Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next” doi:10.1145/3583668.3594568pdf
Read: arXiv v1 (2023).
Darwich2023Torusjournal
Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas, Anissa Lamani, Anaïs Durand, Pascal Lafourcade (2023). Perpetual torus exploration by myopic luminous robots. Theoretical Computer Science 976:114143.
First appeared in 2022.
Metadata from Crossref (SSS 2022 version doi 10.1007/978-3-031-21017-4_11, which covers only common chirality). Checked against the accepted manuscript on HAL: contribution, Tables 1–2, model.
Das2021MemoryOptimaljournal
Archak Das, Kaustav Bose, Buddhadeb Sau (2023). Memory Optimal Dispersion by Anonymous Mobile Robots. Discrete Applied Mathematics 340:171–182.
First appeared in 2020. Read: arXiv v2 (2020).
Daymude2023Canonicaljournal
Joshua J. Daymude, Andréa W. Richa, Christian Scheideler (2023). The canonical amoebot model: algorithms and concurrency control. Distributed Computing 36:159–192.
First appeared in 2021. Read: arXiv v2 (2022).
Defago2023ModelCheckingjournal
Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada (2023). Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space. Robotics and Autonomous Systems 163:104378.
First appeared in 2019. Read: arXiv v1 (2019).
Conference version at SRDS 2020, doi:10.1109/SRDS51746.2020.00019.
Dieudonne2023Almostjournal
Yoann Dieudonné, Andrzej Pelc, Franck Petit (2023). Almost Universal Anonymous Rendezvous in the Plane. Algorithmica 85(10):3110–3143.
First appeared in 2020.
Found by the backfill search of 27 October 2026; abstract read.
DiLuna2024Holeconference
Giuseppe A. Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro (2023). Black Hole Search in Dynamic Rings: The Scattered Case. OPODIS 2023, LIPIcs 286, 33:1–33:18.
Read: the OPODIS version and arXiv v4 (July 2026), titled "Black Hole Search by Scattered Agents in Dynamic Rings"; theorem numbers refer to arXiv v4.
Found by the backfill search of 27 October 2026; both versions read. Metadata from DataCite. The arXiv version calls the OPODIS paper its preliminary version; its v4 states the face-to-face impossibility for three agents only, where the OPODIS version states it for any constant number.
Dobrev2023Asynchronousjournal
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro (2023). Asynchronous Gathering in a Dangerous Ring. Algorithms 16(5):222.
Other versions- OPODIS 2003, pp. 34–46, as “Multiple agents rendezvous in a ring in spite of a black hole”
First appeared in 2003.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (open access, downloaded through a browser on 29 October 2026). The OPODIS 2003 version is named in the paper.
Feletti2023Logconference
Caterina Feletti, Carlo Mereghetti, Beatrice Palano (2023). \(O(\log n)\)-time uniform circle formation for asynchronous opaque luminous robots. OPODIS 2023 (LIPIcs 286), 5:1–5:21.
Feletti2023Schedulersjournal
Caterina Feletti, Carlo Mereghetti, Beatrice Palano (2023). Uniform circle formation for fully, semi-, and asynchronous opaque robots with lights. Applied Sciences 13(13):7991.
First appeared in 2022.
Conference version at ICTCS 2022 (CEUR Workshop Proceedings 3284, pp. 207–221).
Flocchini2023Asynchronyconference
Paola Flocchini, Nicola Santoro, Yuichi Sudo, Koichi Wada (2023). On Asynchrony, Memory, and Communication: Separations and Landscapes. OPODIS 2023, LIPIcs 286, 28:1–28:23.
Read: arXiv v2 (2023).
Georgiou2023Lpjournal
Konstantinos Georgiou, Sean Leizerovich, Jesse Lucier, Somnath Kundu (2023). Evacuating from \(\ell_p\) unit disks in the wireless model. Theoretical Computer Science 944:113675.
First appeared in 2021. Read: arXiv v1 (2021).
Conference version at ALGOSENSORS 2021, doi:10.1007/978-3-030-89240-1_6.
Georgiou2023OptimalCirclejournal
Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou (2023). Optimal circle search despite the presence of faulty robots. Information Processing Letters 182, 106391.
First appeared in 2019.
Georgiou2023WeightedLinejournal
Konstantinos Georgiou, Jesse Lucier (2023). Weighted group search on a line & implications to the priority evacuation problem. Theoretical Computer Science 939, 1-17.
First appeared in 2020.
Ghosh2022Movejournal
Satakshi Ghosh, Pritam Goswami, Avisek Sharma, Buddhadeb Sau (2023). Move optimal and time optimal arbitrary pattern formations by asynchronous robots on infinite grid. International Journal of Parallel, Emergent and Distributed Systems 38(1):35–57.
First appeared in 2022.
Found by the backfill search of 27 October 2026; abstract read.
Ghosh2023Obliviousconference
Satakshi Ghosh, Avisek Sharma, Pritam Goswami, Buddhadeb Sau (2023). Oblivious Robots Performing Different Tasks on Grid Without Knowing Their Team Members. ICARA 2023, pp. 180–186.
First appeared in 2022.
Found by the backfill search of 27 October 2026; abstract read.
Goswami2023Rendezvousbrief announcement
Pritam Goswami, Avisek Sharma, Satakshi Ghosh, Buddhadeb Sau (2023). Brief Announcement: Rendezvous on a Known Dynamic Point in a Finite Unoriented Grid. SSS 2023 (brief announcement), LNCS, pp. 374–379.
Found by the backfill search of 27 October 2026; abstract read.
Gupta2023Collectiveconference
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi (2023). Collective Graph Exploration Parameterized by Vertex Cover. IPEC 2023, LIPIcs 285, 22:1–22:18.
Found by the backfill search of 27 October 2026; abstract read.
Gupta2023Collision preprint
Siddharth Gupta, Marc van Kreveld, Othon Michail, Andreas Padalkin (2023). Collision Detection for Modular Robots -- it is easy to cause collisions and hard to avoid them. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Kaur2023Distance2Dispersionconference
Tanvir Kaur, Kaushik Mondal (2023). Distance-2-Dispersion: Dispersion with Further Constraints. NETYS 2023, LNCS, pp. 157–173.
Read: arXiv v1 (2023).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Kim2023Complete preprint
Yonghwan Kim, Yoshiaki Katayama, Koichi Wada (2023). Complete Visibility Algorithm for Autonomous Mobile Luminous Robots under an Asynchronous Scheduler on Grid Plane. arXiv preprint.
Other versions- Kim et al. 2025 Concurrency and Computation: Practice and Experience 37(2):e8323, 2025
Read: arXiv v1.
Found by the backfill search of 27 October 2026 and read (arXiv v1). No published version in the manifest.
Kostitsyna2023Fastconference
Irina Kostitsyna, Tom Peters, Bettina Speckmann (2023). Fast Reconfiguration for Programmable Matter. DISC 2023, LIPIcs 281, 27.
First appeared in 2022. Read: arXiv v4 (2026).
Leonardos2023Symmetricjournal
Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou (2023). Byzantine fault tolerant symmetric-persistent circle evacuation. Theoretical Computer Science 956:113839.
First appeared in 2021.
Conference version at ALGOSENSORS 2021, doi:10.1007/978-3-030-89240-1_8.
Mandal2023Livejournal
Subhrangsu Mandal, Anisur Rahaman Molla, William K. Moses Jr. (2023). Efficient live exploration of a dynamic ring with mobile robots. Theoretical Computer Science 980:114201.
First appeared in 2020. Read: arXiv v1 (2020).
Mironowicz2023Entangledjournal
P. Mironowicz (2023). Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks. New Journal of Physics 25(1):013023.
Found by the backfill search of 27 October 2026; introduction read (arXiv v1, 2022).
Molla2023Fastconference
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr. (2023). Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots. IPDPS 2023, pp. 47–57.
Nagahama2023Ringjournal
Shota Nagahama, Fukuhito Ooshita, Michiko Inoue (2023). Ring exploration of myopic luminous robots with visibility more than one. Information and Computation 292:105036.
First appeared in 2019.
Metadata from Crossref (SSS 2019 version: doi 10.1007/978-3-030-34992-9_20). Full text read (Information and Computation version).
Navarra2023Coatingconference
Alfredo Navarra, Francesco Piselli (2023). Silent Programmable Matter: Coating. OPODIS 2023, LIPIcs 286, 25:1.
Navarra2023Lineconference
Alfredo Navarra, Francesco Piselli (2023). Asynchronous Silent Programmable Matter: Line Formation. SSS 2023, LNCS, pp. 598–612.
Read: arXiv v1 (2023).
The brief announcement at DISC 2023 announces the same result (checked on 28 October 2026).
Nokhanji2023Dynamicjournal
Nooshin Nokhanji, Paola Flocchini, Nicola Santoro (2023). Dynamic Line Maintenance by Hybrid Programmable Matter. International Journal of Networking and Computing 13(1):18–47.
First appeared in 2022.
Found by the backfill search of 27 October 2026 and read (journal version). Metadata from Crossref.
Okumura2023Externaljournal
Takashi Okumura, Koichi Wada, Xavier Défago (2023). Optimal L-algorithms for rendezvous of asynchronous mobile robots with external-lights. Theoretical Computer Science 979:114198.
First appeared in 2018. Read: arXiv v1 (2018).
Conference version at OPODIS 2018, LIPIcs 125, 24:1–24:16, doi:10.4230/LIPIcs.OPODIS.2018.24.
Pattanayak2023Computing preprint
Debasish Pattanayak, Andrzej Pelc (2023). Computing Functions by Teams of Deterministic Finite Automata. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Pattanayak2023Spiteconference
Debasish Pattanayak, Gokarna Sharma, Partha Sarathi Mandal (2023). Dispersion of Mobile Robots in Spite of Faults. SSS 2023 (LNCS 14310).
Pramanick2023MISjournal
Subhajit Pramanick, Sai Vamshi Samala, Debasish Pattanayak, Partha Sarathi Mandal (2023). Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots. Theoretical Computer Science 978:114187.
First appeared in 2021.
Metadata from Crossref (ICDCIT version doi 10.1007/978-3-031-24848-1_1). Abstract read in the arXiv version.
Seike2023Separationconference
Hirokazu Seike, Yukiko Yamauchi (2023). Separation of Unconscious Colored Robots. SSS 2023, pp. 328–343.
Terai2023Gatheringjournal
Satoshi Terai, Koichi Wada, Yoshiaki Katayama (2023). Gathering problems for autonomous mobile robots with lights. Theoretical Computer Science 941:241–261.
First appeared in 2018. Read: arXiv v1 (2018).
Weber2023Energyconference
Jamison W. Weber, Tishya Chhabra, Andréa W. Richa, Joshua J. Daymude (2023). Energy-Constrained Programmable Matter Under Unfair Adversaries. OPODIS 2023, LIPIcs 286, 7:1–7:21.
Read: arXiv v2 (2023).
Badri2024Optimal preprint
Sahar Badri, Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano (2024). An optimal algorithm for geodesic mutual visibility on hexagonal grids. arXiv preprint.
Read: arXiv v2.
Found by the backfill search of 27 October 2026 and read (arXiv v2). No published version in the manifest.
Banerjee2024UnorientedGridsconference
Rik Banerjee, Manish Kumar, Anisur Rahaman Molla (2024). Optimizing Robot Dispersion on Unoriented Grids: With and Without Fault Tolerance. ALGOWIN 2024 (LNCS 15026).
Read: arXiv v1 (2024).
Bassil2024ASAPsjournal
Jad Bassil, Benoît Piranda, Abdallah Makhoul, Julien Bourgeois (2024). ASAPs: asynchronous hybrid self-reconfiguration algorithm for porous modular robotic structures. Autonomous Robots 48(7), article 16.
First appeared in 2023.
Found by the backfill search of 27 October 2026; abstract read.
Bhagat2024Deterministicjournal
Subhash Bhagat, Andrzej Pelc (2024). Deterministic rendezvous in infinite trees. Theoretical Computer Science 984:114313.
First appeared in 2022.
Found by the backfill search of 27 October 2026; read in full (arXiv v1, 2022); their \(D\) is \(d\) and their \(d\) is \(\Delta\) here.
Bhagat2024Fatconference
Subhash Bhagat, Paulomi Dey, Rajarshi Ray (2024). Collision-Free Linear Time Mutual Visibility for Asynchronous Fat Robots. ICDCN 2024, pp. 84–93.
Bhattacharya2024Blackconference
Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal (2024). Black Hole Search in Dynamic Cactus Graph. WALCOM 2024, LNCS, pp. 288–303.
First appeared in 2023. Read: arXiv v1 (2023).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Venue from Crossref.
Bhattacharya2024Holeconference
Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal (2024). Black Hole Search in Dynamic Tori. SAND 2024, LIPIcs 292, 6:1–6:16.
Read: arXiv v1 (2024).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Metadata from DataCite.
Bramas2024Standupjournal
Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil (2024). Stand-up indulgent gathering on lines. Theoretical Computer Science 1016:114796.
First appeared in 2023.
Found by the backfill search of 27 October 2026; abstract read.
Bramas2025CrashTolerantconference
Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil (2024). Crash-Tolerant Exploration of Trees by Energy-Sharing Mobile Agents. OPODIS 2024, LIPIcs 324, 9:1–9:16.
Other versions- SAND 2024 (brief announcement), LIPIcs 292, 25:1–25:5, as “Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents” doi:10.4230/LIPIcs.SAND.2024.25
- SSS 2023 (brief announcement), LNCS, pp. 380–384, as “Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile Agents” doi:10.1007/978-3-031-44274-2_28
First appeared in 2023.
Found by the backfill search of 27 October 2026 (the manifest named its SSS 2023 brief announcement); abstract of the OPODIS 2024 paper read.
Chakraborty2024MinMax preprint
Abhinav Chakraborty, Pritam Goswami, Satakshi Ghosh (2024). Min-Max Gathering on Infinite Grid. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract read.
Chen2024Improvedconference
Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing (2024). Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests. AAIM 2024, LNCS, pp. 99–110.
Read: the HAL version.
Found by the backfill search of 27 October 2026 and read (HAL version). Venue from Crossref.
Cosson2024Ariadne preprint
Romain Cosson (2024). Ariadne and Theseus: Exploration and Rendezvous with Two Mobile Agents in an Unknown Graph. arXiv preprint.
Found by the backfill search of 27 October 2026; abstract and main results read (arXiv v2).
Cosson2024Miningchapter
Romain Cosson (2024). Breaking the k/log k barrier in collective tree exploration via tree-mining. SODA 2024, pp. 4264–4282.
First appeared in 2023. Read: arXiv v2 (2023).
Cosson2024Potentialconference
Romain Cosson, Laurent Massoulié (2024). Collective tree exploration via potential function method. ITCS 2024 (LIPIcs), paper 35.
First appeared in 2023. Read: arXiv v1 (2023).
Das2024Visibilityconference
Archak Das, Satakshi Ghosh, Avisek Sharma, Pritam Goswami, Buddhadeb Sau (2024). The Computational Landscape of Autonomous Mobile Robots: The Visibility Perspective. ICDCIT 2024, LNCS, pp. 85–100.
First appeared in 2023. Read: arXiv v3 (2023).
Dobrev2024HighDimensionaljournal
Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov (2024). Exploration of High-Dimensional Grids by Finite State Machines. Algorithmica 86(5):1700–1729.
First appeared in 2019.
Found by the backfill search of 27 October 2026; abstract read.
Dogeas2024Exploitingconference
Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr. (2024). Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. ICALP 2024, LIPIcs 297, 55:1–55:18.
First appeared in 2023.
Found by the backfill search of 27 October 2026; abstract read.
Georgiou2024Disorientedjournal
Konstantinos Georgiou, Nikos Giachoudis, Evangelos Kranakis (2024). Overcoming probabilistic faults in disoriented linear search. Theoretical Computer Science 1014:114761.
First appeared in 2023.
Gerlach2025Symmetryconference
Raphael Gerlach, Sören von der Gracht, Christopher Hahn, Jonas Harbig, Peter Kling (2024). Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility. OPODIS 2024, LIPIcs 324, 13:1–13:28.
Read: arXiv v1 (2024).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Metadata from DataCite; the proceedings appeared in 2025.
Gorain2022Silentjournal
Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit (2024). Collaborative Dispersion by Silent Robots. Journal of Parallel and Distributed Computing 188:104852.
First appeared in 2022. Read: arXiv v1 (2022).
Goswami2024Circlejournal
Pritam Goswami, Manash Kumar Kundu, Satakshi Ghosh, Buddhadeb Sau (2024). Circle formation by asynchronous opaque fat robots on an infinite grid. International Journal of Parallel, Emergent and Distributed Systems 39(2):214–247.
First appeared in 2023. Read: arXiv v1 (2023).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal metadata from Crossref.
Goswami2025Perpetualconference
Pritam Goswami, Adri Bhattacharya, Raja Das, Partha Sarathi Mandal (2024). Perpetual Exploration of a Ring in Presence of Byzantine Black Hole. OPODIS 2024, LIPIcs 324, 17:1–17:17.
Read: arXiv v2 (2024).
Found by the backfill search of 27 October 2026 and read (arXiv v2). Metadata from DataCite; the proceedings appeared in 2025.
Gupta2024Toleranceconference
Arya Tanmay Gupta, Sandeep S. Kulkarni (2024). Tolerance to Asynchrony of an Algorithm for Gathering Myopic Robots on an Infinite Triangular Grid. EDCC 2024, IEEE, pp. 61–68.
First appeared in 2023. Read: arXiv v2.
Found by the backfill search of 27 October 2026 and read (arXiv v2). Venue from Crossref.
Hahn2024Largeconference
Christopher Hahn, Jonas Harbig, Peter Kling (2024). Forming large patterns with local robots in the OBLOT model. SAND 2024 (LIPIcs 292), 14:1–14:20.
Read: arXiv v2 (2024).
Hirose2024Fastjournal
Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue (2024). Fast gathering despite a linear number of weakly Byzantine agents†. Concurrency and Computation: Practice and Experience 36(14):e8055.
First appeared in 2022.
Found by the backfill search of 27 October 2026; abstract and Table 1 read; the theorems were not checked.
Kamei2024MISjournal
Sayaka Kamei, Sébastien Tixeuil (2024). An asynchronous maximum independent set algorithm by myopic luminous robots on grids. The Computer Journal 67(1):57–77 (advance access 2022).
First appeared in 2020.
Metadata from Crossref. Abstract read in the arXiv version.
Kirkpatrick2024Separatingjournal
David Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, Nicola Santoro (2024). On the power of bounded asynchrony: convergence by autonomous robots with limited visibility. Distributed Computing 37(3):279–308.
Other versions- PODC 2021, as “Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility” doi:10.1145/3465084.3467910
First appeared in 2021. Read: arXiv v1 (2021).
Kostitsyna2024Coating3Dconference
Irina Kostitsyna, David Liedtke, Christian Scheideler (2024). Universal Coating by 3D Hybrid Programmable Matter. SIROCCO 2024, LNCS, pp. 384–401.
First appeared in 2023. Read: arXiv v4 (2024).
Kranakis2024Surveyconference
Evangelos Kranakis (2024). Invited Paper: A Survey of the Impact of Knowledge on the Competitive Ratio in Linear Search. Stabilization, Safety, and Security of Distributed Systems, pp. 23-38.
Kshemkalyani2024AgentLEbrief announcement
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma (2024). Brief Announcement: Agent-Based Leader Election, MST, and Beyond. DISC 2024 brief announcement (LIPIcs 319), 50:1–50:7.
Read: arXiv v2 (2024).
Mondal2024Arbitraryjournal
Brati Mondal, Pritam Goswami, Avisek Sharma, Buddhadeb Sau (2024). Arbitrary pattern formation on a continuous circle by oblivious robot swarm. Theoretical Computer Science 1021:114882.
First appeared in 2023. Read: arXiv v2 (2023).
Found by the backfill search of 27 October 2026 and read (arXiv v2). Journal metadata from Crossref.
Mondal2024Circlebrief announcement
Moumita Mondal, Subodh Singh, Sruti Gan Chaudhuri (2024). K Circle Formation by Swarm Robots on a Grid. ICDCN 2024 (short paper), ACM, pp. 334–339.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the open ACM copy, downloaded through a browser on 29 October 2026).
Moses2024Shepherdconference
William K. Moses Jr., Amanda Redlich (2024). Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd. ICDCN 2024.
First appeared in 2023. Read: arXiv v1 (2023).
Nakajima2024Simulationsconference
Keita Nakajima, Kaito Takase, Koichi Wada (2024). Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots. SSS 2024, LNCS, pp. 141–155.
Read: arXiv v1 (2024).
Oh2024Bridgeconference
Shunhao Oh, Joseph L. Briones, Jacob Calvert, Noah Egan, Dana Randall, Andréa W. Richa (2024). Single Bridge Formation in Self-Organizing Particle Systems. DISC 2024, LIPIcs 319, 34.
Read: arXiv v2 (2024).
Ooshita2024Crashconference
Fukuhito Ooshita, Naoki Kitamura, Ryota Eguchi, Michiko Inoue, Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata, Yuichi Sudo (2024). Crash-tolerant perpetual exploration with myopic luminous robots on rings. OPODIS 2024 (LIPIcs 324), 12:1–12:16.
Metadata from DataCite. Checked against the full text (open access): abstract, contribution and Table 1.
Padalkin2024Structuraljournal
Andreas Padalkin, Christian Scheideler, Daniel Warner (2024). The structural power of reconfigurable circuits in the amoebot model. Natural Computing 23(4):603–625.
First appeared in 2022. Read: arXiv v1 (2022); theorem numbers refer to it.
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal and DNA metadata from Crossref and DataCite.
Pattanayak2024Memorylessjournal
Debasish Pattanayak, Andrzej Pelc (2024). Graph exploration by a deterministic memoryless automaton with pebbles. Discrete Applied Mathematics 356:149–160.
Pattanayak2024MISconference
Debasish Pattanayak, Subhash Bhagat, Sruti Gan Chaudhuri, Anisur Rahaman Molla (2024). Maximal Independent Set via Mobile Agents. ICDCN 2024, pp. 74–83.
Pattanayak2024TimeColorconference
Debasish Pattanayak, Gokarna Sharma (2024). Time-color tradeoff on uniform circle formation by asynchronous robots. IPDPS 2024, pp. 987–997.
Pattanayak2024Treasurejournal
Debasish Pattanayak, Andrzej Pelc (2024). Deterministic treasure hunt and rendezvous in arbitrary connected graphs. Information Processing Letters 185:106455.
First appeared in 2023. Read: arXiv v1 (2023).
Pramanick2024Distributedconference
Subhajit Pramanick, Saswata Jana, Adri Bhattacharya, Partha Sarathi Mandal (2024). Distributed Uniform Partitioning of a Region using Opaque ASYNC Luminous Mobile Robots. ICDCN 2024, ACM, pp. 55–64.
First appeared in 2023. Read: arXiv v2 (2024).
Found by the backfill search of 27 October 2026 and read (arXiv v2). Venue from Crossref.
Saxena2024Furtherjournal
Ashish Saxena, Kaushik Mondal (2024). A further study on weak Byzantine gathering of mobile agents. Theoretical Computer Science 1022:114892.
Read: the ICDCN 2024 version (open ACM copy); theorem numbers refer to it.
Found by the backfill search of 27 October 2026; the ICDCN version, downloaded through a browser on 29 October 2026, was read in full on 29 October 2026; the TCS version was not seen.
Stopkin2024Algorithmjournal
A. V. Stopkin (2024). Algorithm for exploration of a simple undirected graph by a collective of agents. Scientific Notes of Taurida National V. I. Vernadsky University, Series: Technical Sciences (2024, no. 5), pp. 303–309.
Found by the backfill search of 27 October 2026; abstract read. In Ukrainian; the original title translates as 'Algorithm for recognising simple undirected graphs by a collective of agents'.
vandenAkker2024Multiagentconference
Erik van den Akker, Kevin Buchin, Klaus-Tycho Foerster (2024). Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs. SIROCCO 2024, LNCS, pp. 513–519.
Found by the backfill search of 27 October 2026; abstract read.
Adamson2025Exploring preprint
Duncan Adamson (2025). Exploring Temporal Graphs with Frequent and Regular Edges. arXiv preprint.
Preprint (arXiv v1, 20 May 2025), not peer reviewed; Crossref lists two SSRN preprints of the same title (September and November 2025, not read) and no published version (checked 27 October 2026). Found by the backfill search of 27 October 2026; full text read (arXiv v1).
Adamson2025WordRepresentablebrief announcement
Duncan Adamson (2025). Exploring Word-Representable Temporal Graphs. SAND 2025 (brief announcement), LIPIcs 330, 22:1–22:6.
Read: arXiv v1 (2025), the full version; theorem numbers refer to it.
Found by the backfill search of 27 October 2026; full text of arXiv v1 read. The SAND 2025 brief announcement (DataCite records it as a version of the arXiv preprint) was found by an OpenAlex search on 28 October 2026 and is cited by the version policy; only its first page was checked.
Alsaedi2025Patternjournal
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen (2025). Pattern formation for fat robots with lights. Computational Geometry 128:102161.
First appeared in 2023. Read: arXiv v2 (2025).
Artmann2025Shapeconference
Matthias Artmann, Andreas Padalkin, Christian Scheideler (2025). On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. DISC 2025, LIPIcs 356, 7:1–7:22.
Read: arXiv v1 (2025).
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, January 2025); metadata of the DISC version from DataCite. Theorem numbers refer to arXiv v1.
Asahiro2025MASjournal
Yuichi Asahiro, Masafumi Yamashita (2025). Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots. Theoretical Computer Science 1051:115397.
Other versions- SSS 2023, as “Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract)” doi:10.1007/978-3-031-44274-2_23
First appeared in 2023. Read: arXiv v4 (2023).
Balev2026Shortest preprint
Stefan Balev, Éric Sanlaville, Antoine Toullalan (2025). The Shortest Temporal Exploration Problem. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, April 2025). No peer-reviewed version found in Crossref on 28 October 2026.
Banerjee2025OrientedGridsFTconference
Rik Banerjee, Manish Kumar, Anisur Rahaman Molla (2025). Optimal Fault-Tolerant Dispersion on Oriented Grids. ICDCN 2025.
First appeared in 2024. Read: arXiv v2 (2024).
Bastide2025Improved preprint
Paul Bastide, Carla Groenland, Lukas Michel, Clément Rambaud, Paulina Smolarova (2025). Improved exploration of temporal graphs. arXiv preprint.
Read: arXiv v2 (19 October 2026).
Found by the paper search of 11 November 2026; full text read (arXiv v2). Preprint, not peer reviewed; no published version on Crossref or DataCite (checked 11 November 2026). arXiv v1 (27 November 2025) has four authors (without Smolarova) and only the deterministic results; v2 merges it with the random spanning-tree results. Carnevale 2026 and Adamson & Spirakis 2026 cite v1; its Problem 3.1 is Problem 5.1 of v2.
Behrouz2025Byzantinejournal
Pourandokht Behrouz, Orestis Konstantinidis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou, Marianna Spyrakou (2025). Byzantine fault-tolerant protocols for (n,f)-evacuation from a circle. Theoretical Computer Science 1038:115185.
First appeared in 2023.
Conference version at ALGOWIN 2023, doi:10.1007/978-3-031-48882-5_7.
Bhagat2025Deterministicconference
Subhash Bhagat, Andrzej Pelc (2025). Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. ICDCN 2025, ACM, pp. 115–124.
First appeared in 2024. Read: arXiv v1 (2024).
Found by the backfill search of 27 October 2026 and read in full (arXiv v1). Venue from Crossref. Papin 2026 reports a collision in its stopping procedure; not checked.
Bhattacharya2025Perpetualconference
Adri Bhattacharya, Pritam Goswami, Evangelos Bampas, Partha Sarathi Mandal (2025). Perpetual Exploration in Anonymous Synchronous Networks with a Byzantine Black Hole. DISC 2025, LIPIcs 356, 16:1–16:17.
Read: arXiv v1 (2025), with the appendices.
Found by the backfill search of 27 October 2026; arXiv v1 read in full; venue from DataCite. Not a version of the OPODIS 2024 ring paper of Goswami, Bhattacharya, Das and Mandal (Perpetual Exploration of a Ring in Presence of Byzantine Black Hole, LIPIcs 324, 17:1–17:17), which it cites and extends to trees and arbitrary graphs.
Borowiecki2025Discretejournal
Piotr Borowiecki, Shantanu Das, Dariusz Dereniowski, Łukasz Kuszner (2025). Discrete evacuation in graphs with multiple exits. Theoretical Computer Science 1035, pp. 115141.
First appeared in 2016.
Bramas2020Polelessjournal
Quentin Bramas, Pascal Lafourcade, Stéphane Devismes (2025). Infinite grid exploration with synchronous myopic robots without chirality. Discrete Applied Mathematics 375:193–214.
First appeared in 2021.
Metadata from DataCite and Crossref (FUN 2020 was held in 2021). Abstracts of both versions read; the journal version adds a five-robot algorithm.
Bramas2025TradeOffconference
Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, Sébastien Tixeuil (2025). A visibility vs. memory trade-off for stand-up indulgent gathering on lines. SIROCCO 2025, LNCS, pp. 159–175.
Metadata from Crossref. Abstract read.
Buchin2022Energyjournal
Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro, Koichi Wada (2025). On the computational power of energy-constrained mobile robots. Information and Computation 303:105280.
Other versions- SIROCCO 2022, LNCS 13298, pp. 42–61, as “On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis” doi:10.1007/978-3-031-09993-9_3
First appeared in 2022. Read: arXiv v1 (2022).
Chakraborty2025Parkingjournal
Abhinav Chakraborty, Krishnendu Mukhopadhyaya (2025). Parking problem by oblivious mobile robots in infinite grids. Theoretical Computer Science 1023:114953.
First appeared in 2023. Read: arXiv v1 (2023).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal metadata from Crossref.
Chalopin2025SelfStabjournal
Jérémie Chalopin, Shantanu Das, Maria Kokkou (2025). Deterministic self-stabilising leader election for programmable matter with constant memory. Distributed Computing.
First appeared in 2024. Read: arXiv v2 (2025).
Chand2023FaultTolerantjournal
Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam (2025). Fault-Tolerant Dispersion of Mobile Robots. Discrete Applied Mathematics 377:299–313.
First appeared in 2022. Read: arXiv v1 (2022).
Chand2025Butterflybrief announcement
Prabhat Kumar Chand, Apurba Das, Anisur Rahaman Molla (2025). Brief Announcement: Distributed Butterfly Analysis using Mobile Agents. SPAA 2025 brief announcement, pp. 623–627.
Read: arXiv v1 (2025).
Chand2025Treesconference
Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla (2025). Computing Tree Structures in Anonymous Graphs via Mobile Agents. SSS 2025, pp. 111–127.
Read: arXiv v1 (2025).
Cicerone2024Mutualjournal
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli (2025). Mutual and total mutual visibility in hypercube-like graphs. Applied Mathematics and Computation 491:129216.
First appeared in 2023. Read: arXiv v1 (2023), and the journal version (2025).
Found by the backfill search of 27 October 2026; read (arXiv v1). The journal version, downloaded through a browser on 29 October 2026, was read on 29 October 2026; it adds Fibonacci cubes.
Cicerone2025Gathering preprint
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra (2025). Gathering in Vertex- and Edge-Transitive Graphs without Multiplicity Detection under Round Robin. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, November 2025). Preprint, not peer reviewed; no published version found on Crossref. Not a version of Cicerone et al. 2025d (other graph classes, other results) nor of D'Angelo et al. on grids and trees (TCS 2016), which it cites.
Cicerone2025Impactbrief announcement
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra (2025). Brief Announcement: On the Impact of Unlimited Computational Power in OBLOT: Consequences for Synchronous Robots on Graphs. SSS 2025 (brief announcement), LNCS 16350, pp. 146–152.
Read: arXiv v1 (2025), the full version (18 pages).
Found by the backfill search of 27 October 2026; the arXiv full version was read in full. The brief announcement (Crossref, LNCS, SSS 2025) is the only peer-reviewed version found, so it is cited; its theorem numbering was not checked and the theorem numbers given refer to arXiv v1. The arXiv title is 'On the impact of unlimited computational power in OBLOT: consequences for synchronous robots on graphs'.
Cicerone2025Optimaljournal
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra (2025). Optimal gathering of robots in anonymous butterfly networks via leader election. Theoretical Computer Science 1057:115553.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the publisher version, downloaded through a browser on 29 October 2026 from the repository of the University of L'Aquila).
Coleman2025Linearconference
Jared Coleman, Oscar Morales-Ponce (2025). Linear Search with Probabilistic Detection and Variable Speeds. IWOCA 2025, LNCS, pp. 433–445.
Read: arXiv v1 (2025), the full version.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, which calls itself the full version of the IWOCA 2025 paper). Venue and pages from Crossref.
Conley2025Inspectionconference
James Conley, Konstantinos Georgiou (2025). Multi-agent Disk Inspection. Lecture Notes in Computer Science Structural Information and Communication Complexity, 262-280.
First appeared in 2024. Read: arXiv v4 (2025).
Cosson2025Asynchronous preprint
Romain Cosson, Laurent Massoulié (2025). Asynchronous collective tree exploration: a distributed algorithm, and a new lower bound. arXiv preprint.
No peer-reviewed version found.
Das2025Collisionfreejournal
Sajal K. Das, Amit Kumar Dhar, Barun Gorain, Madhuri Mahawar (2025). Collision-free exploration by mobile agents using pebbles. Information and Computation 307:105380.
First appeared in 2024. Read: arXiv v1 (2024); theorem numbers refer to it.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1). Journal and ICDCN metadata from Crossref.
Das2025MISGridjournal
Raja Das, Avisek Sharma, Buddhadeb Sau (2025). Maximum independent set formation on a finite grid by myopic robots. Theoretical Computer Science 1031:115077.
First appeared in 2022.
Metadata from Crossref (conference version doi 10.1007/978-3-031-37963-5_86). Abstract read in the arXiv version.
Das2025Triangularconference
Raja Das, Pritam Goswami, Brati Mondal, Buddhadeb Sau (2025). Rectangle enclosed triangular grid exploration with myopic luminous robots. ICDCN 2025, pp. 249–253.
Metadata from Crossref. Full text read (short paper; proofs sketched).
DiLuna2025Byzantineconference
Giuseppe Antonio Di Luna, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, Francesco Piselli, Nicola Santoro (2025). Exploring Dangerous Graphs with Byzantine Companions. ICDCS 2025, pp. 352–361.
DiLuna2025DynamicBHSjournal
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro (2025). Locating a black hole in a dynamic ring. Journal of Parallel and Distributed Computing 196:104998.
First appeared in 2020. Read: arXiv v2 (2020).
DiLuna2025Gatheringjournal
Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi (2025). Gathering on a circle with limited visibility by anonymous oblivious robots. Theoretical Computer Science 1025:114974.
First appeared in 2020. Read: arXiv v3 (2024); theorem numbers refer to it.
Found by the backfill search of 27 October 2026 and read (arXiv v3). Journal and DISC metadata from Crossref and DataCite.
Feletti2025Transparencyjournal
Caterina Feletti, Lucia Mambretti, Carlo Mereghetti, Beatrice Palano (2025). Computational power of autonomous robots: Transparency vs. opaqueness. Theoretical Computer Science 1036:115153.
First appeared in 2024.
Flocchini2025Separationjournal
Paola Flocchini, Debasish Pattanayak, Francesco Piselli, Nicola Santoro, Yukiko Yamauchi (2025). Asynchronous Separation of Unconscious Colored Robots. International Journal of Networking and Computing 15(2):199–219.
First appeared in 2024. Read: the CANDAR Workshops 2024 version.
Gao2025Sniffingjournal
Younan Gao, Andrzej Pelc (2025). Sniffing helps to meet: Deterministic rendezvous of anonymous agents in the grid. Theoretical Computer Science 1050:115395.
First appeared in 2024.
Found by the backfill search of 27 October 2026; abstract read.
Gaur2025Robust preprint
Gaurav Gaur, Barun Gorain, Rishi Ranjan Singh, Daya Gaur (2025). Robust Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v2, September 2026). No published version found.
Gehnen2025Graph preprint
Matthias Gehnen, Ralf Klasing, Émile Naquin (2025). Graph Exploration with Edge Weight Estimates. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, 30 January 2025). Baligács et al. 2026b cites a version in the proceedings of LATIN 2026 (its reference [GKN26]); no DOI for it was found in Crossref on 27 October 2026, so it is not listed and was not read.
Georgiou2025Fagnanojournal
Konstantinos Georgiou, Somnath Kundu, Paweł Prałat (2025). The Fagnano Triangle Patrolling Problem. Discrete Mathematics & Theoretical Computer Science 27(3), article 13421.
Other versions- SSS 2023, LNCS, pp. 157–171, as “The Fagnano Triangle Patrolling Problem (extended abstract)”
First appeared in 2023. Read: arXiv v6 (2025), the accepted journal version.
Found by the backfill search of 27 October 2026 and read (arXiv v6). Journal metadata from Crossref; the SSS 2023 extended abstract is cited in the paper's bibliography, its DOI was not looked up.
Georgiou2025Polygonsconference
Konstantinos Georgiou, Caleb Jones, Jesse Lucier (2025). Multi-agent Search-Type Problems on Polygons. SOFSEM 2025, LNCS, pp. 314–332.
First appeared in 2024.
Georgiou2025Spirals preprint
Konstantinos Georgiou, Caleb Jones, Matthew Madej (2025). Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents. arXiv preprint.
Preprint, not peer reviewed.
Georgiou2025WeightedDiskjournal
Konstantinos Georgiou, Xin Wang (2025). Weighted group search on the disk & improved lower bounds for priority evacuation. Journal of Computer and System Sciences 154:103678.
Other versions- IWOCA 2024, LNCS, pp. 28–42, as “Weighted Group Search on the Disk and Improved LP-Based Lower Bounds for Priority Evacuation” doi:10.1007/978-3-031-63021-7_3
First appeared in 2024. Read: arXiv v1 (2024).
Conference version at IWOCA 2024, doi:10.1007/978-3-031-63021-7_3.
Ghosh2025Asynchronousjournal
Satakshi Ghosh, Avisek Sharma, Pritam Goswami, Buddhadeb Sau (2025). Asynchronous Gathering of Finite Memory Robots on a Circle under Limited Visibility. International Journal of Foundations of Computer Science 37(7):941–965.
First appeared in 2023. Read: arXiv v1 (2023).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal metadata from Crossref.
Goswami2025Timejournal
Pritam Goswami, Avisek Sharma, Satakshi Ghosh, Buddhadeb Sau (2025). Time optimal gathering of myopic robots on an infinite triangular grid. Theoretical Computer Science 1023:114930.
First appeared in 2022. Read: arXiv v4 (2022).
Found by the backfill search of 27 October 2026 and read (arXiv v4). Journal metadata from Crossref.
Hinnenthal2024Shape3Djournal
Kristian Hinnenthal, David Liedtke, Christian Scheideler (2025). Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. Theoretical Computer Science 1057:115552.
First appeared in 2024. Read: arXiv v3 (2024).
Hirose2025SelfStabilizingconference
Jion Hirose, Ryota Eguchi, Yuichi Sudo (2025). Self-Stabilizing Weakly Byzantine Perpetual Gathering of Mobile Agents. SAND 2025, LIPIcs 330, 13:1–13:18.
Read: arXiv v1 (April 2025).
Found by the backfill search of 27 October 2026 and read in full in the arXiv version (v1); the LIPIcs version was not read. Metadata from DataCite.
Italiano2022Directedjournal
Giuseppe F. Italiano, Debasish Pattanayak, Gokarna Sharma (2025). Dispersion of Mobile Robots on Directed Anonymous Graphs. Journal of Parallel and Distributed Computing 204:105139.
First appeared in 2022.
Journal version: Journal of Parallel and Distributed Computing 204:105139 (2025), doi:10.1016/j.jpdc.2025.105139, open access; it adds the deficiency-based algorithm and the lower bounds.
Jana2025Graphconference
Saswata Jana, Giuseppe F. Italiano, Partha Sarathi Mandal (2025). Graph Traversal via Connected Mobile Agents. ALGOWIN 2025, LNCS, pp. 119–134.
Read: arXiv v1 (2025).
Found by the backfill search of 27 October 2026 and read in full (arXiv v1). Venue and pages from Crossref; the LNCS volume number is not in Crossref.
Jana2025TimeOptimalconference
Saswata Jana, Subhajit Pramanick, Adri Bhattacharya, Partha Sarathi Mandal (2025). Time-Optimal Asynchronous Minimal Vertex Covering by Myopic Robots on Graph. ALGOWIN 2025, LNCS, pp. 135–150.
Read: arXiv v1 (2025).
Found by the backfill search of 27 October 2026 and read in full; venue and pages from Crossref (Algorithmics of Wireless Networks, LNCS; the volume number is not in the Crossref record).
Jawhar2025Asymmetricjournal
Khaled Jawhar, Evangelos Kranakis (2025). Bike-assisted evacuation of robots on a line with asymmetric S/R communication. Theoretical Computer Science 1053:115438.
First appeared in 2023.
Jawhar2025Linearconference
Khaled Jawhar, Evangelos Kranakis (2025). Linear Search for Capturing an Oblivious Mobile Target in the Sender/Receiver Model. ALGOWIN 2025, LNCS, pp. 151–165.
Read: arXiv v1 (2025), the full version.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, which calls the ALGOWIN 2025 paper its preliminary version). Venue and pages from Crossref; the volume number of the LNCS proceedings is not in Crossref.
Kamei2025Ringsjournal
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada (2025). Gathering on rings for myopic asynchronous robots with lights. Theory of Computing Systems 69(1):8.
First appeared in 2019.
Metadata from Crossref and DataCite (OPODIS version doi 10.4230/LIPIcs.OPODIS.2019.27). Abstract of the OPODIS version read.
Kaur2025Scatteredconference
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal, Kaushik Mondal (2025). Black Hole Search by Scattered Agents on Time-Varying Dynamic Graphs. SSS 2025, LNCS 16350, pp. 309–324.
Kim2024Completejournal
Yonghwan Kim, Yoshiaki Katayama, Koichi Wada (2025). Complete Visibility Algorithms of Luminous Robots With Two-Color Lights on Grid. Concurrency and Computation: Practice and Experience 37(2):e8323.
Other versions- PDAA 2023 (15th International Workshop on Parallel and Distributed Algorithms and Applications), as “Asynchronous Complete Visibility Algorithm for Luminous Robots on Grid”
- Kim et al. 2023 arXiv preprint, 2023
First appeared in 2023.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the open Wiley copy). Kept apart from Kim et al. 2023 because it states a weaker time bound: \(O(\Delta_0 + n^2)\) asynchronous rounds, where the arXiv version states \(O(\Delta_0 + n)\).
Kitamura2025TwoRobot preprint
Naoki Kitamura, Yuichi Sudo, Koichi Wada (2025). Two-Robot Computational Landscape: A Complete Characterization of Model Power in Minimal Mobile Robot Systems. arXiv preprint.
Preprint, not peer reviewed.
Kshemkalyani2021NearOptimaljournal
Ajay D. Kshemkalyani, Gokarna Sharma (2025). Near-Optimal Dispersion on Arbitrary Anonymous Graphs. Journal of Computer and System Sciences 152:103656.
First appeared in 2021. Read: arXiv v1 (2021).
Kshemkalyani2025Agentic preprint
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma (2025). Agentic Distributed Computing. arXiv preprint.
First appeared in 2024.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, July 2025). Its results for \(k = n\) appeared as the DISC 2024 brief announcement Kshemkalyani et al. 2024 (same bounds); the results for \(k < n\) are new here. A Crossref title search on 28 October 2026 found no published version.
Kshemkalyani2025Almostconference
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Debasish Pattanayak, Gokarna Sharma (2025). Dispersion is (Almost) Optimal under (A)synchrony. SPAA 2025.
Read: arXiv v1 (2025).
Kshemkalyani2025AsyncTCSjournal
Ajay D. Kshemkalyani (2025). Dispersion of mobile robots on graphs in the asynchronous model. Theoretical Computer Science 1044:115272.
Journal treatment (submitted 2019) of the asynchronous algorithms of Kshemkalyani & Ali 2019; no knowledge of \(n, m, D, \Delta, k\) needed.
Kshemkalyani2025NearLinearconference
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma (2025). Near-Linear Time Leader Election in Multiagent Networks. AAMAS 2025, pp. 1218–1226.
Miller2025Fastjournal
Avery Miller, Andrzej Pelc (2025). Fast deterministic rendezvous in labeled lines. Distributed Computing 38(4):435–489.
First appeared in 2023. Read: arXiv v1 (2023), the full version; theorem numbers refer to it.
Found by the backfill search of 27 October 2026 and read in full. Journal metadata from Crossref, DISC metadata from DataCite. The backfill list also linked a PODC 2014 brief announcement and arXiv 1402.2552 to it; those are a different paper (Laurinharju and Suomela).
Mondal2025DkDDynamicRingconference
Brati Mondal, Pritam Goswami, Buddhadeb Sau (2025). Time Optimal Distance-k-Dispersion on Dynamic Ring. ICDCN 2025.
First appeared in 2024. Read: arXiv v1 (2024).
Distance-\(k\)-dispersion with \(k = 1\) is dispersion.
Mondal2025SimulatingChirality preprint
Brati Mondal, Pritam Goswami, Buddhadeb Sau (2025). Simulating Chirality: Solving Distance-k-Dispersion on an 1-Interval Connected Ring. arXiv preprint.
Moses2025Broadcastbrief announcement
William K. Moses Jr., Amanda Redlich, Frederick Stock (2025). Brief Announcement: Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents. SAND 2025 (brief announcement), LIPIcs 330, 17:1–17:5.
Other versions- SSRN preprint, 2026, as “Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents” doi:10.2139/ssrn.6411400
Read: arXiv v2 (2026), the full version; theorem numbers refer to it.
Found by the backfill search of 27 October 2026 and read in full (the full arXiv version, not the five-page brief announcement, which was not read). Venue from DataCite; the SSRN preprint was found by a Crossref title search and not read.
Naito2025Beyondconference
Shota Naito, Tsukasa Ninomiya, Koichi Wada (2025). Beyond Pairwise Comparisons: Unveiling Structural Landscape of Mobile Robot Models. SSS 2025, LNCS, pp. 408–424.
Read: arXiv v3 (2025).
Navarra2025Obliviousconference
Alfredo Navarra, Francesco Piselli (2025). Oblivious Robots Under Round Robin: Gathering on Rings. IJTCS-FAW 2025, LNCS, pp. 166–180.
Read: arXiv v2 (February 2025).
Found by the backfill search of 27 October 2026 and read in full in the arXiv version (v2); the LNCS version was not read. Metadata from Crossref (book series Frontiers of Algorithmics, LNCS, pp. 166–180, online 30 June 2025, no volume given); the meeting name IJTCS-FAW 2025 is from the reference lists of Cicerone et al. 2025b and Cicerone et al. 2025d.
Navarra2025Scatteringjournal
Alfredo Navarra, Francesco Piselli, Giuseppe Prencipe (2025). Line formation and scattering in silent programmable matter. Journal of Parallel and Distributed Computing 204:105129.
First appeared in 2023.
Ooshita2025Colorsconference
Fukuhito Ooshita, Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata (2025). Crash-tolerant perpetual exploration of myopic luminous robots with fewer colors on rings. CANDAR Workshops 2025, pp. 166–172.
Metadata from Crossref. Abstract and Table I read, proofs not checked.
Padalkin2025Jointjournal
Andreas Padalkin, Manish Kumar, Christian Scheideler (2025). Reconfiguration and locomotion with joint movements in the amoebot model. Autonomous Robots 49.
First appeared in 2023. Read: arXiv v3 (2025).
Pramanick2025Mobility preprint
Subhajit Pramanick, Saswata Jana, Partha Sarathi Mandal, Gokarna Sharma (2025). Asynchronous Gathering of Opaque Robots with Mobility Faults. arXiv preprint.
Preprint, not peer reviewed.
Saxena2025PathConnectedjournal
Ashish Saxena, Kaushik Mondal (2025). Path connected dynamic graphs with a study of dispersion and exploration. Theoretical Computer Science 1050:115390.
Read: arXiv v1 (2025).
Sharma2025Discreteconference
Avisek Sharma, Pritam Goswami, Buddhadeb Sau (2025). Computational Power of Mobile Robots: Discrete Version. ICDCN 2025, pp. 231–238.
First appeared in 2024. Read: arXiv v4 (2024).
Sharma2025Gatheringconference
Avisek Sharma, Satakshi Ghosh, Buddhadeb Sau (2025). Gathering of Asynchronous Robots on Circle with Limited Visibility Using Finite Communication. SSS 2025, LNCS, pp. 442–457.
Found by the backfill search of 27 October 2026; abstract read.
Stopkin2025Explorationjournal
A. V. Stopkin (2025). Exploration of simple graphs by a collective of agents. Mathematical Modeling and Computing 12(2):603–610.
Found by the backfill search of 27 October 2026; abstract read.
Stopkin2025Finitejournal
A. V. Stopkin (2025). Finite graph exploration by a mobile agent. Mathematical Modeling and Computing 12(1):75–82.
Found by the backfill search of 27 October 2026; abstract read (journal version, open access).
Stopkin2025Simplejournal
A. V. Stopkin (2025). Simple graphs exploration by a collective of agents. Scientific Notes of Taurida National V. I. Vernadsky University, Series: Technical Sciences 36(75), no. 1:232–238.
Found by the backfill search of 27 October 2026 and read in full; written in Ukrainian (title: Розпізнавання простих графів колективом агентів). English title from Crossref; volume, issue and pages as printed on the paper.
Takahashi2025Recolorableconference
Shota Takahashi, Haruki Kanaya, Shoma Hiraoka, Ryota Eguchi, Yuichi Sudo (2025). Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors. OPODIS 2025 (LIPIcs 361), 32:1–32:15.
Metadata from DataCite and arXiv. Checked against the full text of arXiv v2 (September 2026): model (Section 2), Theorems 1–3, Note 1 and the conclusion. The LIPIcs abstract states the six-colour and φ-free five-colour results; the triangle-free five-colour result and Note 1 are in arXiv v2.
Adamson2026Explorationbrief announcement
Duncan Adamson, Paul G. Spirakis (2026). Brief Announcement: Exploration of Always S-Connected Temporal Graphs. SAND 2026 (brief announcement), LIPIcs 373, 20:1–20:6.
Read: arXiv v2 (2026), the full version, titled "Exploration of Always \(S\)-Connected Temporal Graphs".
Brief announcement (metadata from DataCite, which records it as a version of arXiv:2602.19657; not read). The full version exists only as a preprint (arXiv v1 February 2026, v2 23 October 2026), so the brief announcement is cited; theorem numbers refer to arXiv v2. Carnevale 2026 cites the brief announcement with a \(\mathrm{tw}^{11/2}\) factor where arXiv v2 states \(\mathrm{tw}^{9/2}\). The pdf link follows the DROPS pattern and was not opened. Found by the backfill search of 27 October 2026; full text of arXiv v2 read.
Altisen2026Synthesizingconference
Karine Altisen, Anaïs Durand, Pascal Lafourcade, Oussama Nahnah (2026). Synthesizing Algorithms to Avoid an Obstacle with a Swarm of Robots. ICDCS 2026, IEEE, pp. 556–566.
Read: HAL hal-05680038v1.
Found by the backfill search of 27 October 2026 and read in full (the HAL copy). Metadata from Crossref.
Ayoubi2026Online preprint
Kamran Ayoubi, Bernard Mans, Lata Narayanan (2026). Online Treasure Hunt in Vertex-Permuted Dynamic Rings. arXiv preprint.
Preprint (v1, 10 September 2026), not peer reviewed. Found by the backfill search of 27 October 2026; metadata from DataCite (10.48550/arXiv.2609.11013) and the PDF; full text (v1) read in full.
Baaziz2026Asynchronousconference
Mohamed Anouar Baaziz, Andrzej Pelc (2026). Asynchronous Rendezvous of Anonymous Deterministic Mobile Automata in the Plane. SAND 2026, LIPIcs 373, 8:1–8:14.
Found by the backfill search of 27 October 2026; metadata from DataCite and the PDF's first page; LIPIcs version (open access) read in full. No arXiv version found.
Baaziz2026Explorationjournal
Mohamed Anouar Baaziz, Andrzej Pelc (2026). Exploration of convex terrains by a deterministic automaton with pebbles. Theoretical Computer Science 1070:115844.
First appeared in 2025.
Found by the backfill search of 27 October 2026; read in full on 29 October 2026 (the TCS version, downloaded through a browser on 29 October 2026).
Baguley2025Temporalconference
Samuel Baguley, Andreas Göbel, Nicolas Klodt, George Skretas, John Sylvester, Viktor Zamaraev (2026). Temporal Exploration of Random Spanning Tree Models. SODA 2026, pp. 2876–2887.
First appeared in 2025. Read: arXiv v1 (2025).
Full paper in the SODA 2026 proceedings (Crossref type book-chapter; metadata from Crossref, proceedings version not read); theorem numbers refer to arXiv v1 (5 August 2025). Found by the backfill search of 27 October 2026; full text of arXiv v1 read.
Baligacs2026Explorationjournal
Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer (2026). Exploration of graphs with excluded minors. Journal of Computer and System Sciences 156:103725.
First appeared in 2023. Read: arXiv v1 (2023).
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, 13 August 2023). Journal metadata from Crossref (issue of March 2026; Crossref lists a CC BY 4.0 licence for the published version, so the publisher page is open); ESA version from DataCite. Theorem numbers refer to the arXiv version.
Baligacs2026Lower preprint
Júlia Baligács (2026). A lower bound of 4 for online graph exploration. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, 16 July 2026). Baligács et al. 2026b cites a version in the proceedings of LATIN 2026 (its reference [Bal26]); no DOI for it was found in Crossref on 27 October 2026, so it is not listed and was not read.
Baligacs2026Randomization preprint
Júlia Baligács, Jan Hązła, Lena Volk (2026). Randomization Helps in Online Graph Exploration: Breaking the Deterministic Lower Bound on Cycles. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, 13 July 2026). No published version found in Crossref on 27 October 2026.
Bar2026Monotoneconference
Rajashree Bar, Daibik Barik, Adri Bhattacharya, Partha Sarathi Mandal (2026). Monotone Decontamination of Arbitrary Dynamic Graphs with Mobile Agents. CALDAM 2026, LNCS, pp. 29–42.
First appeared in 2025. Read: arXiv v1 (2025).
Found by the backfill search of 27 October 2026; arXiv v1 (23 November 2025, 20 pages) read in full; the CALDAM 2026 version (14 pages) was not read. Venue from Crossref (CALDAM 2026, Dharwad, 12–14 February 2026, first online 13 February 2026), which lists no LNCS volume.
Bhagat2026Exploringjournal
Subhash Bhagat, Andrzej Pelc (2026). Exploring wedges of an oriented grid by an automaton with pebbles. Journal of Computer and System Sciences 155:103696.
First appeared in 2023. Read: arXiv v1 (2023).
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, 31 January 2023); journal metadata from Crossref (issue of February 2026; not open access). No conference version found in Crossref.
Bileski2026Don preprint
Kass Bileski, Avery Miller (2026). Don't Be Afraid to Die: Black Hole Search in Dynamic Graphs with Fewer Agents. arXiv preprint.
Found by the backfill search of 27 October 2026; arXiv v1 (6 September 2026) read in full. Preprint, not peer reviewed; it gives proof sketches and defers the full proofs to a journal version. No published version found on Crossref (28 October 2026).
Bonnet2026Deterministicjournal
François Bonnet, Quentin Bramas, Pierre Courtieu, Xavier Défago, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain (2026). Deterministic color-optimal self-stabilizing semi-synchronous gathering: Two certified algorithms. Theoretical Computer Science 1078:116013.
First appeared in 2025. Read: SIROCCO 2025 version (HAL hal-04988128v1).
Found by the backfill search of 27 October 2026. Metadata from Crossref; the journal version is open access (CC BY 4.0). The SIROCCO 2025 version (one certified algorithm) was read in full from its HAL copy; the journal version, which presents two certified algorithms, was not read.
Bonnet2026Searchingconference
François Bonnet, Quentin Bramas, Anissa Lamani (2026). Searching for an Eventually-Emerging Black Hole in Rings. SAND 2026, LIPIcs 373, 18:1–18:18.
Other versions- SSS 2025 (brief announcement), LNCS 16350, pp. 82–87, as “Brief Announcement: Searching for an Eventually-Emerging Black Hole in Rings” doi:10.1007/978-3-032-11127-2_8
First appeared in 2025.
Found by the backfill search of 27 October 2026; the SAND 2026 version was read in full (it omits some proofs and pseudo-code; the full version is the HAL record in url, which DataCite lists as a version). Venue from DataCite (LIPIcs) and Crossref (brief announcement, first online 18 November 2025); LNCS volume 16350 as given in the bibliographies of Kaur et al. 2026a and Bileski & Miller 2026, Crossref lists none.
Bourreau2026Optimalconference
Yann Bourreau, Ananth Narayanan, Alexandre Nolin (2026). Optimal Deterministic Rendezvous in Labeled Lines. STACS 2026, LIPIcs 364, 18:1–18:20.
Other versions- PODC 2025 (brief announcement), pp. 436–439, as “Brief Announcement: Optimal Deterministic Rendezvous in Labeled Lines” doi:10.1145/3732772.3733537
First appeared in 2025. Read: arXiv v2 (2026).
Found by the backfill search of 27 October 2026; metadata from DataCite (STACS version, which DataCite marks as a version of arXiv 2505.04564) and Crossref (PODC brief announcement). Full text read in arXiv v2 (13 January 2026); theorem numbers refer to it; the LIPIcs text was not compared.
Bramas2026AsyncGridjournal
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani (2026). Optimal asynchronous perpetual finite grid exploration. Theoretical Computer Science 1082:116072.
First appeared in 2024.
Metadata from Crossref (SSS 2024 version doi 10.1007/978-3-031-74498-3_6). Checked against the SSS 2024 version on HAL: abstract, Table 1, model, Theorems 2–3, conclusion; the journal version was not read.
Bramas2026Greyconference
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani (2026). 77 Shades of Grey. FUN 2026, LIPIcs 366, 10:1–10:19.
Other versions- Preprint, HAL hal-05504522, 2026, as “77 shades of grey” link
Metadata from DataCite (FUN 2026) and the HAL record. Full text of the FUN 2026 version read.
Bramas2026StandUpjournal
Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, Sébastien Tixeuil (2026). Stand-up indulgent gathering on lines for myopic luminous robots. The Computer Journal 69(7):1122–1132.
First appeared in 2023.
Metadata from Crossref. Abstract read in the arXiv version.
Carnevale2026Hiding preprint
Daniele Carnevale (2026). Hiding a Vertex from the Temporal Explorer: A Lower Bound for Degree-Bounded Temporal Graphs. arXiv preprint.
Preprint (v1, 5 October 2026), not peer reviewed; no other version on Crossref or DataCite (checked 27 October 2026). Found by the backfill search of 27 October 2026; full text read (arXiv v1).
Chalopin2026Holesconference
Jérémie Chalopin, Shantanu Das, Maria Kokkou (2026). Silent Self-stabilising Leader Election in Programmable Matter Systems with Holes. SIROCCO 2026, LNCS, pp. 151–171.
First appeared in 2025. Read: arXiv v2 (2026).
Chalopin2026Stationaryjournal
Jérémie Chalopin, Shantanu Das, Maria Kokkou (2026). Deterministic leader election for stationary programmable matter with common direction. Theoretical Computer Science 1080:116045.
First appeared in 2024. Read: arXiv v1 (2024).
Conference version at SIROCCO 2024, LNCS, pp. 174–191, doi:10.1007/978-3-031-60603-8_10.
Chand2026MDSjournal
Prabhat Kumar Chand, Anisur Rahaman Molla (2026). Linear-time dominating set construction and leader election using mobile agents. Theoretical Computer Science 1086:116245.
First appeared in 2025. Read: arXiv v1 (2025).
Chand2026Trianglejournal
Prabhat Kumar Chand, Apurba Das, Anisur Rahaman Molla (2026). Agent-Based Triangle Counting: Unlocking Truss Decomposition, Triangle Centrality, and Local Clustering Coefficient. IEEE Transactions on Networking (2026).
First appeared in 2024. Read: arXiv v3 (2026).
Bounds are not in the abstract; not recorded here.
Clemente2026Faultjournal
Stefano Clemente, Caterina Feletti (2026). Fault detection and identification by swarms of autonomous mobile robots. Theoretical Computer Science 1074:115933.
First appeared in 2025.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (open access, CC BY, downloaded through a browser on 29 October 2026): model, theorem statements and the summary of results; the model names, which the text extraction lost, were read from the rendered first page.
Coleman2024Linearjournal
Jared Coleman, Dmitry Ivanov, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce (2026). The power of knowledge in linear search for an escaping target. Journal of Computer and System Sciences 157:103737.
First appeared in 2024. Read: arXiv v2 (2024), the full version of the IWOCA paper; theorem numbers refer to it. The JCSS version was also read: its Theorems 3, 4 and 5 are Theorems 1, 2 and 3 of arXiv v2.
Found by the backfill search of 27 October 2026; read in full (arXiv v2). The JCSS version (open access, CC BY), found through a Google search on 29 October 2026, was read on 29 October 2026: same results, plus the cases where the speed is known (Theorem 1, from Coleman et al. 2022; Theorem 2, Alpern and Gal, stated without proof).
Coleman2026Plane preprint
Jared Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce (2026). Search and Rescue on the Plane. arXiv preprint.
Preprint, not peer reviewed.
Cosson2026Polylog preprint
Romain Cosson, Laurent Massoulié (2026). Polylogarithmic collective tree exploration. arXiv preprint (September 2026).
Preprint, not yet peer-reviewed; the paper carries an AI-assistance disclosure.
Das2025SilentRingjournal
Bibhuti Das, Barun Gorain, Kaushik Mondal, Krishnendu Mukhopadhyaya, Supantha Pandit (2026). Optimal Dispersion of Silent Robots in a Ring. Theoretical Computer Science 1084:116171.
First appeared in 2024. Read: arXiv v1 (2024).
Das2026Broadcastjournal
Shantanu Das, Nikos Giachoudis, Flaminia L. Luccio, Euripides Markou (2026). On the Broadcast problem for mobile agents in dynamic networks. Discrete Applied Mathematics 379:194–208.
Mobile agents on graphs ›
Broadcast by agents in dynamic graphs (posed the problem; current best in static, dynamic, dynamic-ring, dynamic-complete, dynamic-bipartite, dynamic-hypercube, dynamic-grid; lower bound in dynamic, dynamic-ring, dynamic-complete, dynamic-bipartite, dynamic-hypercube, dynamic-grid) First appeared in 2020. Read: HAL hal-05380085v1 (the journal version): model, theorem and lemma statements, and the proofs of Observation 3.4, Theorem 4.1 and Lemmas 5.4, 5.5 and 6.2.
Found by the backfill search of 27 October 2026 (as two items, the OPODIS 2020 and the journal versions). Journal venue from Crossref, OPODIS venue from DataCite. The journal version was read in its HAL copy.
Das2026Rendezvous preprint
Bibhuti Das, Andrzej Pelc (2026). Rendezvous of Mobile Deterministic Automata in Graphs. arXiv preprint.
Preprint (v1, 6 August 2026), not peer reviewed. Found by the backfill search of 27 October 2026; metadata from DataCite (10.48550/arXiv.2608.06482) and the PDF; full text (v1) read in full.
Das2026Universal preprint
Bibhuti Das (2026). Universal Rendezvous of Anonymous Agents with Footprints. arXiv preprint.
Preprint (v1, 10 August 2026), not peer reviewed. Found by the backfill search of 27 October 2026; metadata from DataCite (10.48550/arXiv.2608.08981) and the PDF; full text (v1) read in full.
Devismes2026Graphjournal
Stéphane Devismes, Yoann Dieudonné, Arnaud Labourel (2026). Graph Exploration: The Impact of a Distance Constraint. Algorithmica 88(2):24.
First appeared in 2024.
Found by the backfill search of 27 October 2026; abstract read.
Devismes2026Homonymousconference
Stéphane Devismes, Yoann Dieudonné, Arnaud Labourel (2026). Can Like Attract Like? A Study of Homonymous Gathering in Networks. STOC 2026, pp. 933–942.
First appeared in 2025. Read: arXiv v2 (2025).
Feletti2024Optimaljournal
Caterina Feletti, Debasish Pattanayak, Gokarna Sharma (2026). Optimal luminous UCF under asynchrony. Journal of Parallel and Distributed Computing 218:105338.
First appeared in 2024. Read: arXiv v1 (2024).
Feletti2026Computationalconference
Caterina Feletti, Paola Flocchini, Nicola Santoro (2026). Computational Power of Energy-Constrained Autonomous Robots Under Sequential Schedulers. MFCS 2026, LIPIcs 386, 22:1–22:17.
Found by the backfill search of 27 October 2026 and read in full (the LIPIcs version, open access under CC BY 4.0; metadata from DataCite). No arXiv version found. It extends the authors' SSS 2025 paper on sequential schedulers (DOI 10.1007/978-3-032-11127-2_18, its reference [14]), which is a different paper, not a version of this one. The direct PDF link was not checked and is left out.
Feletti2026Dancingconference
Caterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, Nicola Santoro (2026). Universal Dancing by Luminous Robots Under Sequential Schedulers. SIROCCO 2026, pp. 292–312.
Other versions- DISC 2025 (brief announcement), LIPIcs 356, 56:1–56:7, as “Brief Announcement: Universal Dancing by Luminous Robots Under Sequential Schedulers” doi:10.4230/LIPIcs.DISC.2025.56pdf
First appeared in 2025. Read: arXiv v1 (2025).
Feletti2026Safe preprint
Caterina Feletti, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro (2026). Safe Exploration of Arbitrary Dynamic Dangerous Networks. arXiv preprint.
Preprint (v1, 17 September 2026), not peer reviewed. Found by the backfill search of 27 October 2026; full text read.
Flocchini2026Universaljournal
Paola Flocchini, Alfredo Navarra, Debasish Pattanayak, Francesco Piselli, Nicola Santoro (2026). Universal pattern formation by oblivious robots under sequential schedulers. Distributed Computing (2026).
First appeared in 2024. Read: arXiv v3 (2026).
Friemel2026Tileconference
Jonas Friemel, David Liedtke, Christian Scheffer (2026). Tile Reconfiguration by a Finite Automaton. WALCOM 2026, LNCS, pp. 512–526.
First appeared in 2025. Read: arXiv v2 (2025).
Found by the backfill search of 27 October 2026 and read in full (arXiv v2, November 2025). Crossref names the book 'WALCOM: Algorithms and Computation' (LNCS, published online 14 February 2026) but gives no volume number; the meeting year 2026 is inferred from the book's date. Theorem numbers refer to arXiv v2. Not a version of Fekete et al., 'Connected Assembly and Reconfiguration by Finite Automata' (other authors, square grid).
Gao2026Gatheringjournal
Younan Gao, Andrzej Pelc (2026). Gathering teams of bounded memory agents on a line. Distributed Computing 39(2):10.
First appeared in 2024. Read: arXiv v1 (July 2025).
Found by the backfill search of 27 October 2026 and read in full in the arXiv version (v1), which states that it adds full proofs and the section on teams of different sizes to the OPODIS 2024 version; the journal version was not read. Metadata from Crossref (journal, article 10, online 23 March 2026) and DataCite (OPODIS 2024).
Georgiou2026Fermatconference
Konstantinos Georgiou (2026). Optimal Average Disk-Inspection via Fermat’s Principle. LIPIcs, Volume 364, STACS 2026 44:1.
First appeared in 2025. Read: arXiv v3 (2026).
Georgiou2026Trianglejournal
Konstantinos Georgiou, Woojin Jang (2026). Triangle evacuation of 2 agents in the wireless model & the power of choosing a starting point. Journal of Computer and System Sciences 155:103695.
First appeared in 2022. Read: arXiv v1 (2022).
Conference version at ALGOWIN 2022.
Giachoudis2026Blackjournal
Nikos Giachoudis, Maria Kokkou, Euripides Markou (2026). Black Virus Decontamination of synchronous ring networks by initially scattered mobile agents. Discrete Applied Mathematics 392:20–46.
First appeared in 2020.
Found by the backfill search of 27 October 2026; abstract of the SIROCCO 2020 version read; the DAM 2026 version was not seen.
Himani2025TriangularGridsjournal
Himani, Supantha Pandit (2026). Efficient dispersion in triangular grids without prior knowledge. Theoretical Computer Science 1070:115810.
First appeared in 2025. Read: the ICDCIT 2025 version.
Himani2026Efficientconference
Himani, Barun Gorain, Supantha Pandit (2026). Efficient Dispersion of Mobile robots in Torus Networks. ICDCN 2026, ACM, pp. 41–50.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (the open ACM copy, downloaded through a browser on 29 October 2026): model, algorithm outline and theorems. The paper prints the first author's name as "Himani Himani"; written "Himani" as in Himani & Pandit 2026a.
Himani2026LocationAware preprint
Himani, Supantha Pandit, Gokarna Sharma (2026). Location-Aware Dispersion on Anonymous Graphs. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, 5 February 2026). A Crossref title search on 28 October 2026 found no published version.
Himani2026Optimalconference
Himani, Supantha Pandit (2026). Optimal Maximal Independent Set Computation by Robots in Unoriented Grid and Torus. ICDCN 2026, ACM, pp. 31–40.
Found by the backfill search of 27 October 2026; read on 29 October 2026 (the open ACM copy, downloaded through a browser on 29 October 2026): model, algorithms and theorems.
Hiraoka2026Block preprint
Shoma Hiraoka, Shunsuke Imori, Shota Takahashi, Yuichi Sudo (2026). Color Complexity of Recolorable Graph Exploration: Upper and Lower Bounds via Block Structure. arXiv preprint 2609.14356.
Metadata from arXiv. Not peer reviewed. Checked against the full text (v1): model (Section 2), Theorems 3, 6, 11, 13, Lemma 4 and Table 1. The four-colour lower bound is computer-assisted (SAT certificate checked with DRAT).
Jawhar2026Capturing preprint
Khaled Jawhar, Evangelos Kranakis (2026). Capturing a Moving Target on Star Graphs by Two Communicating Mobile Agents. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v2, 16 October 2026). Preprint, not peer reviewed. The authors state that a conference version is to appear at ICDCN 2027 (January 2027); not yet published, so not listed as a version.
Jawhar2026Linearconference
Khaled Jawhar, Evangelos Kranakis (2026). Linear Search for Capturing a Moving Target by Two Robots in the F2F Model. ICDCN 2026, ACM, pp. 1–10.
Search in geometric domains ›
Search for a moving target (current best in line-two-f2f-away-full, line-two-f2f-toward-full, line-two-f2f-away-speed, line-two-f2f-toward-speed, line-two-f2f-away-distance, line-two-f2f-toward-distance, line-two-f2f-away-none, line-two-f2f-toward-none; lower bound in line-two-f2f-away-full, line-two-f2f-toward-full, line-two-f2f-away-speed, line-two-f2f-toward-speed, line-two-f2f-away-distance, line-two-f2f-toward-distance, line-two-f2f-toward-none) First appeared in 2025. Read: arXiv v2 (2025), titled "Capturing a Moving Target by Two Robots in the F2F Model".
Found by the backfill search of 27 October 2026 and read in full (arXiv v2, October 2025). Venue (ICDCN 2026, Nara, January 2026), pages and title from Crossref; the ICDCN version was not read.
Kaminski2026Circles preprint
Bogumil Kaminski, Pawel Pralat, Maria Sadza (2026). Going in Circles: Collaborative Multi-Robot Treasure Hunting. arXiv preprint.
Preprint, not peer reviewed.
Kammer2026Weisfeiler preprint
Frank Kammer, Sandra Kiefer, Johannes Meintrup (2026). Temporal Exploration and Rendezvous via Weisfeiler-Leman Colorings. arXiv preprint.
Preprint (v1, 21 October 2026), not peer reviewed. Found by the weekly discovery; full text read.
Kaur2026Black preprint
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal, Kaushik Mondal (2026). Black Hole Search: Dynamics, Distribution, and Emergence. arXiv preprint.
First appeared in 2025.
Found by the backfill search of 27 October 2026; arXiv v2 (3 March 2026) read in full. Extended version of Kaur et al. 2025 (SSS 2025), which it calls a preliminary version; it adds the eventually emerging black hole (Section 3). No journal version found on Crossref (28 October 2026). Not peer reviewed in this form.
Kaur2026Dynamicjournal
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal, Kaushik Mondal (2026). Black hole search in dynamic graphs. Theoretical Computer Science 1086:116237.
First appeared in 2024. Read: arXiv v2 (2025).
Kaur2026MISjournal
Tanvir Kaur, Barun Gorain, Kaushik Mondal (2026). Maximal Independent Set via Leader Election by Mobile Agents from Arbitrary Initial Configuration Without Global Knowledge. SN Computer Science 7, article 125.
First appeared in 2024. Read: arXiv v2 (2024).
Bounds are those of the arXiv version; whether the journal article is its final version was not checked.
Kaur2026Verificationjournal
Tanvir Kaur, Ashish Saxena (2026). When agents are powerful: Black hole search with verification in time-varying graphs. Theoretical Computer Science 1088:116285.
First appeared in 2025. Read: arXiv v2 (2026).
Found through Crossref (journal version registered 17 October 2026). The journal version could not be fetched (ScienceDirect refuses scripted requests); arXiv v2 read in full.
Kojima2026Hardwired preprint
Yuta Kojima, Sébastien Tixeuil, Yukiko Yamauchi (2026). Hardwired Pattern Formation by Mobile Robots with Common Unit Distance. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, submitted 21 June 2026). Preprint, not peer reviewed; Crossref shows no published version.
Kranakis2026Segment preprint
Evangelos Kranakis (2026). Searching the Plane in the Segment Visibility Model. arXiv preprint.
Found by the paper search of 11 November 2026; full text read (arXiv v1). Preprint, not peer reviewed; no published version on Crossref (checked 11 November 2026).
Kshemkalyani2026Leaderjournal
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Debasish Pattanayak, Gokarna Sharma (2026). Faster leader election via mobile agents and its applications. Theoretical Computer Science 1059:115578.
Other versions- ICDCIT 2025, LNCS 15507, pp. 108–123, as “Faster Leader Election and Its Applications for Mobile Agents with Parameter Advice” doi:10.1007/978-3-031-81404-4_9
First appeared in 2025.
The abstract states \(O(n\log^2 n + D\Delta)\) rounds; Theorem 1 proves \(O(n\log^2 n + D\Delta\log n)\). The ICDCIT 2025 version is by four of the five authors; the fifth joined for a section added in the journal version.
Kumar2026Grid preprint
Manish Kumar, Anisur Rahaman Molla, Debasish Pattanayak, Subhajit Pramanick (2026). Beyond the Boundary: Optimal Grid Dispersion by Spread, Reverse, and Collect. arXiv preprint.
Preprint (v1, 12 October 2026), not peer reviewed. Oriented square grids with local communication; the algorithm also runs on the infinite oriented grid.
Kumar2026SublinearTimeconference
Manish Kumar, Othon Michail, Andreas Padalkin, Christian Scheideler (2026). Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements. SAND 2026, LIPIcs 373, 11:1–11:17.
Read: arXiv v1 (2026).
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, March 2026); metadata of the SAND version from DataCite. Theorem numbers refer to arXiv v1.
Ma2026Cyclic preprint
Yuan Ma, Yiqun Lisa Yin (2026). On the Cyclic Assumption of the Cow-Path Search Algorithm. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, 7 October 2026). Preprint, not peer reviewed; a write-up of an unpublished 1994 manuscript by the same authors.
Maiti2026Conflicting preprint
Animesh Maiti, Prakhar Shukla, Subhash Bhagat (2026). Conflicting Pattern Formation by Teams of Anonymous, Fully Disoriented Robots. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, submitted 20 September 2026). Preprint, not peer reviewed. The SSRN copy (Crossref: posted-content, Elsevier BV) has the same title and authors and was not opened.
Maiti2026MinMax preprint
Animesh Maiti, Prakhar Shukla, Subhash Bhagat (2026). Min-Max Uniform Circle Formation by Asynchronous Mobile Robots. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, submitted 4 October 2026). Preprint, not peer reviewed; Crossref shows no published version. Not a version of Maiti et al. 2026c (other objective, other authors) nor of Bhagat and Mukhopadhyaya's optimum circle formation (2018), which it cites.
Maiti2026MinSum preprint
Animesh Maiti, Abhinav Chakraborty, Bibhuti Das, Subhash Bhagat, Krishnendu Mukhopadhyaya (2026). Min-Sum Uniform Coverage Problem by Autonomous Mobile Robots. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, submitted 11 February 2026). Preprint, not peer reviewed; Crossref shows no published version. Not a version of Maiti et al. 2026b nor of Bhagat and Mukhopadhyaya's optimum circle formation (2018).
Maiti2026Surplus preprint
Animesh Maiti, Abhinav Chakraborty, Subhash Bhagat (2026). The Surplus Parking Gathering Problem in Infinite Grids. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, July 2026). Preprint, not peer reviewed; no published version found on Crossref.
Maiti2026When preprint
Animesh Maiti, Prakhar Shukla, Abhinav Chakraborty, Subhash Bhagat (2026). When Robots Crash: Optimal Asynchronous Gathering at Weber Meeting Nodes. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, October 2026, with its appendix). Preprint, not peer reviewed; no published version found on Crossref.
Masuzawa2026Disorientation preprint
Koichi Wada, Toshimitsu Masuzawa, Yuichi Sudo (2026). Rendezvous under Variable Disorientation: The Algorithmic Power of Fixed Unit Distance. arXiv preprint.
Preprint, not peer reviewed. Authors in the order of arXiv v2 (6 November 2026), which lists Wada first; the key keeps the earlier order. v2 was found by the paper search of 11 November 2026 and not compared with the version read.
Moses2026Broadcasting preprint
William K. Moses Jr., Amanda Redlich, Frederick Stock (2026). Broadcasting Agents and Adversary: A new variation on Cops and Robbers. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, March 2026; set in the Electronic Journal of Combinatorics template, marked submitted, not accepted). A Crossref title search on 28 October 2026 found no published version.
Mutzari2026Competitiveconference
Dolev Mutzari, Yonatan Aumann, Sarit Kraus (2026). Competitive Connected Multi-robot Exploration of Unknown Graphs. IJCAI 2026, pp. 297–305.
Found by the backfill search of 27 October 2026 and read in full (the IJCAI version). Metadata from Crossref.
Ninomiya2026Disjunctive preprint
Tsukasa Ninomiya, Shota Naito, Naoki Kitamura, Yuichi Sudo, Koichi Wada (2026). A Minimum Exact Disjunctive Basis for Two-Robot Solvability Profiles. arXiv preprint.
Preprint, not peer reviewed.
Otaka2026TwoStatejournal
Kohei Otaka, Fabian Frei, Koichi Wada (2026). Gathering semi-synchronously scheduled two-state robots. Theoretical Computer Science 1068:115776.
First appeared in 2024. Read: arXiv v1 (2024).
Conference version at SSS 2024, doi:10.1007/978-3-031-74498-3_15.
Padalkin2026Polylogarithmicjournal
Andreas Padalkin, Christian Scheideler (2026). Polylogarithmic time algorithms for shortest path forests in programmable matter. Distributed Computing 39(2):15.
First appeared in 2024. Read: arXiv v1 (2024); theorem numbers refer to it.
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal and PODC metadata from Crossref.
Papin2026Deterministic preprint
Malo Papin (2026). Deterministic Collision-Free Exploration of Unknown Anonymous Graphs – A Time Efficient Algorithm. HAL preprint hal-05690949.
Found by the backfill search of 27 October 2026 and read in full (HAL v1, July 2026). Preprint, not peer reviewed.
Pattanayak2025OptimalAsyncconference
Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma (2026). Asynchronous Dispersion with Optimal Time Complexity. ICPP 2026.
First appeared in 2025. Read: arXiv v1 (2025).
Pyati2026Separationjournal
Prajyot Pyati, Navjot Kaur, Saswata Jana, Adri Bhattacharya, Partha Sarathi Mandal (2026). Separation of unconscious colored robots with obstructed visibility. Theoretical Computer Science 1086:116243.
First appeared in 2025.
Saini2026Cops preprint
Amanpreet Singh Saini, Ashish Saxena, Kaushik Mondal (2026). Cops and Lethal Robber on Rings: A Distributed Perspective. arXiv preprint.
Found by the backfill search of 27 October 2026; arXiv v1 (6 September 2026) read in full. Preprint, not peer reviewed; no published version found on Crossref (28 October 2026).
Saxena2025Balancedjournal
Ashish Saxena, Tanvir Kaur, Kaushik Mondal (2026). Balanced dispersion on time-varying dynamic graphs. Journal of Computer and System Sciences 161:103829.
First appeared in 2024. Read: arXiv v3 (2025).
Saxena2026Highlyjournal
Ashish Saxena, Kaushik Mondal (2026). Exploration on highly dynamic graphs. Distributed Computing 39 (2026).
Read: arXiv v1 (2026).
Saxena2026SemiSynchronousconference
Ashish Saxena, Anisur Rahaman Molla, Kaushik Mondal, Gokarna Sharma (2026). Dynamic Graph Exploration: Semi-Synchrony and Dynamic Port Labeling. DISC 2026, LIPIcs 397, 48:1–48:23.
Other versions- arXiv preprint, 2026, as “Semi-Synchronous Exploration in Dynamic Graphs” link
Read: arXiv v1 (2026).
Full text of arXiv v1 (14 May 2026) read on 27 October 2026; theorem numbers in the atlas refer to it. The DISC 2026 version (DataCite record of 2 November 2026, IsVersionOf arXiv:2605.14375) was found by the paper search of 11 November 2026; its abstract states the same deactivation threshold, but its full text was not compared with v1.
Shibata2026Partialjournal
Masahiro Shibata, Yuichi Sudo, Junya Nakamura, Yonghwan Kim (2026). Partial gathering of mobile agents in dynamic rings. Theoretical Computer Science 1063:115684.
First appeared in 2022.
Found by the backfill search of 27 October 2026; abstract read. The manifest also listed 'Partial gathering of mobile agents in dynamic tori' (The Computer Journal 2025) under this key; that is a different paper, without a local copy.
Shukla2026BudgetConstrained preprint
Prakhar Shukla, Animesh Maiti, Shivam Kumar, Subhash Bhagat (2026). Budget-Constrained Fault-Tolerant Mutual Visibility for Autonomous Robots under the Mobility Fault Model. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, 3 October 2026). Preprint, not peer reviewed. Metadata from DataCite.
Shukla2026Gathering preprint
Prakhar Shukla, Seshunadh Tanuj Peddinti, Subhash Bhagat (2026). Gathering Autonomous Mobile Robots Under the Adversarial Defected View Model. arXiv preprint.
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, 6 March 2026). Preprint, not peer reviewed. Metadata from DataCite.
Stopkin2026Finitejournal
A. V. Stopkin (2026). Finite Undirected Graphs Exploration by a Mobile Agent. Mathematical Modeling and Computing 13(1):225–231.
Found by the backfill search of 27 October 2026; abstract read (journal version, open access).
Sudo2024NearLinearjournal
Yuichi Sudo, Masahiro Shibata, Junya Nakamura, Yonghwan Kim, Toshimitsu Masuzawa (2026). Near-Linear Time Dispersion of Mobile Agents. Distributed Computing 39(1):5.
First appeared in 2023. Read: arXiv v3 (2024).
Sudo2026SelfStabilizingjournal
Yuichi Sudo, Fukuhito Ooshita, Sayaka Kamei (2026). Self-stabilizing graph exploration by a single agent. Theoretical Computer Science 1082:116085.
First appeared in 2020.
Metadata from Crossref and arXiv (first version 2020; brief announcement at DISC 2024). Not read; the arXiv abstracts of different versions state different bounds.
Sudo2026Tight preprint
Yuichi Sudo, Naoki Kitamura, Masahiro Shibata, Junya Nakamura, Sébastien Tixeuil, Toshimitsu Masuzawa, Koichi Wada (2026). Online Graph Exploration under T-Interval Connectivity. arXiv preprint.
Read: arXiv v1 (2026), titled "Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity".
Found by the backfill search of 27 October 2026 and read in full (arXiv v1, 6 April 2026). No published version found in Crossref on 27 October 2026. arXiv v2 (6 November 2026) changed the title; it was found by the paper search of 11 November 2026 and has not been compared with v1.
Warner2026FaultTolerantbrief announcement
Daniel Warner, Christian Scheideler (2026). Brief Announcement: Fault-Tolerant 3D Leader Election in the Amoebot Model. SAND 2026 (brief announcement), LIPIcs 373, 25:1–25:6.
Found by the backfill search of 27 October 2026 and read in full (LIPIcs version); metadata from DataCite. No arXiv version found. It outlines its algorithms without theorems or proofs.
Warner2026Leaderbrief announcement
Daniel Warner, Christian Scheideler (2026). Brief Announcement: Leader Election with Noisy Reconfigurable Circuits in the Amoebot Model. SAND 2026 (brief announcement), LIPIcs 373, 26:1–26:6.
Found by the backfill search of 27 October 2026 and read in full (LIPIcs version); metadata from DataCite. No arXiv version found. Not a version of Warner & Scheideler 2026a: a different model (noisy circuits) and different results.
Xin2026Faster preprint
Qin Xin (2026). Faster Treasure Hunt via Strongly Universal Exploration with Polylogarithmic Overhead. arXiv preprint.
Read: arXiv v1 (2026).
Found by the paper search of 11 November 2026; full text read (arXiv v1). Extended version of Xin 2007 with new results; not peer reviewed. No published version on Crossref (checked 11 November 2026). Its acknowledgement says that ChatGPT helped derive Sections 9–10 and the appendices; those parts were only skimmed.
Yamada2026Rendezvousjournal
Ryonosuke Yamada, Tomoyuki Usami, Yukiko Yamauchi (2026). Rendezvous and merging for two metamorphic robotic systems without global compass. Theoretical Computer Science 1075:115906.
First appeared in 2024. Read: arXiv v1 (2024).
Found by the backfill search of 27 October 2026 and read (arXiv v1). Journal metadata from Crossref.
Lahtin2026Explorationjournal
Ivan Lahtin, Viktor Zamaraev (2027). Exploration of \(k\)-edge-deficient temporal graphs in linear time. Discrete Mathematics 350(2):115451.
First appeared in 2026. Read: arXiv v1 (2026).
Journal version (issue of February 2027, registered on Crossref 28 September 2026, licence CC BY 4.0 per Crossref) found on Crossref and not read; theorem numbers refer to arXiv v1 (15 May 2026). Found by the backfill search of 27 October 2026; full text of arXiv v1 read.