default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th SAND 2026: Le Havre, France
- George B. Mertzios
, Andréa W. Richa:
5th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2026, Le Havre, France, July 1-3, 2026. LIPIcs 373, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2026, ISBN 978-3-95977-427-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xviii
- Paola Flocchini:
Pattern Formation, Dancing, and Sequential Schedulers (Invited Talk). 1:1-1:5 - Christian Scheideler:
Supervised Distributed Computing (Invited Talk). 2:1-2:1 - Jonas Köppeler, Maciej Pacut, Tamás Lévai, Vamsi Addanki, Stefan Schmid, Gábor Rétvári:
More Bang for the Buck: Superlinear Scaling with Distributed Self-Adjusting Systems (Invited Talk). 3:1-3:28 - Jessica A. Enright, Samuel D. Hand, Laura Larios-Jones, Kitty Meeks:
Families of Tractable Problems with Respect to Vertex-Interval-Membership Width and Its Generalisations. 4:1-4:17 - Guillaume Aubian, Filippo Brunelli, Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Allen Ibiapina, Laurent Viennot:
Complexity Gaps Between Point and Interval Temporal Graphs for Some Reachability Problems. 5:1-5:21 - Volker Turau:
Broadcasts in Anonymous, Dynamic Networks: A New Algorithm and Impossibility Results. 6:1-6:17 - Pierre Charbit, Michel Habib, Amalia Sorondo:
Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs. 7:1-7:16 - Mohamed Anouar Baaziz, Andrzej Pelc:
Asynchronous Rendezvous of Anonymous Deterministic Mobile Automata in the Plane. 8:1-8:14 - Michelle Döring, Jessica A. Enright, Laura Larios-Jones, George Skretas:
FO and MSO Model Checking on Temporal Graphs. 9:1-9:17 - Matthias Függer, Thomas Nowak:
Asymptotic Subspace Consensus in Dynamic Networks. 10:1-10:18 - Manish Kumar, Othon Michail, Andreas Padalkin, Christian Scheideler:
Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements. 11:1-11:17 - Noble C. Harasha, Nancy A. Lynch:
Nanobot Algorithms for Treatment of Diffuse Cancer. 12:1-12:17 - Anya Chaturvedi, William K. Moses Jr., Christian Scheideler, Prudence W. H. Wong:
Online Algorithms for Set Packing with Renewable Capacities. 13:1-13:15 - Jessica A. Enright, Thomas Erlebach, Kitty Meeks, Nils Morawietz:
Robust Temporal Cut. 14:1-14:17 - Thomas Bellitto, Jules Bouton Popper, Justine Cauvi, Bruno Escoffier, Raphaëlle Maistre-Matus:
Designing Sparse Temporal Graphs Satisfying Connectivity Requirements. 15:1-15:17 - David Ilcinkas, Nils Morawietz, Antoine Toullalan:
On Sufficient Conditions for Short Journeys in Temporal Graphs. 16:1-16:17 - Edina Marica, Clemens Thielen, Alina Wittmann:
Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem. 17:1-17:16 - François Bonnet, Quentin Bramas, Anissa Lamani:
Searching for an Eventually-Emerging Black Hole in Rings. 18:1-18:18 - Julia Meusel, Nils Morawietz, Matthias Müller-Hannemann, Klaus Reinhardt:
Minimize the Sum of Waiting Times in Periodic Temporal Trees. 19:1-19:14 - Duncan Adamson, Paul G. Spirakis:
Brief Announcement: Exploration of Always S-Connected Temporal Graphs. 20:1-20:6 - Julia Meusel, Nils Morawietz, Matthias Müller-Hannemann, Klaus Reinhardt:
Brief Announcement: Revisiting the Realizability of Periodic Temporal Graphs with Bounded Stretch. 21:1-21:6 - Thibaut Blanc, Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil:
Brief Announcement: Time-Travel Planning with Tenet Turnstiles. 22:1-22:6 - Shuchi Chawla, Kristin Sheridan:
Brief Announcement: A Special Case of Maximum Flow over Time with Network Changes. 23:1-23:6 - Arash Pourdamghani, Chen Avin, Stefan Schmid:
Brief Announcement: Demand-Aware Consistent Hashing with Bounded Loads & Greedy Routing. 24:1-24:6 - Daniel Warner, Christian Scheideler:
Brief Announcement: Fault-Tolerant 3D Leader Election in the Amoebot Model. 25:1-25:6 - Daniel Warner, Christian Scheideler:
Brief Announcement: Leader Election with Noisy Reconfigurable Circuits in the Amoebot Model. 26:1-26:6 - Garrett Parzych, Joshua J. Daymude:
Brief Announcement: Adaptive Self-Organization in Anonymous Dynamic Networks. 27:1-27: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 2026-08-22 01:35 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
