@Proceedings{aspnes_et_al:LIPIcs.SAND.2022, title = {{LIPIcs, Volume 221, SAND 2022, Complete Volume}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {1--370}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022}, URN = {urn:nbn:de:0030-drops-159412}, doi = {10.4230/LIPIcs.SAND.2022}, annote = {Keywords: LIPIcs, Volume 221, SAND 2022, Complete Volume} } @InProceedings{aspnes_et_al:LIPIcs.SAND.2022.0, author = {Aspnes, James and Michail, Othon}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.0}, URN = {urn:nbn:de:0030-drops-159426}, doi = {10.4230/LIPIcs.SAND.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} } @InProceedings{spirakis:LIPIcs.SAND.2022.2, author = {Spirakis, Paul G.}, title = {{Algorithmic Problems on Temporal Graphs}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.2}, URN = {urn:nbn:de:0030-drops-159446}, doi = {10.4230/LIPIcs.SAND.2022.2}, annote = {Keywords: Temporal graph, stochastic temporal graph, vertex cover, temporal transitivity} } @InProceedings{wattenhofer:LIPIcs.SAND.2022.3, author = {Wattenhofer, Roger}, title = {{Networks, Dynamics, Algorithms, and Learning}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {3:1--3:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.3}, URN = {urn:nbn:de:0030-drops-159451}, doi = {10.4230/LIPIcs.SAND.2022.3}, annote = {Keywords: graph neural networks} } @InProceedings{adamik_et_al:LIPIcs.SAND.2022.4, author = {Adamik, Antonia and Sering, Leon}, title = {{Atomic Splittable Flow Over Time Games}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {4:1--4:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.4}, URN = {urn:nbn:de:0030-drops-159462}, doi = {10.4230/LIPIcs.SAND.2022.4}, annote = {Keywords: Flows Over Time, Deterministic Queuing, Atomic Splittable Games, Equilibria, Traffic, Cooperation} } @InProceedings{adamson_et_al:LIPIcs.SAND.2022.5, author = {Adamson, Duncan and Gusev, Vladimir V. and Malyshev, Dmitriy and Zamaraev, Viktor}, title = {{Faster Exploration of Some Temporal Graphs}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {5:1--5:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.5}, URN = {urn:nbn:de:0030-drops-159475}, doi = {10.4230/LIPIcs.SAND.2022.5}, annote = {Keywords: Temporal Graphs, Graph Exploration} } @InProceedings{alaniz_et_al:LIPIcs.SAND.2022.6, author = {Alaniz, Robert M. and Caballero, David and Cirlos, Sonya C. and Gomez, Timothy and Grizzell, Elise and Rodriguez, Andrew and Schweller, Robert and Tenorio, Armando and Wylie, Tim}, title = {{Building Squares with Optimal State Complexity in Restricted Active Self-Assembly}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {6:1--6:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.6}, URN = {urn:nbn:de:0030-drops-159482}, doi = {10.4230/LIPIcs.SAND.2022.6}, annote = {Keywords: Active Self-Assembly, State Complexity, Tile Automata} } @InProceedings{berenbrink_et_al:LIPIcs.SAND.2022.7, author = {Berenbrink, Petra and Biermeier, Felix and Hahn, Christopher and Kaaser, Dominik}, title = {{Loosely-Stabilizing Phase Clocks and The Adaptive Majority Problem}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {7:1--7:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.7}, URN = {urn:nbn:de:0030-drops-159493}, doi = {10.4230/LIPIcs.SAND.2022.7}, annote = {Keywords: Population Protocols, Phase Clocks, Loose Self-stabilization, Clock Synchronization, Majority, Adaptive} } @InProceedings{caballero_et_al:LIPIcs.SAND.2022.8, author = {Caballero, David and Gomez, Timothy and Schweller, Robert and Wylie, Tim}, title = {{Complexity of Verification in Self-Assembly with Prebuilt Assemblies}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {8:1--8:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.8}, URN = {urn:nbn:de:0030-drops-159503}, doi = {10.4230/LIPIcs.SAND.2022.8}, annote = {Keywords: 2-handed assembly, verification, prebuilt} } @InProceedings{casteigts_et_al:LIPIcs.SAND.2022.9, author = {Casteigts, Arnaud and Corsini, Timoth\'{e}e and Hocquard, Herv\'{e} and Labourel, Arnaud}, title = {{Robustness of Distances and Diameter in a Fragile Network}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.9}, URN = {urn:nbn:de:0030-drops-159514}, doi = {10.4230/LIPIcs.SAND.2022.9}, annote = {Keywords: Dynamic networks, Longest path, Series-parallel graphs, Rooted minors} } @InProceedings{charronbost_et_al:LIPIcs.SAND.2022.10, author = {Charron-Bost, Bernadette and Lambein-Monette, Patrick}, title = {{Computing Outside the Box: Average Consensus over Dynamic Networks}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.10}, URN = {urn:nbn:de:0030-drops-159521}, doi = {10.4230/LIPIcs.SAND.2022.10}, annote = {Keywords: average consensus, dynamic networks, distributed algorithms, iterated averaging, Metropolis} } @InProceedings{czerner_et_al:LIPIcs.SAND.2022.11, author = {Czerner, Philipp and Guttenberg, Roland and Helfrich, Martin and Esparza, Javier}, title = {{Fast and Succinct Population Protocols for Presburger Arithmetic}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {11:1--11:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.11}, URN = {urn:nbn:de:0030-drops-159535}, doi = {10.4230/LIPIcs.SAND.2022.11}, annote = {Keywords: population protocols, fast, succinct, population computers} } @InProceedings{daymude_et_al:LIPIcs.SAND.2022.12, author = {Daymude, Joshua J. and Richa, Andr\'{e}a W. and Scheideler, Christian}, title = {{Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {12:1--12:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.12}, URN = {urn:nbn:de:0030-drops-159545}, doi = {10.4230/LIPIcs.SAND.2022.12}, annote = {Keywords: Mutual exclusion, dynamic networks, message passing, concurrency} } @InProceedings{doty_et_al:LIPIcs.SAND.2022.13, author = {Doty, David and Eftekhari, Mahsa}, title = {{Dynamic Size Counting in Population Protocols}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {13:1--13:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.13}, URN = {urn:nbn:de:0030-drops-159558}, doi = {10.4230/LIPIcs.SAND.2022.13}, annote = {Keywords: Loosely-stabilizing, population protocols, size counting} } @InProceedings{doty_et_al:LIPIcs.SAND.2022.14, author = {Doty, David and Ong, Aaron}, title = {{Simulating 3-Symbol Turing Machines with SIMD||DNA}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {14:1--14:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.14}, URN = {urn:nbn:de:0030-drops-159568}, doi = {10.4230/LIPIcs.SAND.2022.14}, annote = {Keywords: DNA storage, strand displacement, parallel computation} } @InProceedings{erlebach_et_al:LIPIcs.SAND.2022.15, author = {Erlebach, Thomas and Spooner, Jakob T.}, title = {{Parameterized Temporal Exploration Problems}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {15:1--15:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.15}, URN = {urn:nbn:de:0030-drops-159570}, doi = {10.4230/LIPIcs.SAND.2022.15}, annote = {Keywords: Temporal graphs, fixed-parameter tractability, parameterized complexity} } @InProceedings{fluschnik_et_al:LIPIcs.SAND.2022.16, author = {Fluschnik, Till and Kunz, Pascal}, title = {{Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.16}, URN = {urn:nbn:de:0030-drops-159587}, doi = {10.4230/LIPIcs.SAND.2022.16}, annote = {Keywords: structural parameters, NP-hardness, parameterized algorithms, multistage problems} } @InProceedings{fuchsle_et_al:LIPIcs.SAND.2022.17, author = {F\"{u}chsle, Eugen and Molter, Hendrik and Niedermeier, Rolf and Renken, Malte}, title = {{Temporal Connectivity: Coping with Foreseen and Unforeseen Delays}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {17:1--17:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.17}, URN = {urn:nbn:de:0030-drops-159598}, doi = {10.4230/LIPIcs.SAND.2022.17}, annote = {Keywords: Paths and walks in temporal graphs, static expansions of temporal graphs, two-player games, flow computations, dynamic programming, PSPACE-completeness} } @InProceedings{hanauer_et_al:LIPIcs.SAND.2022.18, author = {Hanauer, Kathrin and Henzinger, Monika and Hua, Qi Cheng}, title = {{Fully Dynamic Four-Vertex Subgraph Counting}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {18:1--18:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.18}, URN = {urn:nbn:de:0030-drops-159608}, doi = {10.4230/LIPIcs.SAND.2022.18}, annote = {Keywords: Dynamic Graph Algorithms, Subgraph Counting, Motif Search} } @InProceedings{hermelin_et_al:LIPIcs.SAND.2022.19, author = {Hermelin, Danny and Itzhaki, Yuval and Molter, Hendrik and Niedermeier, Rolf}, title = {{Temporal Unit Interval Independent Sets}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.19}, URN = {urn:nbn:de:0030-drops-159617}, doi = {10.4230/LIPIcs.SAND.2022.19}, annote = {Keywords: Temporal Graphs, Vertex Orderings, Order Preservation, Interval Graphs, Algorithms and Complexity} } @InProceedings{yamada_et_al:LIPIcs.SAND.2022.20, author = {Yamada, Ryonosuke and Yamauchi, Yukiko}, title = {{Search by a Metamorphic Robotic System in a Finite 3D Cubic Grid}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {20:1--20:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.20}, URN = {urn:nbn:de:0030-drops-159626}, doi = {10.4230/LIPIcs.SAND.2022.20}, annote = {Keywords: Distributed system, metamorphic robotic system, search, and 3D cubic grid} } @InProceedings{augustine_et_al:LIPIcs.SAND.2022.21, author = {Augustine, John and Ramachandran, Srikkanth}, title = {{Brief Announcement: Cooperative Guarding in Polygons with Holes}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {21:1--21:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.21}, URN = {urn:nbn:de:0030-drops-159636}, doi = {10.4230/LIPIcs.SAND.2022.21}, annote = {Keywords: Mobile Agents, Art Gallery Problem, Cooperative Guarding} } @InProceedings{hand_et_al:LIPIcs.SAND.2022.22, author = {Hand, Samuel D. and Enright, Jessica and Meeks, Kitty}, title = {{Brief Announcement: The Temporal Firefighter Problem}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {22:1--22:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.22}, URN = {urn:nbn:de:0030-drops-159644}, doi = {10.4230/LIPIcs.SAND.2022.22}, annote = {Keywords: Temporal graphs, Spreading processes, Parameterised complexity} } @InProceedings{kostitsyna_et_al:LIPIcs.SAND.2022.23, author = {Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, title = {{Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {23:1--23:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.23}, URN = {urn:nbn:de:0030-drops-159656}, doi = {10.4230/LIPIcs.SAND.2022.23}, annote = {Keywords: Programmable matter, Geometric amoebot model, Fault tolerance, Shape formation} } @InProceedings{luchsinger:LIPIcs.SAND.2022.24, author = {Luchsinger, Austin}, title = {{Brief Announcement: Barrier-1 Reachability for Thermodynamic Binding Networks Is PSPACE-Complete}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {24:1--24:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.24}, URN = {urn:nbn:de:0030-drops-159664}, doi = {10.4230/LIPIcs.SAND.2022.24}, annote = {Keywords: Thermodynamic Binding Networks, Nondeterministic Constraint Logic, NP-complete, PSPACE-complete} } @InProceedings{hanauer_et_al:LIPIcs.SAND.2022.1, author = {Hanauer, Kathrin and Henzinger, Monika and Schulz, Christian}, title = {{Recent Advances in Fully Dynamic Graph Algorithms}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {1:1--1:47}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.1}, URN = {urn:nbn:de:0030-drops-159434}, doi = {10.4230/LIPIcs.SAND.2022.1}, annote = {Keywords: fully dynamic graph algorithms, survey} }