default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd SAND 2024: Patras, Greece
- Arnaud Casteigts
, Fabian Kuhn:
3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, Patras, Greece, June 5-7, 2024. LIPIcs 292, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-315-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xii
- Thomas Erlebach:
Exploration and Rendezvous in Temporal Graphs (Invited Talk). 1:1-1:1 - Thomas Nowak:
Distributed Computation with Bacteria (Invited Talk). 2:1-2:1 - Andréa Werneck Richa:
Algorithmic Programmable Matter: From Local Markov Chains to "Dumb" Robots (Invited Talk). 3:1-3:1 - Duncan Adamson:
Harmonious Colourings of Temporal Matchings. 4:1-4:11 - Judith Beestermöller, Costas Busch, Roger Wattenhofer:
Fault-Tolerant Distributed Directories. 5:1-5:20 - Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal:
Black Hole Search in Dynamic Tori. 6:1-6:16 - Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil:
Online Space-Time Travel Planning in Dynamic Graphs. 7:1-7:14 - Esteban Christiann, Eric Sanlaville, Jason Schoeters:
On Inefficiently Connecting Temporal Networks. 8:1-8:19 - Matthew Connor, Othon Michail, George Skretas:
All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots. 9:1-9:20 - Riccardo Dondi, Manuel Lafond:
On the Complexity of Temporal Arborescence Reconfiguration. 10:1-10:15 - Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
Partial Temporal Vertex Cover with Bounded Activity Intervals. 11:1-11:14 - Thomas Erlebach, Nils Morawietz, Petra Wolf:
Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization. 12:1-12:16 - Caterina Feletti, Lucia Mambretti, Carlo Mereghetti, Beatrice Palano:
Computational Power of Opaque Robots. 13:1-13:19 - Christopher Hahn, Jonas Harbig, Peter Kling:
Forming Large Patterns with Local Robots in the OBLOT Model. 14:1-14:20 - Kristian Hinnenthal, David Liedtke, Christian Scheideler:
Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. 15:1-15:20 - Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Temporal Graph Realization from Fastest Paths. 16:1-16:18 - Shuma Kumamoto, Shuji Kijima, Tomoyuki Shirai:
An Analysis of the Recurrence/Transience of Random Walks on Growing Trees and Hypercubes. 17:1-17:17 - Andreas Padalkin, Manish Kumar, Christian Scheideler:
Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. 18:1-18:20 - Kévin Perrot, Sylvain Sené, Léah Tapin:
Complexity of Boolean Automata Networks Under Block-Parallel Update Modes. 19:1-19:19 - Avisek Sharma, Satakshi Ghosh, Pritam Goswami, Buddhadeb Sau:
Space and Move-Optimal Arbitrary Pattern Formation on Infinite Rectangular Grid by Oblivious Robot Swarm. 20:1-20:17 - Haozhi Zheng, Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue:
Gathering in Carrier Graphs: Meeting via Public Transportation System. 21:1-21:17 - Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Brief Announcement: Collision-Free Robot Scheduling. 22:1-22:5 - Nada Almalki, Siddharth Gupta, Othon Michail:
Brief Announcement: On the Exponential Growth of Geometric Shapes. 23:1-23:6 - Stefan Balev, Yoann Pigné, Eric Sanlaville, Mathilde Vernet:
Brief Announcement: The Dynamic Steiner Tree Problem: Definitions, Complexity, Algorithms. 24:1-24:6 - Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil:
Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents. 25:1-25:5 - Siddharth Gupta, Marc J. van Kreveld, Othon Michail, Andreas Padalkin:
Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. 26:1-26:5 - George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs. 27:1-27:5
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-05-29 23:50 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
