<h2>LIPIcs, Volume 221, SAND 2022</h2>
<ul>
<li>
<span class="authors">James Aspnes and Othon Michail</span>
<span class="title">LIPIcs, Volume 221, SAND 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022">10.4230/LIPIcs.SAND.2022</a>
</li>
<li>
<span class="authors">James Aspnes and Othon Michail</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.0">10.4230/LIPIcs.SAND.2022.0</a>
</li>
<li>
<span class="authors">Paul G. Spirakis</span>
<span class="title">Algorithmic Problems on Temporal Graphs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.2">10.4230/LIPIcs.SAND.2022.2</a>
</li>
<li>
<span class="authors">Roger Wattenhofer</span>
<span class="title">Networks, Dynamics, Algorithms, and Learning (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.3">10.4230/LIPIcs.SAND.2022.3</a>
</li>
<li>
<span class="authors">Antonia Adamik and Leon Sering</span>
<span class="title">Atomic Splittable Flow Over Time Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.4">10.4230/LIPIcs.SAND.2022.4</a>
</li>
<li>
<span class="authors">Duncan Adamson, Vladimir V. Gusev, Dmitriy Malyshev, and Viktor Zamaraev</span>
<span class="title">Faster Exploration of Some Temporal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.5">10.4230/LIPIcs.SAND.2022.5</a>
</li>
<li>
<span class="authors">Robert M. Alaniz, David Caballero, Sonya C. Cirlos, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert Schweller, Armando Tenorio, and Tim Wylie</span>
<span class="title">Building Squares with Optimal State Complexity in Restricted Active Self-Assembly</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.6">10.4230/LIPIcs.SAND.2022.6</a>
</li>
<li>
<span class="authors">Petra Berenbrink, Felix Biermeier, Christopher Hahn, and Dominik Kaaser</span>
<span class="title">Loosely-Stabilizing Phase Clocks and The Adaptive Majority Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.7">10.4230/LIPIcs.SAND.2022.7</a>
</li>
<li>
<span class="authors">David Caballero, Timothy Gomez, Robert Schweller, and Tim Wylie</span>
<span class="title">Complexity of Verification in Self-Assembly with Prebuilt Assemblies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.8">10.4230/LIPIcs.SAND.2022.8</a>
</li>
<li>
<span class="authors">Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, and Arnaud Labourel</span>
<span class="title">Robustness of Distances and Diameter in a Fragile Network</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.9">10.4230/LIPIcs.SAND.2022.9</a>
</li>
<li>
<span class="authors">Bernadette Charron-Bost and Patrick Lambein-Monette</span>
<span class="title">Computing Outside the Box: Average Consensus over Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.10">10.4230/LIPIcs.SAND.2022.10</a>
</li>
<li>
<span class="authors">Philipp Czerner, Roland Guttenberg, Martin Helfrich, and Javier Esparza</span>
<span class="title">Fast and Succinct Population Protocols for Presburger Arithmetic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.11">10.4230/LIPIcs.SAND.2022.11</a>
</li>
<li>
<span class="authors">Joshua J. Daymude, Andréa W. Richa, and Christian Scheideler</span>
<span class="title">Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.12">10.4230/LIPIcs.SAND.2022.12</a>
</li>
<li>
<span class="authors">David Doty and Mahsa Eftekhari</span>
<span class="title">Dynamic Size Counting in Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.13">10.4230/LIPIcs.SAND.2022.13</a>
</li>
<li>
<span class="authors">David Doty and Aaron Ong</span>
<span class="title">Simulating 3-Symbol Turing Machines with SIMD||DNA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.14">10.4230/LIPIcs.SAND.2022.14</a>
</li>
<li>
<span class="authors">Thomas Erlebach and Jakob T. Spooner</span>
<span class="title">Parameterized Temporal Exploration Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.15">10.4230/LIPIcs.SAND.2022.15</a>
</li>
<li>
<span class="authors">Till Fluschnik and Pascal Kunz</span>
<span class="title">Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.16">10.4230/LIPIcs.SAND.2022.16</a>
</li>
<li>
<span class="authors">Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, and Malte Renken</span>
<span class="title">Temporal Connectivity: Coping with Foreseen and Unforeseen Delays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.17">10.4230/LIPIcs.SAND.2022.17</a>
</li>
<li>
<span class="authors">Kathrin Hanauer, Monika Henzinger, and Qi Cheng Hua</span>
<span class="title">Fully Dynamic Four-Vertex Subgraph Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.18">10.4230/LIPIcs.SAND.2022.18</a>
</li>
<li>
<span class="authors">Danny Hermelin, Yuval Itzhaki, Hendrik Molter, and Rolf Niedermeier</span>
<span class="title">Temporal Unit Interval Independent Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.19">10.4230/LIPIcs.SAND.2022.19</a>
</li>
<li>
<span class="authors">Ryonosuke Yamada and Yukiko Yamauchi</span>
<span class="title">Search by a Metamorphic Robotic System in a Finite 3D Cubic Grid</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.20">10.4230/LIPIcs.SAND.2022.20</a>
</li>
<li>
<span class="authors">John Augustine and Srikkanth Ramachandran</span>
<span class="title">Brief Announcement: Cooperative Guarding in Polygons with Holes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.21">10.4230/LIPIcs.SAND.2022.21</a>
</li>
<li>
<span class="authors">Samuel D. Hand, Jessica Enright, and Kitty Meeks</span>
<span class="title">Brief Announcement: The Temporal Firefighter Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.22">10.4230/LIPIcs.SAND.2022.22</a>
</li>
<li>
<span class="authors">Irina Kostitsyna, Christian Scheideler, and Daniel Warner</span>
<span class="title">Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.23">10.4230/LIPIcs.SAND.2022.23</a>
</li>
<li>
<span class="authors">Austin Luchsinger</span>
<span class="title">Brief Announcement: Barrier-1 Reachability for Thermodynamic Binding Networks Is PSPACE-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.24">10.4230/LIPIcs.SAND.2022.24</a>
</li>
<li>
<span class="authors">Kathrin Hanauer, Monika Henzinger, and Christian Schulz</span>
<span class="title">Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2022.1">10.4230/LIPIcs.SAND.2022.1</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