Program
Below is the overall program of SAND 2022. A printable version of the program is here. The event is online only. To register, go the registration page and follow the instructions. Within 24 hours of registering, you will receive an email explaining how to join the Zoom session. Inquiries can be sent at organization@sand-conf.org.
Note that all times are in UTC:+0 (Greenwich Mean Time)
March 28
| 15:50-16:00 | Introduction |
| 16:00-16:50 | Keynote: Paul Spirakis (University of Liverpool and University of Patras) (Chair: Paola Flocchini) Algorithmic Problems on Temporal Graphs |
| 16:50-17:00 | Break |
| 17:00-18:00 | Session 1: Population Protocols (Chair: Leszek Gasieniec) (Best Paper Award) Fast and Succinct Population Protocols for Presburger Arithmetic Philipp Czerner (Technical University of Munich), Roland Guttenberg (Technical University of Munich), Martin Helfrich (Technical University of Munich), Javier Esparza (Technical University of Munich) Dynamic Size Counting in Population Protocols David Doty (University of California, Davis), Mahsa Eftekhari (University of California, Davis) Loosely-Stabilizing Phase Clocks and the Adaptive Majority Problem Petra Berenbrink (University of Hamburg), Felix Biermeier (University of Hamburg), Christopher Hahn (University of Hamburg), Dominik Schallmoser (University of Hamburg) |
| 18:00-18:15 | Break |
| 18:15-19:30 | Session 2: Temporal and Dynamic Graph Algorithms I (Chair: Hendrik Molter) Parameterized Temporal Exploration Problems Thomas Erlebach (Durham University), Jakob Spooner (University of Leicester) Faster Exploration of some Temporal Graphs Duncan Adamson (Reykjavik University), Vladimir Gusev (University of Liverpool), Dmitriy Malyshev (Laboratory of Algorithms and Technologies for Network Analysis, HSE University), Viktor Zamaraev (University of Liverpool) Robustness of Distances and Diameter in a Fragile Network Arnaud Casteigts (University of Bordeaux), Timothée Corsini (University of Bordeaux), Hervé Hocquard (University of Bordeaux), Arnaud Labourel (Aix-Marseille University) Brief Announcement: The Temporal Firefighter Problem Samuel Hand (University of Glasgow), Jessica Enright (University of Glasgow), Kitty Meeks (University of Glasgow) |
March 29
| 16:00-16:50 | Keynote:
Roger Wattenhofer (ETH Zurich) (Chair: Andrea Richa) Networks, Dynamics, Algorithms, and Learning |
| 16:50-17:00 | Break |
| 17:00-18:00 | Session 3: Dynamic Networks and Distributed Algorithms (Chair: Rotem Oshman) Computing Outside the Box: Average Consensus over Dynamic Networks Bernadette Charron-Bost (CNRS, DIENS), Patrick Lambein-Monette (IRIF, Université de Paris) Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems Joshua Daymude (Arizona State University), Andrea Richa (Arizona State University), Christian Scheideler (University of Paderborn) Atomic Splittable Flow Over Time Games Antonia Adamik (Technische Universität Berlin - Institute of Mathematics), Leon Sering (ETH Zürich) |
| 18:00-18:15 | Break |
| 18:15-19:05 | Session 4: Mobile Computing and Robotics (Chair: Sándor Fekete) Search by a Metamorphic Robotic System in a Finite 3D Cubic Grid Ryonosuke Yamada (School of Information Science and Electrical Engineering, Kyushu University, Japan), Yukiko Yamauchi (Faculty of Information Science and Electrical Engineering, Kyushu University, Japan) Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model Irina Kostitsyna (TU Eindhoven), Christian Scheideler (University of Paderborn), Daniel Warner Brief Announcement: Cooperative Guarding in Polygons with Holes John Augustine (Indian Institute of Technology Madras), Srikkanth Ramachandran (Indian Institute of Technology Madras) |
| 19:05-20:00 | Business Meeting |
March 30
| 16:00-16:50 | Keynote: Monika Henzinger (University of Vienna) (Chair: Othon Michail) Recent Advances in Fully Dynamic Graph Algorithms |
| 16:50-17:00 | Break |
| 17:00-18:15 | Session 5: DNA Self-Assembly (Chair: Damien Woods) (Best Student Paper Award) Building Squares with Optimal State Complexity in Restricted Active Self-Assembly Robert M. Alaniz (University of Texas Rio Grande Valley), David Caballero (University of Texas Rio Grande Valley), Sonya C. Cirlos (University of Texas Rio Grande Valley), Timothy Gomez (University of Texas Rio Grande Valley), Elise Grizzell (University of Texas Rio Grande Valley), Andrew Rodriguez (University of Texas Rio Grande Valley), Robert Schweller (University of Texas Rio Grande Valley), Armando Tenorio (University of Texas Rio Grande Valley), Tim Wylie (University of Texas Rio Grande Valley) Complexity of Verification in Self-Assembly with Prebuilt Assemblies David Caballero (University of Texas Rio Grande Valley), Timothy Gomez (UTRGV), Robert Schweller (University of Texas - Rio Grande Valley), Tim Wylie (University of Texas - Rio Grande Valley) Simulating 3-Symbol Turing Machines with SIMD||DNA David Doty (University of California, Davis), Aaron Ong (University of California, Davis) Brief Announcement: Barrier-1 Reachability for Thermodynamic Binding Networks is PSPACE-complete Austin Luchsinger (University of Texas at Austin) |
| 18:15-18:30 | Break |
| 18:30-19:50 | Session 6 (in memory of Rolf Niedermeier): Temporal and Dynamic Graph Algorithms II (Chair: Arnaud Casteigts) Temporal Connectivity: Coping with Foreseen and Unforeseen Delays Eugen Füchsle (TU Berlin), Hendrik Molter (Ben Gurion University of the Negev), Rolf Niedermeier (TU Berlin), Malte Renken (TU Berlin) Temporal Unit Interval Independent Sets Danny Hermelin (Ben Gurion University of the Negev), Yuval Itzhaki (TU Berlin), Hendrik Molter (Ben Gurion University of the Negev), Rolf Niedermeier (TU Berlin) Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring Till Fluschnik (Technische Universität Berlin), Pascal Kunz (Technische Universität Berlin) Fully Dynamic Four-Vertex Subgraph Counting Kathrin Hanauer (University of Vienna), Monika Henzinger (University of Vienna), Qi Cheng Hua (University of Vienna) |
| 19:50-20:10 | Conference Closure |