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