LIPIcs, Volume 292, SAND 2024

• Arnaud Casteigts and Fabian Kuhn LIPIcs, Volume 292, SAND 2024, Complete Volume 10.4230/LIPIcs.SAND.2024
• Arnaud Casteigts and Fabian Kuhn Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.SAND.2024.0
• Thomas Erlebach Exploration and Rendezvous in Temporal Graphs (Invited Talk) 10.4230/LIPIcs.SAND.2024.1
• Thomas Nowak Distributed Computation with Bacteria (Invited Talk) 10.4230/LIPIcs.SAND.2024.2
• Andréa Werneck Richa Algorithmic Programmable Matter: From Local Markov Chains to "Dumb" Robots (Invited Talk) 10.4230/LIPIcs.SAND.2024.3
• Duncan Adamson Harmonious Colourings of Temporal Matchings 10.4230/LIPIcs.SAND.2024.4
• Judith Beestermöller, Costas Busch, and Roger Wattenhofer Fault-Tolerant Distributed Directories 10.4230/LIPIcs.SAND.2024.5
• Adri Bhattacharya, Giuseppe F. Italiano, and Partha Sarathi Mandal Black Hole Search in Dynamic Tori 10.4230/LIPIcs.SAND.2024.6
• Quentin Bramas, Jean-Romain Luttringer, and Sébastien Tixeuil Online Space-Time Travel Planning in Dynamic Graphs 10.4230/LIPIcs.SAND.2024.7
• Esteban Christiann, Eric Sanlaville, and Jason Schoeters On Inefficiently Connecting Temporal Networks 10.4230/LIPIcs.SAND.2024.8
• Matthew Connor, Othon Michail, and George Skretas All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots 10.4230/LIPIcs.SAND.2024.9
• Riccardo Dondi and Manuel Lafond On the Complexity of Temporal Arborescence Reconfiguration 10.4230/LIPIcs.SAND.2024.10
• Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, and Alessandra Tappini Partial Temporal Vertex Cover with Bounded Activity Intervals 10.4230/LIPIcs.SAND.2024.11
• Thomas Erlebach, Nils Morawietz, and Petra Wolf Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization 10.4230/LIPIcs.SAND.2024.12
• Caterina Feletti, Lucia Mambretti, Carlo Mereghetti, and Beatrice Palano Computational Power of Opaque Robots 10.4230/LIPIcs.SAND.2024.13
• Christopher Hahn, Jonas Harbig, and Peter Kling Forming Large Patterns with Local Robots in the OBLOT Model 10.4230/LIPIcs.SAND.2024.14
• Kristian Hinnenthal, David Liedtke, and Christian Scheideler Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures 10.4230/LIPIcs.SAND.2024.15
• Nina Klobas, George B. Mertzios, Hendrik Molter, and Paul G. Spirakis Temporal Graph Realization from Fastest Paths 10.4230/LIPIcs.SAND.2024.16
• Shuma Kumamoto, Shuji Kijima, and Tomoyuki Shirai An Analysis of the Recurrence/Transience of Random Walks on Growing Trees and Hypercubes 10.4230/LIPIcs.SAND.2024.17
• Andreas Padalkin, Manish Kumar, and Christian Scheideler Reconfiguration and Locomotion with Joint Movements in the Amoebot Model 10.4230/LIPIcs.SAND.2024.18
• Kévin Perrot, Sylvain Sené, and Léah Tapin Complexity of Boolean Automata Networks Under Block-Parallel Update Modes 10.4230/LIPIcs.SAND.2024.19
• Avisek Sharma, Satakshi Ghosh, Pritam Goswami, and Buddhadeb Sau Space and Move-Optimal Arbitrary Pattern Formation on Infinite Rectangular Grid by Oblivious Robot Swarm 10.4230/LIPIcs.SAND.2024.20
• Haozhi Zheng, Ryota Eguchi, Fukuhito Ooshita, and Michiko Inoue Gathering in Carrier Graphs: Meeting via Public Transportation System 10.4230/LIPIcs.SAND.2024.21
• Duncan Adamson, Nathan Flaherty, Igor Potapov, and Paul G. Spirakis Brief Announcement: Collision-Free Robot Scheduling 10.4230/LIPIcs.SAND.2024.22
• Nada Almalki, Siddharth Gupta, and Othon Michail Brief Announcement: On the Exponential Growth of Geometric Shapes 10.4230/LIPIcs.SAND.2024.23
• Stefan Balev, Yoann Pigné, Éric Sanlaville, and Mathilde Vernet Brief Announcement: The Dynamic Steiner Tree Problem: Definitions, Complexity, Algorithms 10.4230/LIPIcs.SAND.2024.24
• Quentin Bramas, Toshimitsu Masuzawa, and Sébastien Tixeuil Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents 10.4230/LIPIcs.SAND.2024.25
• Siddharth Gupta, Marc van Kreveld, Othon Michail, and Andreas Padalkin Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them 10.4230/LIPIcs.SAND.2024.26
• George B. Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos, and Paul G. Spirakis Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs 10.4230/LIPIcs.SAND.2024.27