||November 15th, 2021 (23:59 AoE)|
||January 31, 2022|
||Tentative||March, 28-30 2022 - online-only event due to the pandemic|
All deadlines are (23:59 AoE) UTC -12h ("anywhere on Earth").
The submission site is open. Submissions must be sent using easychair (https://easychair.org/conferences/?conf=sand2022).
We are pleased to announce the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND).
The objective of SAND is to provide a primary venue for the presentation and discussion of research on fundamental aspects of computing in dynamic networks, bringing together researchers from Computer Science and related areas.
Nowadays, there is a growing interest in understanding the theoretical aspects of networked systems that are highly dynamic. In these networks, the topology and/or the set of computational entities change with time and, thus, time becomes an integral part of the network. Dynamicity is no longer only obtained from events that are sporadic and spatially isolated, such as failures or the creation of a new physical link in a wired network, but is due to frequent and diffuse phenomena in the modeled environment (e.g., mobility of the computational entities or instability of the wireless medium).
From the perspective of the algorithm designer, dynamic networks are a source of new challenges and opportunities. Traditional centralized optimization approaches and graph theoretic concepts are no longer suitable and need to be redefined, as they do not take a time dimension into account. Problems typically become much harder to solve and, in many cases, totally different from their static counterparts, requiring radically different approaches. At the same time, the designer of distributed algorithms has to find novel ways to address the problems introduced by the local and global uncertainties, imposed by the high dynamicity and the unpredictable nature of network dynamics.
A variety of both modern and traditional systems can be naturally modeled and analyzed through dynamic networks. Examples include modern wireless communications (e.g., the mobile Internet, the Internet of Things, and Wireless Sensor Networks), social interactions, transportation, molecular interaction, and chemical reaction networks, and robot collectives.
Focusing on the theory, design, analysis, and application of computing in dynamic networks, SAND seeks high-quality results characterized by a marked algorithmic aspect that shed insights on the computability landscape for dynamic environments or that can be foundational for practical and impactful systems. SAND aims at bringing together researchers from Computer Science and related areas such as Mathematics, Complex Systems, Sociology, Transportations, Robotics, Physics, and Biology to present and discuss original research at the intersection of Algorithms and Dynamic Networks and Systems.
We encourage contributions from all viewpoints, including theory and practice, addressing or being motivated by the role of dynamics in computing. We welcome both conceptual and technical contributions, as well as novel ideas and new problems that will inspire the community and facilitate the further growth of the area.
Topics of interest include, but are not limited to:
- Temporal graphs
- Continuous models of dynamic networks
- Geometric dynamic models
- Reconfigurable and swarm robotics, programmable matter, DNA self-assembly
- Population protocols and chemical reaction networks
- Distributed computation in dynamic networks
- Multilayer, peer-to-peer and overlay networks
- Randomness in dynamic networks
- Wireless networks, mobile computing, autonomous agents
- Streaming models
- Boolean networks
- Information spreading, gossiping, epidemics
- IoT, Cloud, Edge/Fog computing
- Computability and Complexity within dynamic networks
- Offline and online algorithms for dynamic networks
- Learning approaches for dynamic networks
- Complex systems, social and transportation networks
- Fault-tolerance, network self-organization and formation
- New models for dynamic networks
- Bio-inspired, physical, and chemical dynamic models
Paper Submission Information
Papers should be submitted electronically through Easychair (https://easychair.org/conferences/?conf=sand2022).
A submission must be original research and reporting on novel results that have not appeared previously in/(or are concurrently submitted to) a journal or a conference with published proceedings. Submissions must be in English in pdf format and they must be prepared using the LaTeX style template for LIPIcs (instructions at https://submission.dagstuhl.de/documentation/authors)
Submissions must be anonymous, without any author names, affiliations, or email addresses. A submission must not exceed 15 pages, excluding the references. Additional details can be provided in a clearly marked appendix. Note that reviewers are not required to read the appendices. Submissions deviating from the above guidelines will be rejected without consideration of their merits.
The program committee may decide that some of the papers not selected for publication are suitable for publication in the brief announcement format. Any authors who do not wish their paper to be considered for the brief announcement format in case of rejection, are asked to clearly indicate this on the first page of their submission.
Instructions for Double-Blind Review
The reviewing process is double-blind, the authors’ names must not be included in the paper, and the writing of the manuscript should be done in such a way to not de-anonymize authors (e.g., instead of, our result , they should use, the result of ). We assume that reviewers do not actively try to recognize the authors. Therefore, authors are allowed to publish their results on pre-print services before or at any point of the submission/reviewing process. Non-anonymous submissions will be desk rejected.
Submissions must follow the LaTeX style template for LIPIcs (see https://submission.dagstuhl.de/documentation/authors).
The conference proceedings will be published by LIPIcs. The final version of the paper has to be formatted following the LIPIcs guidelines (https://submission.dagstuhl.de/documentation/authors). Papers accepted in full will have 15 pages in the final proceedings (excluding references). Any papers accepted in the brief announcement format will have 3 pages in the final proceedings (including everything).
For every accepted regular paper and brief announcement, at least one of the authors must fully register and present the paper during the conference and according to the conference program. Any paper accepted but not presented will be withdrawn from the final proceedings.
Extended and revised versions of selected papers will be considered for a special issue of the Journal of Computer and System Sciences.
All papers are eligible for the best paper award. Papers co-authored by full-time students may also be eligible for the best student paper award. For a paper to be considered for the best student paper award, at least one of its authors should be a full-time student at the time of submission and should have made a significant contribution to the paper. In case the authors think that their paper is eligible for the best student paper award, they should clearly indicate this on the first page of their submission and briefly justify (without disclosing their identities). The program committee may decline to make these awards or may decide to split them.