4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 1-342, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@Proceedings{meeks_et_al:LIPIcs.SAND.2025, title = {{LIPIcs, Volume 330, SAND 2025, Complete Volume}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {1--342}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025}, URN = {urn:nbn:de:0030-drops-232691}, doi = {10.4230/LIPIcs.SAND.2025}, annote = {Keywords: LIPIcs, Volume 330, SAND 2025, Complete Volume} }
4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 0:i-0:viii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{meeks_et_al:LIPIcs.SAND.2025.0, author = {Meeks, Kitty and Scheideler, Christian}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {0:i--0:viii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.0}, URN = {urn:nbn:de:0030-drops-232686}, doi = {10.4230/LIPIcs.SAND.2025.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Philipp Czerner, Vincent Fischer, and Roland Guttenberg. The Expressive Power of Uniform Population Protocols with Logarithmic Space. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 1:1-1:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{czerner_et_al:LIPIcs.SAND.2025.1, author = {Czerner, Philipp and Fischer, Vincent and Guttenberg, Roland}, title = {{The Expressive Power of Uniform Population Protocols with Logarithmic Space}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {1:1--1:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.1}, URN = {urn:nbn:de:0030-drops-230540}, doi = {10.4230/LIPIcs.SAND.2025.1}, annote = {Keywords: Population Protocols, Uniform, Expressive Power} }
Henri Froese, Martin Hoefer, and Lisa Wilhelmi. Dynamic Debt Swapping in Financial Networks. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 2:1-2:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{froese_et_al:LIPIcs.SAND.2025.2, author = {Froese, Henri and Hoefer, Martin and Wilhelmi, Lisa}, title = {{Dynamic Debt Swapping in Financial Networks}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {2:1--2:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.2}, URN = {urn:nbn:de:0030-drops-230550}, doi = {10.4230/LIPIcs.SAND.2025.2}, annote = {Keywords: Debt Swap, Financial Networks, Local Search} }
Thomas Bellitto, Jules Bouton Popper, and Bruno Escoffier. Temporal Connectivity Augmentation. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 3:1-3:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{bellitto_et_al:LIPIcs.SAND.2025.3, author = {Bellitto, Thomas and Popper, Jules Bouton and Escoffier, Bruno}, title = {{Temporal Connectivity Augmentation}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {3:1--3:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.3}, URN = {urn:nbn:de:0030-drops-230565}, doi = {10.4230/LIPIcs.SAND.2025.3}, annote = {Keywords: Temporal graph, temporal connectivity} }
Antoine El-Hayek, Kathrin Hanauer, and Monika Henzinger. On b-Matching and Fully-Dynamic Maximum k-Edge Coloring. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 4:1-4:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{elhayek_et_al:LIPIcs.SAND.2025.4, author = {El-Hayek, Antoine and Hanauer, Kathrin and Henzinger, Monika}, title = {{On b-Matching and Fully-Dynamic Maximum k-Edge Coloring}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {4:1--4:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.4}, URN = {urn:nbn:de:0030-drops-230571}, doi = {10.4230/LIPIcs.SAND.2025.4}, annote = {Keywords: dynamic algorithm, graph algorithm, matching, b-matching, edge coloring} }
Flavio T. Principato, Javier Esparza, and Philipp Czerner. Undecidability of the Emptiness Problem for Weak Models of Distributed Computing. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 5:1-5:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{principato_et_al:LIPIcs.SAND.2025.5, author = {Principato, Flavio T. and Esparza, Javier and Czerner, Philipp}, title = {{Undecidability of the Emptiness Problem for Weak Models of Distributed Computing}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {5:1--5:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.5}, URN = {urn:nbn:de:0030-drops-230582}, doi = {10.4230/LIPIcs.SAND.2025.5}, annote = {Keywords: Undecidability, Emptiness Problem, distributed Automata} }
Daniele Carnevale, Arnaud Casteigts, and Timothée Corsini. Dismountability in Temporal Cliques Revisited. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 6:1-6:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{carnevale_et_al:LIPIcs.SAND.2025.6, author = {Carnevale, Daniele and Casteigts, Arnaud and Corsini, Timoth\'{e}e}, title = {{Dismountability in Temporal Cliques Revisited}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {6:1--6:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.6}, URN = {urn:nbn:de:0030-drops-230591}, doi = {10.4230/LIPIcs.SAND.2025.6}, annote = {Keywords: Dynamic networks, Temporal graphs, Reachability, Dismountability, Pivotability, Temporal spanners, Full-range graphs} }
David C. Kutner and Anouk Sommer. Better Late, Then? The Hardness of Choosing Delays to Meet Passenger Demands in Temporal Graphs. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{kutner_et_al:LIPIcs.SAND.2025.7, author = {Kutner, David C. and Sommer, Anouk}, title = {{Better Late, Then? The Hardness of Choosing Delays to Meet Passenger Demands in Temporal Graphs}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {7:1--7:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.7}, URN = {urn:nbn:de:0030-drops-230604}, doi = {10.4230/LIPIcs.SAND.2025.7}, annote = {Keywords: Temporal Graphs, Computational Complexity, Delay Management, Train Networks} }
Lapo Cioni, Riccardo Dondi, Andrea Marino, Jason Schoeters, and Ana Silva. Matching and Edge Cover in Temporal Graphs. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{cioni_et_al:LIPIcs.SAND.2025.8, author = {Cioni, Lapo and Dondi, Riccardo and Marino, Andrea and Schoeters, Jason and Silva, Ana}, title = {{Matching and Edge Cover in Temporal Graphs}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.8}, URN = {urn:nbn:de:0030-drops-230614}, doi = {10.4230/LIPIcs.SAND.2025.8}, annote = {Keywords: graphs, temporal graphs, edge cover, matching, parameterized algorithm, approximation algorithm} }
Kazuhiro Kurita, Andrea Marino, Jason Schoeters, and Takeaki Uno. Spanner Enumeration for Temporal Graphs. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 9:1-9:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{kurita_et_al:LIPIcs.SAND.2025.9, author = {Kurita, Kazuhiro and Marino, Andrea and Schoeters, Jason and Uno, Takeaki}, title = {{Spanner Enumeration for Temporal Graphs}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {9:1--9:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.9}, URN = {urn:nbn:de:0030-drops-230621}, doi = {10.4230/LIPIcs.SAND.2025.9}, annote = {Keywords: temporal graphs, temporal spanners, one-to-all connectivity, all-to-all connectivity enumeration, NP-completeness, Dual-hardness, binary partition tree, flashlight search, polynomial delay} }
Stefano Clemente and Caterina Feletti. Fault Detection and Identification by Autonomous Mobile Robots. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 10:1-10:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{clemente_et_al:LIPIcs.SAND.2025.10, author = {Clemente, Stefano and Feletti, Caterina}, title = {{Fault Detection and Identification by Autonomous Mobile Robots}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {10:1--10:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.10}, URN = {urn:nbn:de:0030-drops-230639}, doi = {10.4230/LIPIcs.SAND.2025.10}, annote = {Keywords: Autonomous mobile robots, Faulty robots, Look-Compute-Move, Fault detection, Fault identification, Round-robin} }
MIT Gadgets Group, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, and Jayson Lynch. Hardness of Traversing Gadget Systems with Small Bandwidth. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 11:1-11:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{mitgadgetsgroup_et_al:LIPIcs.SAND.2025.11, author = {MIT Gadgets Group and Demaine, Erik D. and Diomidova, Jenny and Gomez, Timothy and Hecher, Markus and Lynch, Jayson}, title = {{Hardness of Traversing Gadget Systems with Small Bandwidth}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {11:1--11:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.11}, URN = {urn:nbn:de:0030-drops-230648}, doi = {10.4230/LIPIcs.SAND.2025.11}, annote = {Keywords: Gadgets, Motion Planning, Parameterized Complexity, Hardness} }
Kamran Ayoubi and Lata Narayanan. Restless Exploration and Token Dissemination in Vertex-Permuted Temporal Graphs. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{ayoubi_et_al:LIPIcs.SAND.2025.12, author = {Ayoubi, Kamran and Narayanan, Lata}, title = {{Restless Exploration and Token Dissemination in Vertex-Permuted Temporal Graphs}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.12}, URN = {urn:nbn:de:0030-drops-230658}, doi = {10.4230/LIPIcs.SAND.2025.12}, annote = {Keywords: Temporal graphs, Vertex permuted graphs, Restless exploration, Periodic graphs, Token dissemination} }
Jion Hirose, Ryota Eguchi, and Yuichi Sudo. Self-Stabilizing Weakly Byzantine Perpetual Gathering of Mobile Agents. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 13:1-13:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{hirose_et_al:LIPIcs.SAND.2025.13, author = {Hirose, Jion and Eguchi, Ryota and Sudo, Yuichi}, title = {{Self-Stabilizing Weakly Byzantine Perpetual Gathering of Mobile Agents}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {13:1--13:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.13}, URN = {urn:nbn:de:0030-drops-230662}, doi = {10.4230/LIPIcs.SAND.2025.13}, annote = {Keywords: Distributed algorithms, Byzantine environments, Gathering} }
Asher Haun, Ryan Knobel, Adrian Salinas, Ramiro Santos, Robert Schweller, and Tim Wylie. Fractals in Seeded Tile Automata. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{haun_et_al:LIPIcs.SAND.2025.14, author = {Haun, Asher and Knobel, Ryan and Salinas, Adrian and Santos, Ramiro and Schweller, Robert and Wylie, Tim}, title = {{Fractals in Seeded Tile Automata}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {14:1--14:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.14}, URN = {urn:nbn:de:0030-drops-230677}, doi = {10.4230/LIPIcs.SAND.2025.14}, annote = {Keywords: self-assembly, tile automata, fractals} }
Anya Chaturvedi, Joshua J. Daymude, and Andréa W. Richa. On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{chaturvedi_et_al:LIPIcs.SAND.2025.15, author = {Chaturvedi, Anya and Daymude, Joshua J. and Richa, Andr\'{e}a W.}, title = {{On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.15}, URN = {urn:nbn:de:0030-drops-230687}, doi = {10.4230/LIPIcs.SAND.2025.15}, annote = {Keywords: Mutual exclusion, dynamic networks, message passing, concurrency} }
Anton Herrmann, Christian Komusiewicz, Nils Morawietz, and Frank Sommer. Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{herrmann_et_al:LIPIcs.SAND.2025.16, author = {Herrmann, Anton and Komusiewicz, Christian and Morawietz, Nils and Sommer, Frank}, title = {{Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.16}, URN = {urn:nbn:de:0030-drops-230695}, doi = {10.4230/LIPIcs.SAND.2025.16}, annote = {Keywords: NP-hard problem, FPT-algorithm, Treewidth, Color coding} }
William K. Moses Jr., Amanda Redlich, and Frederick Stock. Brief Announcement: Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 17:1-17:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{mosesjr._et_al:LIPIcs.SAND.2025.17, author = {Moses Jr., William K. and Redlich, Amanda and Stock, Frederick}, title = {{Brief Announcement: Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties \& Agents}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {17:1--17:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.17}, URN = {urn:nbn:de:0030-drops-230708}, doi = {10.4230/LIPIcs.SAND.2025.17}, annote = {Keywords: Mobile agents, mobile robots, broadcast, dynamic graph, dynamic network} }
Stefan Balev, Éric Sanlaville, and Antoine Toullalan. Brief Announcement: The Shortest Temporal Exploration Problem. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 18:1-18:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{balev_et_al:LIPIcs.SAND.2025.18, author = {Balev, Stefan and Sanlaville, \'{E}ric and Toullalan, Antoine}, title = {{Brief Announcement: The Shortest Temporal Exploration Problem}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {18:1--18:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.18}, URN = {urn:nbn:de:0030-drops-230716}, doi = {10.4230/LIPIcs.SAND.2025.18}, annote = {Keywords: Graph Theory, Temporal Graph, Temporal Graph Exploration} }
Leszek Gąsieniec, Łukasz Kuszner, Ehsan Latif, Ramviyas Parasuraman, Paul Spirakis, and Grzegorz Stachowiak. Brief Announcement: Anonymous Distributed Localisation via Spatial Population Protocols. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 19:1-19:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{gasieniec_et_al:LIPIcs.SAND.2025.19, author = {G\k{a}sieniec, Leszek and Kuszner, {\L}ukasz and Latif, Ehsan and Parasuraman, Ramviyas and Spirakis, Paul and Stachowiak, Grzegorz}, title = {{Brief Announcement: Anonymous Distributed Localisation via Spatial Population Protocols}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {19:1--19:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.19}, URN = {urn:nbn:de:0030-drops-230726}, doi = {10.4230/LIPIcs.SAND.2025.19}, annote = {Keywords: Population Protocols, Distributed Localisation} }
Nada Almalki, Siddharth Gupta, Othon Michail, and Andreas Padalkin. Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 20:1-20:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{almalki_et_al:LIPIcs.SAND.2025.20, author = {Almalki, Nada and Gupta, Siddharth and Michail, Othon and Padalkin, Andreas}, title = {{Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {20:1--20:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.20}, URN = {urn:nbn:de:0030-drops-230730}, doi = {10.4230/LIPIcs.SAND.2025.20}, annote = {Keywords: growth process, shrinking process, collision avoidance, programmable matter} }
Julia Meusel, Matthias Müller-Hannemann, and Klaus Reinhardt. Brief Announcement: Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 21:1-21:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{meusel_et_al:LIPIcs.SAND.2025.21, author = {Meusel, Julia and M\"{u}ller-Hannemann, Matthias and Reinhardt, Klaus}, title = {{Brief Announcement: Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {21:1--21:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.21}, URN = {urn:nbn:de:0030-drops-230747}, doi = {10.4230/LIPIcs.SAND.2025.21}, annote = {Keywords: Temporal graph, fastest temporal path, graph realization, periodic scheduling} }
Duncan Adamson. Brief Announcement: Exploring Word-Representable Temporal Graphs. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 22:1-22:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{adamson:LIPIcs.SAND.2025.22, author = {Adamson, Duncan}, title = {{Brief Announcement: Exploring Word-Representable Temporal Graphs}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {22:1--22:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.22}, URN = {urn:nbn:de:0030-drops-230755}, doi = {10.4230/LIPIcs.SAND.2025.22}, annote = {Keywords: Temporal Graphs, Word-Representable Graphs} }
Bin Fu, Timothy Gomez, Ryan Knobel, Austin Luchsinger, Aiden Massie, Marco Rodriguez, Adrian Salinas, Robert Schweller, and Tim Wylie. Brief Announcement: Reachability in Deletion-Only Chemical Reaction Networks. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 23:1-23:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{fu_et_al:LIPIcs.SAND.2025.23, author = {Fu, Bin and Gomez, Timothy and Knobel, Ryan and Luchsinger, Austin and Massie, Aiden and Rodriguez, Marco and Salinas, Adrian and Schweller, Robert and Wylie, Tim}, title = {{Brief Announcement: Reachability in Deletion-Only Chemical Reaction Networks}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {23:1--23:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.23}, URN = {urn:nbn:de:0030-drops-230768}, doi = {10.4230/LIPIcs.SAND.2025.23}, annote = {Keywords: CRN, Chemical Reaction Network, Reachability, Void Reactions} }
Tim Gomez, Elise Grizzell, Asher Haun, Ryan Knobel, Tom Peters, Robert Schweller, and Tim Wylie. Brief Announcement: Intrinsic Universality in Seeded Active Tile Self-Assembly. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 24:1-24:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{gomez_et_al:LIPIcs.SAND.2025.24, author = {Gomez, Tim and Grizzell, Elise and Haun, Asher and Knobel, Ryan and Peters, Tom and Schweller, Robert and Wylie, Tim}, title = {{Brief Announcement: Intrinsic Universality in Seeded Active Tile Self-Assembly}}, booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)}, pages = {24:1--24:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-368-3}, ISSN = {1868-8969}, year = {2025}, volume = {330}, editor = {Meeks, Kitty and Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.24}, URN = {urn:nbn:de:0030-drops-230772}, doi = {10.4230/LIPIcs.SAND.2025.24}, annote = {Keywords: Intrinsic Universality, Tile Automata, Cellular Automata, Self-assembly} }
Feedback for Dagstuhl Publishing