SAND 3rd edition (2024)
June 5-7, 2024
University of Patras, GREECE
University of Patras, GREECE
| Home | CFP | Accepted | Program | Venue | Registration |
| (REG) | Temporal graph realization from fastest paths |
| Nina Klobas, George Mertzios, Hendrik Molter and Paul Spirakis |
| (REG) | Computational Power of Opaque Robots |
| Caterina Feletti, Lucia Mambretti, Carlo Mereghetti and Beatrice Palano |
| (REG) | Harmonious Colourings of Temporal Matchings |
| Duncan Adamson |
| (REG) | Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization |
| Thomas Erlebach, Nils Morawietz and Petra Wolf |
| (REG) | On the Complexity of Temporal Arborescence Reconfiguration |
| Riccardo Dondi and Manuel Lafond |
| (REG) | Reconfiguration and Locomotion with Joint Movements in the Amoebot Model |
| Andreas Padalkin, Manish Kumar and Christian Scheideler |
| (REG) | An Analysis of the Recurrence/Transience of Random Walks on Growing Trees and Hypercubes |
| Shuma Kumamoto, Shuji Kijima and Tomoyuki Shirai |
| (REG) | All for one and one for all: An O(1)-Musketeers Universal Transformation for Rotating Robots |
| Matthew Connor, Othon Michail and George Skretas |
| (REG) | Fault-Tolerant Distributed Directories |
| Judith Beestermöller, Costas Busch and Roger Wattenhofer |
| (REG) | Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures |
| Kristian Hinnenthal, David Liedtke and Christian Scheideler |
| (REG) | Space and Move-optimal Arbitrary Pattern Formation on infinite rectangular grid by oblivious robot swarm |
| Avisek Sharma, Satakshi Ghosh, Pritam Goswami and Buddhadeb Sau |
| (REG) | Complexity of Boolean automata networks under block-parallel update modes |
| Kévin Perrot, Sylvain Sené and Léah Tapin |
| (REG) | Online Space-time Travel Planning in Dynamic Graphs |
| Quentin Bramas, Jean-Romain Luttringer and Sebastien Tixeuil |
| (REG) | Black Hole Search in Dynamic Tori |
| Adri Bhattacharya, Giuseppe Francesco Italiano and Partha Sarathi Mandal |
| (REG) | Gathering in Carrier Graphs: Meeting via Public Transportation System |
| Haozhi Zheng, Ryota Eguchi, Fukuhito Ooshita and Michiko Inoue |
| (REG) | Partial Temporal Vertex Cover with Bounded Activity Intervals |
| Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli and Alessandra Tappini |
| (REG) | Forming Large Patterns with Local Robots in the OBLOT Model |
| Christopher Hahn, Jonas Harbig and Peter Kling |
| (REG) | On inefficiently connecting temporal networks |
| Esteban Christiann, Eric Sanlaville and Jason Schoeters |
| (BA) | Collision Detection for Modular Robots -- it is easy to cause collisions and hard to avoid them |
| Siddharth Gupta, Marc van Kreveld, Othon Michail and Andreas Padalkin |
| (BA) | Collision-Free Robot Scheduling |
| Duncan Adamson, Nathan Flaherty, Igor Potapov and Paul G. Spirakis |
| (BA) | Crash-tolerant Exploration of Trees by Energy Sharing Mobile Agents |
| Quentin Bramas, Toshimitsu Masuzawa and Sebastien Tixeuil |
| (BA) | On the Exponential Growth of Geometric Shapes |
| Nada Almalki, Siddharth Gupta and Othon Michail |
| (BA) | The Dynamic Steiner Tree problem: definitions, complexity, algorithms |
| Stefan Balev, Yoann Pigné, Eric Sanlaville and Mathilde Vernet |
| (BA) | On the existence of $\delta$-temporal cliques in random simple temporal graphs |
| George Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos and Paul Spirakis |