SAND 3rd edition (2024)
June 5-7, 2024
University of Patras, GREECE
University of Patras, GREECE
| Home | CFP | Accepted | Program | Venue | Registration |
The SAND 2024 Conference Programme consists of 18 regular papers and 6 brief announcements. For their presentations, regular papers are provided with 25-minutes slots and brief announcements are provided with 10-minutes slots.
The list of all the SAND 2024 accepted papers (with/without abstracts) are provided here.
| [ Wednesday ][ Thursday ][ Friday ] |
| 08:30 -- 08:50 | Registration |
| 08:50 -- 09:00 | Welcome & Introduction |
| 9:00 -- 10:00 | Invited Talk 1 |
| Thomas Erlebach (University of Durham): Exploration and Rendezvous in Temporal Graphs. | |
| 10:00 -- 10:30 | Coffee Break |
| 10:30 -- 11:30 | SESSION 1: Temporal Graphs I |
| (R1) Nina Klobas, George Mertzios, Hendrik Molter and Paul Spirakis: Temporal graph realization from fastest paths. | |
| (R2) Thomas Erlebach, Nils Morawietz and Petra Wolf: Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization. | |
| (B1) George Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos and Paul Spirakis: On the existence of delta-temporal cliques in random simple temporal graphs. | |
| 11:30 -- 12:30 | SESSION 2: Open Problems I |
| 12:30 -- 14:30 | Lunch Break |
| 14:30 -- 15:40 | SESSION 3: Mobile agents / robots / exploration |
| (R3) Adri Bhattacharya, Giuseppe Francesco Italiano and Partha Sarathi Mandal: Black Hole Search in Dynamic Tori. | |
| (R4) Shuma Kumamoto, Shuji Kijima and Tomoyuki Shirai: An Analysis of the Recurrence/Transience of Random Walks on Growing Trees and Hypercubes. | |
| (B2) Duncan Adamson, Nathan Flaherty, Igor Potapov and Paul G. Spirakis: Collision-Free Robot Scheduling. | |
| (B3) Quentin Bramas, Toshimitsu Masuzawa and Sebastien Tixeuil: Crash-tolerant Exploration of Trees by Energy Sharing Mobile Agents. | |
| 15:40 -- 16:15 | Coffee Break |
| 16:15 -- 17:30 | SESSION 4: Diverse Topics |
| (R5) Kévin Perrot, Sylvain Sené and Léah Tapin: Complexity of Boolean automata networks under block-parallel update modes. | |
| (R6) Judith Beestermöller, Costas Busch and Roger Wattenhofer: Fault-Tolerant Distributed Directories. | |
| (R7) Riccardo Dondi and Manuel Lafond: On the Complexity of Temporal Arborescence Reconfiguration. | |
| 17:30 -- 18:30 | SESSION 5: Open Problems II, Interaction / Research |
| 18:30 -- 19:30 | Welcome Reception |
| 09:00 -- 10:00 | Invited Talk 2 |
| Thomas Nowak (ENS Paris-Saclay): Distributed Computation with Bacteria. | |
| 10:00 -- 10:30 | Coffee Break |
| 10:30 -- 11:45 | SESSION 6: Mobile robots / Swarm robotics / Shape formation |
| (R8) Christopher Hahn, Jonas Harbig and Peter Kling: Forming Large Patterns with Local Robots in the OBLOT Model. | |
| (R9) Avisek Sharma, Satakshi Ghosh, Pritam Goswami and Buddhadeb Sau: Space and Move-optimal Arbitrary Pattern Formation on infinite rectangular grid by oblivious robot swarm. | |
| (R10) Caterina Feletti, Lucia Mambretti, Carlo Mereghetti and Beatrice Palano: Computational Power of Opaque Robots. | |
| 11:45 -- 12:30 | SESSION 7: Open Problems III |
| 12:30 -- 14:30 | Lunch Break |
| 14:30 -- 15:30 | SESSION 8: Temporal graphs II |
| (R11) Quentin Bramas, Jean-Romain Luttringer and Sebastien Tixeuil: Online Space-time Travel Planning in Dynamic Graphs. | |
| (R12) Haozhi Zheng, Ryota Eguchi, Fukuhito Ooshita and Michiko Inoue: Gathering in Carrier Graphs: Meeting via Public Transportation System. | |
| (B4) Stefan Balev, Yoann Pigné, Eric Sanlaville and Mathilde Vernet: The Dynamic Steiner Tree problem: definitions, complexity, algorithms. | |
| 15:30 -- 16:00 | Coffee Break |
| 16:00 -- 17:30 | Business Meeting |
| 18:00 -- 22:00 | Social Event |
| 09:00 -- 10:00 | Invited Talk 3 |
| Andrea Richa (Arizona State University): Algorithmic Programmable Matter: From Local Markov Chains to “Dumb” Robots. | |
| 10:00 -- 10:25 | Coffee Break |
| 10:25 -- 12:00 | SESSION 9: Programmable matter / Shape formation |
| (R13) Andreas Padalkin, Manish Kumar and Christian Scheideler: Shape Formation and Locomotion with Joint Movements in the Amoebot Model. | |
| (R14) Matthew Connor, Othon Michail and George Skretas: All for one and one for all: An O(1)-Musketeers Universal Transformation for Rotating Robots. | |
| (R15) Kristian Hinnenthal, David Liedtke and Christian Scheideler: Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. | |
| (B5) Nada Almalki, Siddharth Gupta and Othon Michail: On the Exponential Growth of Geometric Shapes. | |
| (B6) Siddharth Gupta, Marc van Kreveld, Othon Michail and Andreas Padalkin: Collision Detection for Modular Robots -- it is easy to cause collisions and hard to avoid them. | |
| 12:00 -- 13:30 | Lunch Break |
| 13:30 -- 14:45 | SESSION 10: Temporal graphs III |
| (R16) Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli and Alessandra Tappini: Partial Temporal Vertex Cover with Bounded Activity Intervals. | |
| (R17) Duncan Adamson: Harmonious Colourings of Temporal Matchings. | |
| (R18) Esteban Christiann, Eric Sanlaville and Jason Schoeters: On inefficiently connecting temporal networks. | |
| 14:45 | End of the SAND 2024 Conference |