[Proof Complexity] CFP: ALGOSENSORS 2019 (deadline June 3)

Theofanis Raptis theofanis.raptis at iit.cnr.it
Tue Apr 16 15:59:40 CEST 2019

ALGOSENSORS 2019 Call for Papers
September 12-13, 2019
Munich, Germany

Submission Deadline: June 3, 2019 (AoE)
Notification: July 22, 2019

Submissions are sought in all areas of wireless networking, broadly 
construed, including both theoretical and experimental perspectives. 
This year ALGOSENSORS has two tracks (see below for the program 

- Algorithms & Theory
- Experiments & Applications

Each paper may be submitted to only one track. Topics of interest 
include, but are not limited to:

    Ad Hoc Networks
    Communication Protocols
    Complexity and Computability
    Computational Models
    Cryptography, Security and Trust
    Cyber Physical Systems
    Data Aggregation and Fusion
    Energy Management
    Experimental Analysis
    Fault Tolerance and Dependability
    Game Theoretic Aspects
    Infrastructure Discovery
    Internet of Things (IoT)
    Medium Access Control
    Mobility & Dynamics
    Pattern Formation
    Performance Evaluation
    Power Saving Schemes
    Resource Efficiency
    RFID Algorithms
    Routing and Data Propagation
    Self-stabilization, Self-* Properties
    Sensor Networks
    Swarm Computing
    Systems and Testbeds
    Time Synchronization
    Topology Control
    Virtual Infrastructures
    Wireless Networks


Papers are to be submitted electronically using the EasyChair server at:


The submissions must contain original results that have not already been 
published and are not concurrently submitted to a journal or conference 
with published proceedings. Each paper should select one of the two 
tracks (Algorithms & Theory or Experiments & Applications). Authors need 
to ensure that for each accepted paper at least one author will register 
and attend the symposium.

Submissions are limited to twelve (12) single-column pages in the LNCS 
format. This includes figures, but excludes references and an optional 
appendix (to be read at the program committee's discretion). Authors 
should consult Springer’s authors’ guidelines and use their proceedings 
templates, either for LaTeX or for Word, for the preparation of their 

Accepted papers will be published as ALGOSENSORS 2019 post-proceedings 
in the Springer LNCS series. Springer encourages authors to include 
their ORCIDs in their papers. In addition, the corresponding author of 
each paper, acting on behalf of all of the authors of that paper, must 
complete and sign a Consent-to-Publish form. The corresponding author 
signing the copyright form should match the corresponding author marked 
on the paper. Once the files have been sent to Springer, changes 
relating to the authorship of the papers cannot be made.


The best paper from each track will be given a Best Paper Award.

Program Committee:

PC Chairs

Falko Dressler, Paderborn University (Experiments and Applications 
Christian Scheideler, Paderborn University (Algorithms and Theory Track)

PC Algorithms and Theory Track

Matthew Andrews, Nokia Bell Labs
Amotz Bar-Noy, Brooklyn College
Costas Busch, Louisiana State University
Ioannis Chatzigiannakis, University of Rome La Sapienza
Bogdan Chlebus, University of Colorado Denver
Shantanu Das, Aix-Marseille University
Sandor Fekete, TU Braunschweig
Jie Gao, SUNY Stony Brook
Bernhard Häupler, Carnegie Mellon University
Taisuke Izumi, Nagoya Institute of Technology
Irina Kostitsyna, TU Eindhoven
Evangelos Kranakis, Carleton University
Christian Scheideler, Paderborn University (chair)
Michael Segal, Ben-Gurion University of the Negev
Tigran Tonoyan, Reykjavik University

PC Experiments and Applications Track

Aaron Becker, University of Houston
Naveed Anwar Bhatti, U.P. Milano
Berk Canberk, Northeastern University
Yingying Chen, Rutgers University
Xiuzhen Cheng, George Washington University
Kaushik R. Chowdhury, Northeastern University
Falko Dressler, Paderborn University (chair)
Olaf Landsiedel, University of Kiel
Mo Li, Nanyang Technological University
Chiara Petrioli, University of Rome La Sapienza
Marina Petrova, KTH Royal Institute of Technology

More information about the Proof-Complexity mailing list