PODC Archives

ACM PODC Participants List

PODC@LISTSERV.ACM.ORG

Options: Use Classic View

Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

Topic: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Othon Michail <[log in to unmask]>
Wed, 22 Sep 2021 15:42:33 +0000
text/plain (333 lines)
======================================

SAND 2022: Call for Papers

======================================



1st Symposium on Algorithmic Foundations of Dynamic Networks

February 2022 (tentative), online-only event due to the pandemic



https://www.sand-conf.org/

Twitter: https://twitter.com/SANDconference



New and firm deadline: November 15, 2021 (AoE)



======================================

Important Dates

======================================



Submission deadline:   November 15th, 2021    (23:59 AoE)

Notification:                   end January 2022



======================================

Scope

======================================



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. 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

======================================



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 (https://submission.dagstuhl.de/documentation/authors) with



\documentclass[a4paper,anonymous,USenglish]{lipics-v2019}.



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 [1], they should use, the result of [1]). 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 rejected.



======================================

Publication

======================================



The conference proceedings will be published by LIPIcs. The final version of the paper must 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).



Extended and revised versions of selected papers will be considered for a special issue of the Journal of Computer and System Sciences.



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.



======================================

Awards

======================================



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, the nominated authors should be full time students at the time of submission and should have 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. The program committee may decline to make these awards or may decide to split them.



======================================

Organization

======================================



Program Committee:

- James Aspnes (co-chair), Yale University, USA

- Luca Becchetti, University of Rome Sapienza, Italy

- Petra Berenbrink, University of Hamburg, Germany

- Janna Burman, Université Paris-Sud – LRI, France

- Arnaud Casteigts, University of Bordeaux, France

- Keren Censor-Hillel, Technion, Israel

- Andrea Clementi, University of Rome Tor Vergata, Italy

- Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy

- David Doty, University of California, Davis, USA

- Yuval Emek, Technion, Israel

- Thomas Erlebach, University of Leicester, UK

- Sándor Fekete, TU Braunschweig, Germany

- Paola Flocchini, University of Ottawa, Canada

- David Ilcinkas, CNRS, Bordeaux, France

- Zvi Lotker, Bar Ilan University, Israel

- Toshimitsu Masuzawa, Osaka University, Japan

- George Mertzios, Durham University, UK

- Othon Michail (co-chair), University of Liverpool, UK

- Rolf Niedermeier, TU Berlin, Germany

- Rotem Oshman, Tel Aviv University, Israel

- Andrea Richa, Arizona State University, USA

- Nicola Santoro, Carleton University, Canada

- Christian Scheideler, University of Paderborn, Germany

- David Soloveichik, University of Texas at Austin, USA

- Paul Spirakis, University of Liverpool, UK

- Damien Woods, Maynooth University, Ireland

- Viktor Zamaraev, University of Liverpool, UK

- Christos Zaroliagis, University of Patras, Greece



Organizing Committee:

- James Aspnes, Yale University, USA (PC chair)

- Othon Michail, University of Liverpool, UK (PC chair)

- Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy (General chair)

- Viktor Zamaraev, University of Liverpool, UK (General chair)

- George Skretas, University of Liverpool, UK (Publicity chair)



Steering Committee:

- Paola Flocchini, University of Ottawa, Canada (chair)

- James Aspnes, Yale University, USA (PC chair 2022)

- Othon Michail, University of Liverpool, UK (PC chair 2022)

- Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy (General chair 2022)

- Viktor Zamaraev, University of Liverpool, UK (General chair 2022)

- Giuseppe Prencipe, Pisa University, Italy (Treasurer)



Advisory Board:

- James Aspnes, Yale University, USA

- Luca Becchetti, University of Rome Sapienza, Italy

- Arnaud Casteigts, University of Bordeaux, France

- Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy

- Paola Flocchini, University of Ottawa, Canada

- George Mertzios, Durham University, UK

- Othon Michail, University of Liverpool, UK

- Rolf Niedermeier, TU Berlin, Germany

- Rotem Oshman, Tel Aviv University, Israel

- Nicola Santoro, Carleton University, Canada

- Paul Spirakis, University of Liverpool, UK

- Viktor Zamaraev, University of Liverpool, UK



------

Best regards,



James Aspnes and Othon Michail

PC chairs, SAND 2022

############################


Unsubscribe:

[log in to unmask]

If you don't already have a password for the LISTSERV.ACM.ORG server, we recommend
that you create one now. A LISTSERV password is linked to your email
address and can be used to access the web interface and all the lists to
which you are subscribed on the LISTSERV.ACM.ORG server.

To create a password, visit:

https://LISTSERV.ACM.ORG/SCRIPTS/WA-ACMLPX.CGI?GETPW1

Once you have created a password, you can log in and view or change your
subscription settings at:

https://LISTSERV.ACM.ORG/SCRIPTS/WA-ACMLPX.CGI?SUBED1=PODC

ATOM RSS1 RSS2