default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st SAND 2022 [virtual]
- James Aspnes, Othon Michail
:
1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference. LIPIcs 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-224-2 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk). 1:1-1:47 - Paul G. Spirakis:
Algorithmic Problems on Temporal Graphs (Invited Talk). 2:1-2:1 - Roger Wattenhofer:
Networks, Dynamics, Algorithms, and Learning (Invited Talk). 3:1-3:1 - Antonia Adamik, Leon Sering:
Atomic Splittable Flow Over Time Games. 4:1-4:16 - Duncan Adamson, Vladimir V. Gusev, Dmitriy S. Malyshev, Viktor Zamaraev:
Faster Exploration of Some Temporal Graphs. 5:1-5:10 - Robert M. Alaniz, David Caballero, Sonya C. Cirlos, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert T. Schweller, Armando Tenorio, Tim Wylie:
Building Squares with Optimal State Complexity in Restricted Active Self-Assembly. 6:1-6:18 - Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser:
Loosely-Stabilizing Phase Clocks and The Adaptive Majority Problem. 7:1-7:17 - David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie:
Complexity of Verification in Self-Assembly with Prebuilt Assemblies. 8:1-8:15 - Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel:
Robustness of Distances and Diameter in a Fragile Network. 9:1-9:16 - Bernadette Charron-Bost, Patrick Lambein-Monette:
Computing Outside the Box: Average Consensus over Dynamic Networks. 10:1-10:16 - Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Fast and Succinct Population Protocols for Presburger Arithmetic. 11:1-11:17 - Joshua J. Daymude, Andréa W. Richa, Christian Scheideler:
Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. 12:1-12:19 - David Doty, Mahsa Eftekhari:
Dynamic Size Counting in Population Protocols. 13:1-13:18 - David Doty, Aaron Ong:
Simulating 3-Symbol Turing Machines with SIMD||DNA. 14:1-14:15 - Thomas Erlebach, Jakob T. Spooner:
Parameterized Temporal Exploration Problems. 15:1-15:17 - Till Fluschnik, Pascal Kunz:
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. 16:1-16:18 - Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. 17:1-17:17 - Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua:
Fully Dynamic Four-Vertex Subgraph Counting. 18:1-18:17 - Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier:
Temporal Unit Interval Independent Sets. 19:1-19:16 - Ryonosuke Yamada, Yukiko Yamauchi:
Search by a Metamorphic Robotic System in a Finite 3D Cubic Grid. 20:1-20:16 - John Augustine, Srikkanth Ramachandran:
Brief Announcement: Cooperative Guarding in Polygons with Holes. 21:1-21:3 - Samuel D. Hand, Jessica A. Enright, Kitty Meeks:
Brief Announcement: The Temporal Firefighter Problem. 22:1-22:3 - Irina Kostitsyna, Christian Scheideler, Daniel Warner:
Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. 23:1-23:3 - Austin Luchsinger:
Brief Announcement: Barrier-1 Reachability for Thermodynamic Binding Networks Is PSPACE-Complete. 24:1-24:3
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 2024-11-07 20:39 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:
