default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th SAND 2025: Liverpool, UK
- Kitty Meeks
, Christian Scheideler:
4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-368-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:viii
- Philipp Czerner, Vincent Fischer, Roland Guttenberg:
The Expressive Power of Uniform Population Protocols with Logarithmic Space. 1:1-1:18 - Henri Froese, Martin Hoefer, Lisa Wilhelmi:
Dynamic Debt Swapping in Financial Networks. 2:1-2:16 - Thomas Bellitto, Jules Bouton Popper, Bruno Escoffier:
Temporal Connectivity Augmentation. 3:1-3:16 - Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger:
On b-Matching and Fully-Dynamic Maximum k-Edge Coloring. 4:1-4:23 - Flavio T. Principato, Javier Esparza, Philipp Czerner:
Undecidability of the Emptiness Problem for Weak Models of Distributed Computing. 5:1-5:14 - Daniele Carnevale, Arnaud Casteigts, Timothée Corsini:
Dismountability in Temporal Cliques Revisited. 6:1-6:18 - David C. Kutner, Anouk Sommer:
Better Late, Then? The Hardness of Choosing Delays to Meet Passenger Demands in Temporal Graphs. 7:1-7:18 - Lapo Cioni, Riccardo Dondi, Andrea Marino, Jason Schoeters, Ana Silva:
Matching and Edge Cover in Temporal Graphs. 8:1-8:16 - Kazuhiro Kurita, Andrea Marino, Jason Schoeters, Takeaki Uno:
Spanner Enumeration for Temporal Graphs. 9:1-9:21 - Stefano Clemente, Caterina Feletti:
Fault Detection and Identification by Autonomous Mobile Robots. 10:1-10:20 - MIT Gadgets Group, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Jayson Lynch:
Hardness of Traversing Gadget Systems with Small Bandwidth. 11:1-11:16 - Kamran Ayoubi, Lata Narayanan:
Restless Exploration and Token Dissemination in Vertex-Permuted Temporal Graphs. 12:1-12:17 - Jion Hirose, Ryota Eguchi, Yuichi Sudo:
Self-Stabilizing Weakly Byzantine Perpetual Gathering of Mobile Agents. 13:1-13:18 - Asher Haun, Ryan Knobel, Adrian Salinas, Ramiro Santos, Robert T. Schweller, Tim Wylie:
Fractals in Seeded Tile Automata. 14:1-14:17 - Anya Chaturvedi, Joshua J. Daymude, Andréa W. Richa:
On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks. 15:1-15:16 - Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions. 16:1-16:18 - William K. Moses Jr., Amanda Redlich, Frederick Stock:
Brief Announcement: Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents. 17:1-17:5 - Stefan Balev, Eric Sanlaville, Antoine Toullalan:
Brief Announcement: The Shortest Temporal Exploration Problem. 18:1-18:5 - Leszek Gasieniec, Lukasz Kuszner, Ehsan Latif, Ramviyas Parasuraman, Paul G. Spirakis, Grzegorz Stachowiak:
Brief Announcement: Anonymous Distributed Localisation via Spatial Population Protocols. 19:1-19:5 - Nada Almalki, Siddharth Gupta, Othon Michail, Andreas Padalkin:
Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. 20:1-20:6 - Julia Meusel, Matthias Müller-Hannemann, Klaus Reinhardt:
Brief Announcement: Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases. 21:1-21:5 - Duncan Adamson:
Brief Announcement: Exploring Word-Representable Temporal Graphs. 22:1-22:6 - Bin Fu, Timothy Gomez, Ryan Knobel, Austin Luchsinger, Aiden Massie, Marco Rodriguez, Adrian Salinas, Robert T. Schweller, Tim Wylie:
Brief Announcement: Reachability in Deletion-Only Chemical Reaction Networks. 23:1-23:6 - Timothy Gomez, Elise Grizzell, Asher Haun, Ryan Knobel, Tom Peters, Robert T. Schweller, Tim Wylie:
Brief Announcement: Intrinsic Universality in Seeded Active Tile Self-Assembly. 24:1-24:6
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-26 07:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
