Monday, July 26, 2021

[DMANET] Postdoctoral Position in Algorithms at the University of Bonn

Postdoctoral Position in Algorithms
University of Bonn

A postdoctoral position is available in the Algorithms Group at the
Department of Computer Science at the University of Bonn, Germany. The
group consists currently of three faculty members (Anne Driemel, Thomas
Kesselheim, Heiko Röglin), several postdocs and PhD students.

The position will be for three years initially with the possibility of
extension. The postdoc may pursue his/her own line of research but a
focus related to the existing research areas of the group is very welcome.

The successful candidate should have a PhD degree in computer science or
mathematics and should have a strong publication record in Theoretical
Computer Science.

Applications will be reviewed starting from August 1, 2021 until the
position is filled. The envisioned starting date is fall 2021, but
other starting dates may be negotiable.

Please send your application (including a cover letter, a curriculum
vitae, a list of publications, and the names and contact information of
at least two references) to the address below. Electronic submissions
are highly encouraged (please attach relevant documents as pdf).

Heiko Röglin
Universität Bonn
Institut für Informatik
Friedrich-Hirzebruch-Allee 8
53113 Bonn, Germany
Email: roeglin@cs.uni-bonn.de
http://www.roeglin.org
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

RAMiCS 2021 - Call for short contributions/posters

CALL FOR SHORT CONTRIBUTIONS / POSTERS

19th International Conference on
Relational and Algebraic Methods in Computer Science
RAMiCS 2021

2 to 5 November 2021, Marseille, France
https://ramics19.lis-lab.fr/

Additionally to the standard CfP, RAMiCS is also calling for short
contributions and posters. We are hence calling for presentations of
original, unfinished, already published, or otherwise interesting work
within the topics of the RAMiCS conferences. The submission can be in
the form of a poster, an abstract, a paper submitted to or published
at another conference, etc. Short contributions will *not* be
published in the conference proceedings.

IMPORTANT DATES:

Submission: 29 August 2021
Notification: 5 September 2021
RAMiCS registration: 12 September 2021

INVITED SPEAKERS:

Marcelo Frias, Instituto Tecnológico de Buenos Aires, Argentina
Barbara König, Universität Duisburg-Essen, Germany
Dmitriy Zhuk, Moscow State University, Russia

GENERAL INFORMATION:

Since 1994, the RAMICS conference series has been the main venue for
research on relation algebras, Kleene algebras and similar algebraic
formalisms, and their applications as conceptual and methodological
tools in computer science and beyond.

TOPICS:

We invite short submissions in the general fields of algebras relevant
to computer science and applications of such algebras. Topics include
but are not limited to:

* Theory
- algebras such as semigroups, residuated lattices, semirings,
Kleene algebras, relation algebras and quantales
- their connections with program logics and other logics
- their use in the theories of automata, concurrency, formal languages,
games, networks and programming languages
- the development of algebraic, algorithmic, category-theoretic,
coalgebraic and proof-theoretic methods for these theories
- their formalisation with theorem provers

* Applications
- tools and techniques for program correctness, specification and
verification
- quantitative and qualitative models and semantics of computing
systems and processes
- algorithm design, automated reasoning, network protocol analysis,
social choice, optimisation and control
- industrial applications

SUBMISSION INSTRUCTIONS:

Please send your short submission as a single pdf file to

ramics2021@easychair.org

by 29 August 2021.

ORGANIZERS:

Luigi Santocanale, Aix-Marseille University, France
Uli Fahrenberg, École polytechnique, France
Mai Gehrke, Université Côte d'Azur, France
Michael Winter, Brock University, Canada

Call for Posters: Graph Drawing and Network Visualization GD 2021

Sorry if you have received multiple copies of this email
================================================================

Call for Posters

GD 2021

29th International Symposium on
Graph Drawing and Network Visualization

September 14-17, 2021 - Tuebingen, Germany
https://algo.inf.uni-tuebingen.de/gd2021/

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

Graph Drawing is concerned with the geometric representation of graphs and constitutes the algorithmic core of Network Visualization. Graph Drawing and Network Visualization are motivated by applications where it is crucial to visually analyze and interact with relational datasets. Examples of such application areas include data science, social sciences, web computing, information systems, biology, geography, business intelligence, information security, or software engineering.

GD has been the main annual event in this area for more than 20 years. Its focus is on combinatorial and algorithmic aspects of graph drawing as well as the design of network visualization systems and interfaces. Researchers and practitioners working on any aspects of graph drawing and network visualization are invited to contribute posters and to participate in the symposium and the graph drawing contest.

GD2021 will be held (hopefully) at Tuebingen from September 14 to 17, 2021 with a reception on the evening of September 14. A pre-conference PhD school is planned for September 13-14, 2021. In the event that a physical conference will not be possible, GD2021 will, like GD2020, be held virtually. Regardless of the format, we are committed to offering remote participation for both presenters and the audience.


POSTER SUBMISSION INFORMATION
-----------------------------

The submission of posters on graph drawing, network visualization, and related areas is solicited. The poster session will provide a forum for the communication of late-breaking research results (which may also appear elsewhere) to the GD community. Authors of posters should prepare an abstract (up to two pages, excluding references, in LNCS style) that must be submitted together with the poster. Abstracts of accepted posters will appear in the conference proceedings (two pages+references). The maximum size for a poster is A0 (84.1 cm x 118.9 cm). The posters must be in portrait mode.

Each submission will then consist of two pdf files (the two-page abstract and the poster) and must include names, email addresses and contact information of the contributors. Contributions must be submitted via EasyChair at the web site
https://easychair.org/conferences/?conf=gd2021

Each poster must be presented at the conference by an author (barring unforeseen circumstances), otherwise the abstract will not be included in the proceedings. Should any visa/travel restriction prevent an author from attending the conference and presenting a paper, he/she will be given ways to participate and give the talk via electronic means.

BEST POSTER AWARD
-----------------

To recognize the effort of the participants in preparing and presenting their posters in a clear and elegant way, there will be a Best Poster Award voted on by the GD 2021 attendees.

IMPORTANT DATES
---------------

Poster submission deadline: August 11 (23:59 PDT)
Notification of poster acceptance: August 20
Final versions due: August 31 (23:59 PDT)
Symposium: September 14-17

INVITED SPEAKERS
----------------
Meirav Zehavi, Ben-Gurion University, Israel
Kim Marriott, Monash University, Australia

PROGRAM COMMITTEE
-----------------
Md. Jawaherul Alam, Amazon Inc., USA
Michael Bekos, Universitaet Tuebingen, Germany
Carla Binucci, University of Perugia, Italy
Romain Bourqui, Universite de Bordeaux, France
Vida Dujmovic, University of Ottawa, Canada
Cody Dunne, Northeastern University, USA
Seok-Hee Hong, University of Sydney, Australia
Takayuki Itoh, Ochanomizu University, Japan
Radu Jianu, City University of London, UK
Michael Kaufmann, Universitaet Tuebingen, Germany
Andreas Kerren, Linkoping University, Sweden
Linda Kleist, TU Braunschweig, Germany
Giuseppe Liotta, University of Perugia, Italy
Anna Lubiw, University of Waterloo, Canada
Guy Melancon, Universite de Bordeaux, France
Yoshio Okamoto, University of Electro-Communications, Japan
Maurizio Patrignani, Roma Tre University, Italy
Helen Purchase (co-chair), University of Glasgow, UK
Chrysanthi Raftopoulou, NTU Athens, Greece
Ignaz Rutter (co-chair), Universitat Passau, Germany
Marcus Schaefer, DePaul University, USA
Geza Toth, Renyi Institute, Hungary
Arthur van Goethem, TU Eindhoven, The Netherlands
Tatiana von Landesberger, Universitaet Rostock, Germany
Hsiang-Yun Wu, TU Wien, Austria
Kai Xu, Middlesex University, UK

ORGANIZING COMMITTEE
--------------------
Michael A. Bekos (co-chair), Universitaet Tuebingen
Henry Fˆrster, Universitaet Tuebingen
Renate Hallmayer, Universitaet Tuebingen
Michael Kaufmann (co-chair), Universitaet Tuebingen
Axel Kuckuk, Universitaet Tuebingen
Maximilian Pfister, Universitaet Tuebingen
Lena Schlipf, Universitaet Tuebingen

CONTEST COMMITTEE
-----------------
Philipp Kindermann (chair), Universitaet Wuerzburg, Germany
Tamara Mchedlidze, Utrecht University, The Netherlands
Wouter Meulemans, TU Eindhoven, The Netherlands

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

[DMANET] Call for Posters: Graph Drawing and Network Visualization GD 2021

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

Call for Posters

GD 2021

29th International Symposium on
Graph Drawing and Network Visualization

September 14-17, 2021 - Tuebingen, Germany
https://algo.inf.uni-tuebingen.de/gd2021/

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

Graph Drawing is concerned with the geometric representation of graphs and constitutes the algorithmic core of Network Visualization. Graph Drawing and Network Visualization are motivated by applications where it is crucial to visually analyze and interact with relational datasets. Examples of such application areas include data science, social sciences, web computing, information systems, biology, geography, business intelligence, information security, or software engineering.

GD has been the main annual event in this area for more than 20 years. Its focus is on combinatorial and algorithmic aspects of graph drawing as well as the design of network visualization systems and interfaces. Researchers and practitioners working on any aspects of graph drawing and network visualization are invited to contribute posters and to participate in the symposium and the graph drawing contest.

GD2021 will be held (hopefully) at Tuebingen from September 14 to 17, 2021 with a reception on the evening of September 14. A pre-conference PhD school is planned for September 13-14, 2021. In the event that a physical conference will not be possible, GD2021 will, like GD2020, be held virtually. Regardless of the format, we are committed to offering remote participation for both presenters and the audience.


POSTER SUBMISSION INFORMATION
-----------------------------

The submission of posters on graph drawing, network visualization, and related areas is solicited. The poster session will provide a forum for the communication of late-breaking research results (which may also appear elsewhere) to the GD community. Authors of posters should prepare an abstract (up to two pages, excluding references, in LNCS style) that must be submitted together with the poster. Abstracts of accepted posters will appear in the conference proceedings (two pages+references). The maximum size for a poster is A0 (84.1 cm x 118.9 cm). The posters must be in portrait mode.

Each submission will then consist of two pdf files (the two-page abstract and the poster) and must include names, email addresses and contact information of the contributors. Contributions must be submitted via EasyChair at the web site
https://easychair.org/conferences/?conf=gd2021

Each poster must be presented at the conference by an author (barring unforeseen circumstances), otherwise the abstract will not be included in the proceedings. Should any visa/travel restriction prevent an author from attending the conference and presenting a paper, he/she will be given ways to participate and give the talk via electronic means.

BEST POSTER AWARD
-----------------

To recognize the effort of the participants in preparing and presenting their posters in a clear and elegant way, there will be a Best Poster Award voted on by the GD 2021 attendees.

IMPORTANT DATES
---------------

Poster submission deadline: August 11 (23:59 PDT)
Notification of poster acceptance: August 20
Final versions due: August 31 (23:59 PDT)
Symposium: September 14-17

INVITED SPEAKERS
----------------
Meirav Zehavi, Ben-Gurion University, Israel
Kim Marriott, Monash University, Australia

PROGRAM COMMITTEE
-----------------
Md. Jawaherul Alam, Amazon Inc., USA
Michael Bekos, Universitaet Tuebingen, Germany
Carla Binucci, University of Perugia, Italy
Romain Bourqui, Universite de Bordeaux, France
Vida Dujmovic, University of Ottawa, Canada
Cody Dunne, Northeastern University, USA
Seok-Hee Hong, University of Sydney, Australia
Takayuki Itoh, Ochanomizu University, Japan
Radu Jianu, City University of London, UK
Michael Kaufmann, Universitaet Tuebingen, Germany
Andreas Kerren, Linkoping University, Sweden
Linda Kleist, TU Braunschweig, Germany
Giuseppe Liotta, University of Perugia, Italy
Anna Lubiw, University of Waterloo, Canada
Guy Melancon, Universite de Bordeaux, France
Yoshio Okamoto, University of Electro-Communications, Japan
Maurizio Patrignani, Roma Tre University, Italy
Helen Purchase (co-chair), University of Glasgow, UK
Chrysanthi Raftopoulou, NTU Athens, Greece
Ignaz Rutter (co-chair), Universitat Passau, Germany
Marcus Schaefer, DePaul University, USA
Geza Toth, Renyi Institute, Hungary
Arthur van Goethem, TU Eindhoven, The Netherlands
Tatiana von Landesberger, Universitaet Rostock, Germany
Hsiang-Yun Wu, TU Wien, Austria
Kai Xu, Middlesex University, UK

ORGANIZING COMMITTEE
--------------------
Michael A. Bekos (co-chair), Universitaet Tuebingen
Henry Fˆrster, Universitaet Tuebingen
Renate Hallmayer, Universitaet Tuebingen
Michael Kaufmann (co-chair), Universitaet Tuebingen
Axel Kuckuk, Universitaet Tuebingen
Maximilian Pfister, Universitaet Tuebingen
Lena Schlipf, Universitaet Tuebingen

CONTEST COMMITTEE
-----------------
Philipp Kindermann (chair), Universitaet Wuerzburg, Germany
Tamara Mchedlidze, Utrecht University, The Netherlands
Wouter Meulemans, TU Eindhoven, The Netherlands

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


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Postdoctoral position on verification of concurrent systems via model learning, Royal Holloway University of London, Deadline: 31 Aug 2021

- Application deadline: Midnight, 31 Aug 2021
- Interview Date: To be confirmed
- Starting date: 1 Oct 2021, or as soon as possible thereafter
- Salary: £35,931-£37,979
- Duration: until February 2023


Applications are invited for the post of Post-Doctoral Research Assistant in the Computer Science Department at Royal Holloway, University of London.

Successful applicants will be working on the EPSRC-funded "Verification of Hardware Concurrency via Model Learning" (CLeVer) project (EP/S028641/1), led by Alexandra Silva (UCL) and Matteo Sammartino (Royal Holloway, University of London).

This is a joint research endeavour involving Royal Holloway University of London, University College London, and ARM, world-leading designer of multi-core chips.

For an informal discussion about the post, please contact Dr. Matteo Sammartino on Matteo.Sammartino@rhul.ac.uk.


# Project Description

Digital devices increasingly rely on multi-threaded computation, with sophisticated concurrent behaviour becoming prevalent at any scale. As the complexity of these systems increases, there is a pressing need to automate the assessment of their correctness, especially with respect to concurrency-related aspects. Formal verification provides highly effective techniques to assess the correctness of systems. However, formal models are usually built by humans, and as such can be error-prone and inaccurate.

The CLeVer project aims to:

- develop a novel verification framework that relies on learning techniques to automatically build and verify models of concurrency, with a particular focus on multi-core systems.

- apply the framework to real-world verification tasks, in collaboration with ARM.

# The ideal candidate

We are looking for candidates with a PhD in one of the following areas: model-based testing and verification, formal methods for concurrency, automated analysis of hardware systems. Experience in multiple areas will be valued. Candidates ideally should also have strong programming skills.

# Where to apply

https://jobs.royalholloway.ac.uk/vacancy.aspx?ref=0721-259

[DMANET] FMEC 2021 CFP: The Sixth International Conference on Fog and Mobile Edge Computing, Gandia, Spain. December 6-9, 2021.

The Sixth International Conference on Fog and Mobile Edge Computing (FMEC
2021)

http://emergingtechnet.org/FMEC2021/index.php

Gandia, Spain. December 6-9, 2021


*FMEC 2021 CFP:*

Cloud computing provides a large range of services and virtually unlimited
available resources for users. New applications, such as virtual reality
and smart building control, have emerged due to the large number of
resources and services brought by cloud computing. However, the
delay-sensitive applications face the problem of large latency, especially
when several smart devices and objects are getting involved in human's life
such as the case of smart cities or the Internet of Things. Therefore,
cloud computing is unable to meet the requirements of low latency, location
awareness, and mobility support. To solve this problem, researchers have
introduced a trusted and dependable solution through the Fog and the Mobile
Edge Computing (FMEC) to put the services and resources of the cloud closer
to users, which facilitates the leveraging of available services and
resources in the edge networks. By this, we are moving from the core (cloud
data centers) to the edge of the network closer to the users. FMEC
dependability is based on providing user centric service. The purpose of
Fog and the Mobile Edge Computing is to run the heavy real-time
applications at the network edge directly using the billions of connected
mobile devices.

Several features enable the Fog and the Mobile Edge Computing to be a
perfect paradigm to the aforementioned purpose, which are the dense
geographical deployment of servers, supporting mobility and the closeness
to users. As in every new technology, some challenges face the vision of
the Fog and the Mobile Edge Computing, which are the administrative
policies and security concerns (i.e. secure data storage, secure
computation, network security, data privacy, usage privacy, location
privacy, etc). FMEC 2021 conference aims to investigate the opportunities
and requirements for Mobile Edge Computing dominance. In addition, it seeks
for novel contributions that help mitigating Mobile Edge Computing
challenges. That is, the objective of FMEC 2021 is to provide a forum for
scientists, engineers, and researchers to discuss and exchange new ideas,
novel results and experience on all aspects of Fog and Mobile Edge
Computing (FMEC). FMEC 2021 is Technically Co-Sponsored by IEEE Spain
Section. Researchers are encouraged to submit original research
contributions in all major areas, which include, but not limited to:

* Mobile Cloud Computing Systems.
* FMEC Security and Privacy Issues.
* FMEC Pricing and billing models.
* FMEC support for VANETS and MANETS
* Cloudlet based computing
* Dew based computing
* Lightweight authentication mechanisms in FMEC architecture.
* Access Control models in FMEC.
* Identification of incentives for FMEC service providers.
* The future perspective for FMEC: Challenges and Open Issues.
* FMEC Quality of Service (QoS) improvements techniques.
* FMEC architecture features and evolution.
* FMEC Real-time communication interfaces and protocols.
* FMEC Resource scheduling that enhances the reliability and scalability.
* FMEC Resources monitoring mechanism and utilization measuring mechanism.
* FMEC resources allocation and management.
* Real-time load prediction model to optimize the user satisfaction.
* FMEC virtualization.
* Data storage, processing, and management at FMEC platform.
* Cyber hacking, next generation firewall of FMEC.
* Deployment strategies of FMEC Servers
* Admission control for FMEC.
* Social engineering, insider threats, advance spear phishing.
* Incident Handling and Penetration Testing.
* Forensics of Virtual and FMEC Environments.
* Security protocols in FMEC.
* Security and privacy of mobile cloud computing
* Security, privacy and reliability issues of MCC and IoT
* Security and privacy of IoT
* Security and privacy management in MCC
* MCC intrusion detection systems
* Security of pricing and billing for mobile cloud computing services
* Security of mobile, peer-to-peer and pervasive services in clouds
* Security of mobile commerce and mobile Internet of Things
* Security of mobile social networks
* Security and privacy in smartphone devices
* Security and privacy in social applications and networks
* Security of Mobile, peer-to-peer and pervasive services in clouds
* Security of Mobile commerce and mobile internet of things
* Security of Operating system and middleware support for mobile computing
* Security and privacy in sensor networks
* Security and privacy in social applications and networks
* Web service security
* Security of 3G/4G systems, Wi-MAX, Ad-hoc
* Security of Mobile social networks
* Near field communication services
* Service-oriented architectures, service portability, P2P
* Network virtualization and cloud-based radio access networks

*Submissions Guidelines and Proceedings*

Manuscripts should be prepared in 10-point font using the IEEE 8.5" x 11"
two-column format. All papers should be in PDF format, and submitted
electronically at Paper Submission Link. A full paper can be up to 8 pages
(including all figures, tables and references). Submitted papers must
present original unpublished research that is not currently under review
for any other conference or journal. Papers not following these guidelines
may be rejected without review. Also submissions received after the due
date, exceeding length limit, or not appropriately structured may also not
be considered. Authors may contact the Program Chair for further
information or clarification. All submissions are peer-reviewed by at least
three reviewers. Accepted papers will appear in the FMEC Proceeding, and be
published by the IEEE Computer Society Conference Publishing Services and
be submitted to IEEE Xplore for inclusion.

Submitted papers must include original work, and must not be under
consideration for another conference or journal. Submission of regular
papers up to 8 pages and must follow the IEEE paper format. Please include
up to 7 keywords, complete postal and e-mail address, and fax and phone
numbers of the corresponding author. Authors of accepted papers are
expected to present their work at the conference. Submitted papers that are
deemed of good quality but that could not be accepted as regular papers
will be accepted as short papers. Length of short papers can be between 4
to 6 pages.

*Important Dates*

*Submission Date: 7 August, 2021*

Notification to Authors: 30 September, 2021

Camera Ready Submission: 15 October, 2021


*Contact:*

Please send any inquiry on FMEC 2021 to Emerging Tech. Network Team at:
emergingtechnetwork@gmail.com

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Sunday, July 25, 2021

[DMANET] ML and Optimisation postdoc vacancies

If you are looking for a Machine Learning / Optimisation postdoc, we have two exciting jobs for you. Please check below positions RF 4 (machine learning / optimisation) and RF 5 (uncertainty handling).

You will work with a top team on a super high impact application - I can assure you our work could not be more central to current events in Australia!!!

Please note, due to the urgency of the work, you must be currently located within Australia and able to commence immediately or as soon as your notice period has been served. These roles are part of a $20m Hub and more vacancies will be advertised soon.

https://jobs.unimelb.edu.au/en/job/905792/research-fellows-pharma-and-food-manufacturing-x5

Please apply online – deadline 22 August 2021.


Professor Uwe Aickelin | Head of School of Computing and Information Systems
Faculty of Engineering and Information Technology
Level 3, Melbourne Connect – 700 Swanston Street
The University of Melbourne, Victoria 3010 Australia
T: +61 3 8344 3635 E: uwe.aickelin@unimelb.edu.au<mailto:uwe.aickelin@unimelb.edu.au>
http://aickelin.com/ | http://linkedin.com/in/aickelin

[A close up of a sign Description automatically generated] <https://melbconnect.com.au/> [Join R U OK?Day | R U OK?]

I acknowledge the Traditional Owners of the land on which I work, and pay my respects to the Elders, past and present.





**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Saturday, July 24, 2021

[DMANET] Call for Participation: Workshop "Combinatorial Reconfiguration in Discrete and Computational Geometry"

===============================================================================
Workshop "Combinatorial Reconfiguration in Discrete and Computational Geometry"
August 30, 2021
Online via Zoom
http://dopal.cs.uec.ac.jp/okamotoy/misc/2021/crdcg.html
===============================================================================

As a part of the research project "Fusion of Computer Science, Engineering and Mathematics Approaches for Expanding Combinatorial Reconfiguration" (head
investigator: Takehiro Ito), we are going to organize Workshop "Combinatorial Reconfiguration in Discrete and Computational Geometry" via Zoom on August 30
(based on European Timezone).
Webpage of the research project: https://core.dais.is.tohoku.ac.jp/en/

A basic idea is to share fundamental concepts and recent trends of combinatorial reconfiguration problems that arise in discrete and computational geometry and
identify future research directions. In discrete and computational geometry, metric and topological properties concerning flips and compatibility of several
geometric structures have been discussed; theory and algorithms for reconfiguration in robotics and nanomanufacturing have been studied; several questions
involving continuous deformations in topology have been investigated through the algorithmic lens. This workshop aims at the broad audience of discrete
mathematics and theoretical computer science, who wish to learn and work on this active research area.

The program will be exclusively composed of invited talks. Each talk is planned to span one hour, including discussion.

*Registration*

The workshop is held as a Zoom meeting. If you are interested in participation, please register yourself at the following site.
https://uec-tokyo.zoom.us/meeting/register/tJYld-uprT8sGNX6iOPDDFsgknnt_HU9YmrM
After registration, the detail will be sent as an email.

Participation is free of charge.

*List of Confirmed Invited Speakers*

-Hsien-Chih Chang (Dartmouth College, USA)
-Sándor Fekete (Technische Universität Braunschweig, Germany)
-Dan Halperin (Tel Aviv University, Israel)
-Hugo Parlier (University of Luxembourg, Luxembourg)
-Rodrigo Silveira (Universitat Politècnica de Catalunya, Spain)
-Emo Welzl (ETH Zürich, Switzerland)

*Program*

Time in CEST Speaker: Title
8:00- 9:00 Dan Halperin: Geometric Reconfiguration and Assembly Planning
9:10-10:10 Emo Welzl: Triangulation Flip Graphs of Planar Point Sets
10:20-11:20 Hugo Parlier: TBA
13:40-14:40 Rodrigo Silveira: Flips in Higher Order Delaunay Triangulations
14:50-15:50 Hsien-Chih Chang: Morphing Planar Metrics
16:00-17:00 Sándor Fekete: Coordinated Reconfiguration for Swarms of Objects

The abstracts can be found at the workshop webpage. http://dopal.cs.uec.ac.jp/okamotoy/misc/2021/crdcg.html

*Organizer*

-Yoshio Okamoto (The University of Electro-Communications, Japan)
okamotoy@uec.ac.jp

If you have an inquiry, please send it to the organizer.

--
Yoshio Okamoto, Prof. <okamotoy@uec.ac.jp>
Dept. of Computer and Network Engineering
University of Electro-Communications
Chofugaoka 1-5-1, Chofu, Tokyo 182-8585
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] [Extended deadline, August 2] Cryptocurrencies and Blockchain Technology - CBT, ESORICS 2021 (LNCS)

*********************************************************************
CALL FOR PAPERS
*********************************************************************

5th International Workshop on
Cryptocurrencies and Blockchain Technology - CBT 2021

In conjunction with ESORICS 2021

http://www.cbtworkshop.org/

October 4-8, 2021

*********************************************************************

IMPORTANT DATES
================

Deadlines:
-- August 2, 2021 (Firm)

Notifications:
-- August 30, 2021

Camera Ready:
-- September 20, 2021

*********************************************************************

===============
EVENT FORMAT
===============

As a satellite event of the ESORICS symposium, CBT will be organised
as a hybrid workshop: digitally with remote participation and talks
and physically with presence in Darmstadt. The health and safety of
the symposium participants is our number one priority hence the
digital part may be increased depending on the development of
COVID-19. This new format will not affect our proceedings, which will
be published as Springer LNCS proceedings.

=================
WORKSHOP HISTORY
=================

Since the appearance of Bitcoin in 2009, a plethora of new
cryptocurrencies and other blockchain based systems have been deployed
with different success. While some of them are slightly different
copies of Bitcoin, other ones propose interesting improvements or new
usages of the underlying blockchain technology. However, the novelty
of such technologies is often tied with rapid developments and
proof-of-concept software, and rigorous scientific analyses of the
proposed systems are often skipped.

This workshop aims to provide a forum for researchers in this area to
carefully analyze current systems and propose new ones in order to
create a scientific background for a solid development of new
cryptocurrencies and blockchain technology systems.

The main topics include (but are not limited to):

* Anonymity and privacy in cryptocurrencies.
* Privacy-preserving technologies.
* Cryptocurrency based trust systems.
* Security analysis of existing cryptocurrencies.
* Formal threat models in cryptocurrency systems.
* Improvement proposals for existing cryptocurrencies.
* P2P network cryptocurrencies analysis.
* Private transactions in blockchain based systems.
* Consensus mechanisms: proof-of-work, proof of stake,
proof of burn, proof-of-useful-work.
* New usages of the blockchain technology.
* Scalability solutions for blockchain systems.
* Smart contracts.

===================
SUBMISSION DETAILS
===================

Regular and short papers must be original and not submitted for
publication elsewhere. Authors are invited to submit their manuscripts
following the LNCS Proceedings Manuscript style. Papers are limited to
16 pages (full papers), or 8 pages (short papers) including references
and appendices, and can be submitted as PDF via the CBT 2021 submission
site: https://easychair.org/conferences/?conf=cbt2021

*Double blind review*: CBT requires anonymized submissions -- please
make sure that submitted papers contain no author names or obvious
self-references.

Accepted regular papers will be published by Springer in the LNCS
collection. At least one author of each accepted paper is required to
register and present their work at the workshop; otherwise the paper
will not be included in the proceedings.

==================
PROGRAM COMMITEE
==================

PC Chairs:

* Joaquin Garcia-Alfaro, Institut Polytechnique de Paris
* Jose Luis Munoz-Tapia, Universitat Politecnica de Catalunya
* Guillermo Navarro-Arribas, Universitat Autonoma de Barcelona

PC Members:

* Shashank Agrawal - Western Digital Research (US)
* Daniel Augot - INRIA Saclay (France)
* Georgia Avarikioti - ETH Zurich (Switzerland)
* Spiridon Bakiras - Hamad Bin Khalifa University (Qatar)
* Iddo Bentov - Cornell Tech (USA)
* Alex Biryukov - University of Luxembourg (Luxembourg)
* George Bissias - University of Massachusetts at Amherst (US)
* Joseph Bonneau - NYU (USA)
* Karima Boudaoud - University of Nice (France)
* Jeremy Clark - Concordia University (Canada)
* Mauro Conti - University of Padua (Italy)
* Sanchari Das - University of Denver (US)
* Vanesa Daza - Universitat Pompeu Fabra (Spain)
* Matteo Dell'Amico - EURECOM (France)
* Sven Dietrich - City University of New York (US)
* Kaoutar Elkhiyaoui - EURECOM (France)
* Antonio Faonio - EURECOM (France)
* Esha Ghosh - Microsoft Research (US)
* Hannes Hartenstein - KIT (Germany)
* Ethan Heilman - Boston University (US)
* Ryan Henry - University of Calgary (Canada)
* Jordi Herrera-Joancomarti - Universitat Autonoma de Barcelona (Catalonia)
* Ghassan Karame - NEC Research (Germany)
* Jiasun Li - George Mason University (USA)
* Daniel Xiapu Luo - Hong Kong Polytechnic University (Hong Kong)
* Giorgia Marson - University of Bern (Switzerland)
* Shin'ichiro Matsuo - Georgetown University (USA)
* Pedro Moreno-Sanchez - IMDEA (Spain)
* Cristina Perez-Sola - UOC (Spain)
* Simon Oya - University of Waterloo (Canada)
* Elizabeth Quaglia - Royal Holloway, University of London (UK)
* Alfredo Rial - University of Luxembourg (Luxembourg)
* Alessandra Scafuro - North Carolina State University (US)
* Edgar Weippl - SBA Research (Austria)

It is expected that extended and revised version of the best papers
will be considered for international journal special issues.

Further details at http://www.cbtworkshop.org/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Friday, July 23, 2021

[DMANET] 9th Informs Transportation Science and Logistics Society Workshop

Dear colleagues,


We are happy to inform you that Indian Institute of Management Ahmedabad is
hosting the 9th Informs Transportation Science and Logistics Society
Workshop from 13th to 15th December 2021. The workshop will be delivered in
a virtual mode. The theme for the Workshop is "*E-Commerce in an Emerging
World*".



E-commerce has revolutionized retail. It has evolved to meet the changing
needs of people, and to make online shopping easier for the modern-day
customer. When it started, e-commerce was fairly limited in its product
offerings and capabilities. But today, e-commerce retail offers a wide
assortment of products and orders are often delivered to the customers on
the same day. However, in emerging economies, e-commerce providers face
several challenges particularly related to logistics and transportation
such as shortage of high-quality warehousing infrastructure, missed
deliveries, high usage of cash on delivery services resulting in
restrictive delivery schedules, limited transport infrastructure, high
packaging costs, and lack of standardized postal addresses. These
challenges lead to the high cost to fulfil customer orders. E-commerce
companies are developing capabilities to overcome these challenges using
real-time data, algorithms, OR solutions, policy, and technology
interventions.



In this context, we invite contributions on the following themes.

- Last-mile Logistics
- Sharing Economy in Last-mile Delivery
- Design of Omnichannel Distribution Models
- Urban Distribution Systems
- Logistics 4.0 (IoTs, autonomous vehicles, drones)
- Dynamic Delivery Pricing, Dynamic Delivery Systems, and Crowdshipping
- Efficient and scalable Sortation and Package Handling
- Integration of Public and Freight Transportation
- Manpower Planning and Productivity
- Transportation Scheduling
- Network Topology and Hub Location Planning
- Real-time Planning and Orchestration of Shipments



Workshop details can be found here: https://conference.iima.ac.in/tsl2021/



Abstract can be submitted here:
https://easychair.org/my/conference?conf=tsl2021iima



Abstracts of max 1000 words should be submitted by 15th Aug 2021.
Selection of papers for presentation will be based on the submitted
abstracts. Abstracts must include a clear indication of the purpose of
research, methodology, major results, implications, and key references.



We look forward to seeing you in December.



Regards,



*TSL Workshop Organizers*

Prof. Sandip Chakrabarti, IIM Ahmedabad
Dr. Joris Kinable, Amazon, Seattle, USA
Prof. Srikumar Krishnamoorthy, IIM Ahmedabad
Prof. Debjit Roy, IIM Ahmedabad
Prof. Tom Van Woensel, Eindhoven University of Technology, Netherlands.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Postdoc Position in Networked Embedded Systems

Hamburg University of Technology seeks a versatile, highly motivated
Post-doctoral researcher to work on networked embedded systems for
locating objects. The position is part of the WinOSens project,
conducted in close collaboration with industrial partners and funded
by the German Government. The position is for two years (fully
funded).

The candidate should hold a PhD in a relevant subject and a strong
background in software for networked embedded systems. Knowledge about
machine learning techniques for resource-constraint devices and/or
experience in programming embedded systems is beneficial but not a
requirement. The target of the project is to have a running prototype
in a real industrial setting. The candidate will get the opportunity
to develop his scientific career and work in a highly motivated team.

The position will be filled as early as possible in 2021. There is no
fixed deadline for applications. Please send your application by
E-Mail in one file to Prof. Volker Turau (turau at tuhh.de).

Further information about the Institute of Telematics can be found on
http://www.ti5.tu-harburg.de/. Women are especially encouraged to
apply. Applications should include a detailed cv, a list of your M.SC.
courses and grades, a recommendation letter and a copy of your PhD
thesis. For further information about the project, please contact
Prof. Volker Turau.

---
Prof.Volker Turau
Hamburg University of Technology, Institute of Telematics


Schwarzenberg-Campus 3
D-21073 Hamburg
Tel.: (+4940) 42878-3530
E-Mail: turau at tuhh.de
http://www.ti5.tu-harburg.de/staff/turau/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Thursday, July 22, 2021

[DMANET] Postdoc positions in Warsaw (algorithms, structural graph theory)

We announce

up to three short-term postdoc positions

at the Institute of Informatics, University of Warsaw, Poland. The
positions are supported by the ERC Starting Grant CUTACOMBS: "Cuts and
decompositions: algorithms and combinatorial properties" led by Marcin
Pilipczuk.

The CUTACOMBS' focus is on structural graph theory and parameterized
complexity. Example topics include:
* structure of separations in directed graphs, with applications to
parameterized algorithms;
* approximability of the disjoint paths problem in various settings;
* structure of hereditary graph classes, such as graph excluding a fixed
graph as induced subgraph, with algorithmic and graph-theoretical
applications.
We refer to the project website http://cutacombs.mimuw.edu.pl for more on
the project.

The application deadline is 25th August 2021. The starting date is no
earlier than 1st November 2021 and the employment needs to finish by 31st
August 2022. Within this bounds, the employment period is negotiable.

For more details, including on how to apply, see
https://euraxess.ec.europa.eu/jobs/662094.

Questions and informal inquiries are welcome, please contact the PI at
m.pilipczuk@mimuw.edu.pl

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Tenure-track faculty position in Computer Science (all areas), University of Ottawa

The School of Electrical Engineering and Computer Science is seeking a
creative, dynamic, and energetic individual for a tenure-track faculty
position in all areas of Computer Science. Areas of interest include
but are not limited to approximation algorithms, computability theory,
computational complexity, foundations of machine learning, programming
languages, and quantum computing.

Title of the position: Assistant or Associate Professor, although the
rank of Full Professor will be considered under exceptional circumstances.

The posting #J0621-0289 deadline is August 15, 2021. Applications
received prior to August 15, 2021 will be given first consideration.
Applications received after that date will be considered until the
position is filled. Applications shall be submitted online. You will
find the full job posting at the link provided below.


https://uottawa.njoyn.com/CL3/xweb/Xweb.asp?tbtoken=ZV5YShoXCBgGY3N5QSMnCFVPeBFEcFEpc0gjVy5%2FE2MrWUITWEYSAmQEcAkbURJXT3YqWA%3D%3D&chk=ZVpaShw%3D&CLID=57566&page=jobdetails&JobID=J0621-0289&lang=1

******************************************************
The text from the full job posting is copied below
********************************************************

Job Number:J0621-0289
Job Type:Tenure-track
Job Category:Academic
Faculty:Faculty of Engineering
Department:Electrical Engineering and Computer Science

UNIVERSITY OF OTTAWA - The School of Electrical Engineering and Computer
Science in the Faculty of Engineering at the University of Ottawa is
seeking a creative, dynamic, and energetic individual for a tenure-track
faculty position in all areas of Computer Science. Areas of interest
include but are not limited to approximation algorithms, computability
theory, computational complexity, foundations of machine learning,
programming languages, and quantum computing.

Title of the position: Assistant or Associate Professor, although the
rank of Full Professor will be considered under exceptional circumstances.

Duties: The functions of a member of the academic staff include, in
varying proportions: a) teaching activities; b) scholarly activities
revealed by research or professional work; c) supervision of graduate
students; d) academic and professional service activities. The candidate
will be expected to develop and lead an active nationally and
internationally recognized research program, attract external research
funding, supervise graduate students, collaborate with other faculty
members, and participate in educational and professional activities
including administrative duties.

Rank and Salary: Regular tenure-track academic appointment in the
Faculty of Engineering with a salary consistent with the collective
agreement of the Association of Professors of the University of Ottawa.

Benefits package: The University of Ottawa provides a complete
compensation package which includes long term disability, basic group
life insurance, supplementary health insurance, University of Ottawa
Pension Plan and optional life insurance.

Location of work: School of Electrical Engineering and Computer Science
(EECS), University of Ottawa, 800 King Edward, Ottawa, ON K1N 6N5.
Current research strengths in Computer Science at the School of EECS
include applied AI, information management and mining, as well as text
analysis and machine learning, algorithms and theory of computing,
distributed computing and systems, multimedia and interactive virtual
environments. Further information may be viewed on our web site, located
at http://engineering.uottawa.ca/eecs/

Contact information: Dr. Claude D'Amours, EECS Director, Faculty of
Engineering, Ottawa, ON K1N 6N5. cdamours@uottawa.ca Telephone:
613-562-5800, ext. 6208, fax: 613-562-5664

Skills requirements:

Education: Ph.D. in Computer Science or equivalent. Postdoctoral
experience in Computer Science is considered an asset.
Work experience: The successful candidates should possess a strong
research background and a strong commitment to excellence both in
teaching and research. The candidates will be expected to initiate and
maintain an innovative, externally funded research program and to teach
Computer Science courses, both at the undergraduate and graduate levels.
Because the University of Ottawa is Canada's premier bilingual
university, preference will be given to candidates who are bilingual
(French/English) and who are able to teach in both languages. Passive
knowledge of the other official language in Canada is a requirement for
tenure. Candidates must demonstrate a commitment to contributing to a
culture that supports diversity and inclusion.
Start date: The expected start date for this position is January 1, 2022.

Application deadline: Applications received prior to August 15, 2021
will be given first consideration. Applications received after that
date will be considered until the position is filled.

The application material consists of a curriculum vitae, a detailed
research proposal, a description of teaching interests and the names,
addresses, telephone numbers and e-mail addresses of at least three (3)
referees

The University of Ottawa is committed to ensuring equity, diversity and
inclusion in the scholarly and leadership environments of our students,
staff, and faculty. Accordingly, we strongly encourage applications from
Indigenous persons, visible minorities members (racialized persons),
persons with disabilities, women, as well as from all qualified
candidates with the skills and knowledge to productively engage with
equitable, diverse and inclusive communities. Candidates who wish to be
considered as a member of one or more designated groups are asked to
complete the confidential Self-Identification Questionnaire, to be
completed at the time of application.

According to government policy, all qualified candidates are invited to
apply; however, preference will be given to Canadian citizens and
permanent residents. When submitting your application, please indicate
if you are legally entitled to work in Canada.

The University of Ottawa provides accommodations for applicants with
disabilities throughout the recruitment process. If you are invited to
proceed in the selection process, please notify us of any accommodations
that you require by contacting the Office of the Vice-Provost, Faculty
Relations at 613-562-5958. Any information you send us will be handled
respectfully and in complete confidence.

The University of Ottawa is proud of its 160-year tradition of
bilingualism. Through its Official Languages and Bilingualism Institute,
the University provides training to staff members and to their spouses
in their second official language.

View Notice of Collection of Personal Information

To apply go to the above listed webpage

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Wednesday, July 21, 2021

[DMANET] IEEE DependSys/HPCC/DSS/SmartCity/DependSys/DIKW-2021, Dec. 17-19, Haikou, China [Submission Deadline: Sep. 1][10+ Special Issues]

CFP: IEEE DependSys/HPCC/DSS/SmartCity/DependSys/DIKW-2021, Dec. 17-19,
Haikou, China [Submission Deadline: Sep. 1][10+ Special Issues]

Call For Papers
=============================================================================
[Submission Deadline: Sep. 1][10+ Special Issues] [Dec. 17-19, Haikou,
China]

CFP IEEE DependSys 2021: The 7th IEEE International Conference on
Dependability in Sensor, Cloud, and Big Data Systems and Applications
http://www.ieee-cybermatics.org/2021/dependsys/

CFP IEEE HPCC 2021: The 23rd IEEE International Conference on High
Performance Computing and Communications
http://www.ieee-cybermatics.org/2021/hpcc/

CFP IEEE DSS 2021: The 7th IEEE International Conference on Data Science
and Systems
http://www.ieee-cybermatics.org/2021/dss/

CFP IEEE SmartCity 2021: The 19th IEEE International Conference on Smart
City
http://www.ieee-cybermatics.org/2021/smartcity/

CFP DIKW 2021: 2021 International Conference on Data, Information,
Knowledge and Wisdom
http://www.ieee-cybermatics.org/2021/dikw/

The IEEE DependSys/HPCC/DSS/SmartCity/DependSys/DIKW 2021 Conferences will
be held at Haikou, China, December 17-19, 2021. We will be pretty happy to
see all authors manage to attend
DependSys/HPCC/DSS/SmartCity/DependSys/DIKW-2021. However, given the
COVID-19 pandemic and associated travel restrictions, as the safety of
people is of the highest priority, we know that special circumstances are
best handled by having flexible options, and thus we are offering the
option of either physical presence or virtual participation. Please
consider to contribute and submit your original research papers to
DependSys/HPCC/DSS/SmartCity/DependSys/DIKW-2021.


=============================================================================
IEEE DependSys/HPCC/DSS/SmartCity/DependSys/DIKW 2021 are sponsored by
IEEE, IEEE Computer Society, and IEEE Technical Committee on Scalable
Computing (TCSC). All accepted papers will be submitted to IEEE Xplore and
Engineering Index (EI). Best Paper Awards will be presented to high quality
papers. Distinguished papers, after further revisions, will be published in
10+ SCI & EI indexed prestigious journals (confirmed).
1. IEEE Transactions on Intelligent Transportation Systems
SI on Graph-based Machine Learning for Intelligent Transportation Systems
https://ad051eeb-2ac9-4983-9271-c88f64105e50.filesusr.com/ugd/eaf218_db671bf4e4eb4a41ac1cf6da14a77750.pdf
2. IEEE Transactions on Intelligent Transportation Systems
SI on Data Science for Cooperative Intelligent Transportation Systems
https://ad051eeb-2ac9-4983-9271-c88f64105e50.filesusr.com/ugd/eaf218_de7a6f420a2b4c6d894e4de63e495624.pdf
3. IEEE Transactions on Network Science and Engineering
SI on The Nexus Between Edge Computing and AI for 6G Networks
https://www.comsoc.org/publications/journals/ieee-tnse/cfp/nexus-between-edge-computing-and-ai-6g-networks
4. IET Communications
SI on Intelligent Metasurfaces for Smart Connectivity
https://digital-library.theiet.org/files/IET_COM_CFP_IMSC.pdf
5. Security and Communication Networks
SI on Protocols, Technologies, and Infrastructures for Secure Mobile Video
Communications
https://www.hindawi.com/journals/scn/si/926306/
6. MDPI Sensors
SI on Recent Advances in Algorithm and Distributed Computing for the
Internet of Things
https://www.mdpi.com/journal/sensors/special_issues/Algorithm_Distributed_Computing_IOT
7. International Journal of Distributed Sensor Networks
SI: Privacy-Preserving Solutions in the Internet of Things
https://journals.sagepub.com/page/dsn/collections/special-issues/privacy-preserving-solutions-in-the-internet-of-things

* More special issues will be added later.


==================
Important Dates
==================
Workshop Proposal Due: 1 August, 2021
Paper Submission Deadline: 1 September, 2021
Authors Notification: 1 October, 2021
Final Manuscript Due: 1 November, 2021
Conference Date: 17-19 December, 2021



==================
Paper Submission
==================
All papers need to be submitted electronically through the conference
submission website (http://www.ieee-cybermatics.org/2021/dependsys/) with
PDF format. The materials presented in the papers should not be published
or under submission elsewhere. Each paper is limited to 8 pages (or 10
pages with over length charge) including figures and references using IEEE
Computer Society Proceedings Manuscripts style (two columns, single-spaced,
10 fonts). You can confirm the IEEE Computer Society Proceedings Author
Guidelines at the following web page: http://www.computer.org/web/cs-cps/

Manuscript Templates for Conference Proceedings can be found at:
https://www.ieee.org/conferences_events/conferences/publishing/templates.html

Once accepted, the paper will be included into the IEEE conference
proceedings published by IEEE Computer Society Press (indexed by EI). At
least one of the authors of any accepted paper is requested to register the
paper at the conference.



--
Dr. Jun Feng
Huazhong University of Science and Technology
Mobile: +86-18827365073
WeChat: junfeng10001000
E-Mail: junfeng989@gmail.com

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Fourth Computational Geometry Challenge - First Announcement

Dear colleagues,

We are happy to announce the Fourth Geometric Optimization Challenge, as
part of CG Week in Berlin, Germany, June 7-10, 2022.

See https://cgshop.ibr.cs.tu-bs.de/competition/cg-shop-2022/#problem-description

As in the last year, the objective will be to compute good solutions to instances
of a difficult geometric optimization problem. The specific problem chosen for
the 2022 Challenge is the following:

Minimum Partition into Plane Subgraphs
-----------------------------------------------------

Given a geometric graph G=(V,E), with vertices represented by points in the plane,
and edges by straight-line connections between vertices.

The task is to partition E into as few subsets E_1,…, E_k as possible, such that
each subgraph G_i=(V,E_i) is plane: In the given geometric representation,
line segments representing edges my touch at end points if and only if the
corresponding edges are incident in G_i; no edges my cross, i.e., share
points that are not segment end points.

The problem is related to a variety of classic problems, ranging from coloring and
graph partitioning to extremal graph theory. For example, edge coloring in planar
graphs H (for which it is a long-standing conjecture [2] that it is NP-hard for graphs
of maximum degree delta =4 or 5 to decide whether they have an edge coloring with
delta colors) is a special case: From a straight-line drawing of H, slightly extend all
line segments, so that they cross at the vertices of H, and nowhere else.

The related problem of partitioning a geometric graph into a minimum number of
plane spanning trees has also received considerable attention; see Aichholzer et al. [1]
for an overview.

Details of the competition (such as benchmark instances, data formats, and rules for
submission and evaluation) will be announced in coming weeks; see the timeline below.

The contributors with the most outstanding solutions will be recognized at CG Week
and invited to present their results, both at the event and in the proceedings.

We are looking forward to your contributions and welcome questions and comments!

Challenge Team:
----------------------
Sándor Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra

Advisory Board:
---------------------
Bill Cook, Andreas Fabri, Michael Kerber, Philipp Kindermann, Kevin Verbeek

Timeline:
------------
- By August 19, 2020: Release of first test instances

- September 19, 2021: Contest instances, contest opens

- January 19, 2022: Contest closes

- March 15, 2021: Final versions of proceedings contributions due

Credit:
---------
This problem was suggested by Johannes Obenaus, FU Berlin.

References:
----------------

[1]
Marek Chrobak, Takao Nishizeki.
Improved edge-coloring algorithms for planar graphs.
Journal of Algorithms, Volume 11, Issue 1, March 1990, Pages 102-116.

[2]
Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc van Kreveld, Maarten Löffler,
Alexander Pilz, Bettina Speckmann, Emo Welzl.
Packing plane spanning trees and paths in complete geometric graphs
Information Processing Letters, Volume 124, August 2017, Pages 35-41;
full version available at https://arxiv.org/abs/1707.05440


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] [Extended deadline, August 2] DPM - Data Privacy Management, ESORICS 2021 (LNCS)

CALL FOR PAPERS

******************************************************************
16th International Workshop on Data Privacy Management (DPM 2021)

October 4-8, 2021, Darmstadt, Germany

(co-located with ESORICS 2021)

https://deic-web.uab.cat/conferences/dpm/dpm2021/
******************************************************************

IMPORTANT DATES
======================

Submission Deadline:
-- August 2, 2021 (Firm)

Notification:
-- August 30, 2021

Camera Ready:
-- September 20, 2021

===============
EVENT FORMAT
===============

As a satellite event of the ESORICS symposium, DPM will be organised
as a hybrid workshop: digitally with remote participation and talks
and physically with presence in Darmstadt. The health and safety of
the symposium participants is our number one priority hence the
digital part may be increased depending on the development of
COVID-19. This new format will not affect our proceedings, which will
be published as Springer LNCS proceedings.


======
SCOPE
======

DPM is an annual international workshop covering research in data
privacy management. Organizations are increasingly concerned
about the privacy of information that they manage (as witnessed,
for example, by lawsuits filed against organizations for
violating the privacy of customer's data). Thus, the management
of privacy-sensitive information is very critical and important
for every organization.

This poses several challenging problems, such as how to translate the
high-level business goals into system-level privacy policies,
administration of privacy-sensitive data, privacy preserving data
integration and engineering, privacy preserving access control
mechanisms, information-oriented security, and query execution on
privacy-sensitive data for partial answers. Starting from these
observations, the aim of DPM is to discuss and exchange ideas related
to data privacy management. We invite papers from researchers and
practitioners working in privacy, security, trustworthy data systems
and related areas to submit their original papers in this workshop.
Submissions by PhD students as well as controversial ideas are
encouraged. Case studies (successful or not) are also encouraged.

TOPICS
========

Topics of interest include, but are not limited to:

- Privacy Information Management
- Privacy Policy-based Infrastructures and Architectures
- Privacy-oriented Access Control Languages and Models
- Privacy in Trust Management
- Privacy in Cryptocurrencies
- Privacy Data Integration
- Privacy Risk Assessment and Assurance
- Privacy Services
- Privacy Policy Analysis
- Data Protection Regulations in Practice
- Cryptographic Protocols for Privacy
- Query Execution over Privacy Sensitive Data
- Privacy Preserving Data Mining
- Privacy for Integrity-based Computing
- Privacy Monitoring and Auditing
- Privacy in Social Networks
- Privacy in Ambient Intelligence (AmI) Applications
- Individual Privacy vs. Corporate/National Security
- Privacy in computer networks
- Privacy and RFIDs
- Privacy and Big Data
- Privacy in sensor networks
- Privacy in the Internet of Things


PAPER SUBMISSIONS
===================

Submitted papers must not substantially overlap papers that have been
published or that are simultaneously submitted to a journal or a
conference with proceedings. Papers can be submitted as Full Papers or
Short Papers. Full papers should be at most 16 pages in the LNCS
format, including the bibliography and well-marked appendices. Short
papers should be at most 8 pages in the LNCS format, including the
bibliography and well-marked appendices. Program Committee members are
not required to read the appendices, so papers should be intelligible
without them.

Authors should indicate whether their paper is a short paper to
differentiate them from full papers. All submissions must be written
in English. It is planned to have accepted papers published by
Springer in the Lecture Notes in Computer Science (LNCS) series, the
LNCS template can be found at
http://www.springer.com/computer/lncs/lncs+authors.

Authors must submit their papers by the indicated deadline, using the
EasyChair web site (at
https://easychair.org/conferences/?conf=dpm2021). Only PDF files will
be accepted (a Latex source file will be required for the final
version of the accepted papers). All papers will be refereed. Accepted
papers must be presented at the Workshop. At least one author of each
accepted paper must register to the workshop, by the early date
indicated by the organizers, and present the paper.


PROGRAM CHAIRS
===============

- Joaquin Garcia-Alfaro (Institut Polytechnique de Paris)
- Guillermo Navarro-Arribas (Universitat Autonoma de Barcelona)
- Miquel Soriano (Universitat Politecnica de Catalunya)

PROGRAM COMMITTEE
=================

- Esma Aimeur (University of Montreal)
- Ken Barker (University of Calgary)
- Elisa Bertino (Purdue University)
- Jordi Casas-Roma (Universitat Oberta de Catalunya)
- Mauro Conti (University of Padua)
- Frederic Cuppens (Polytechnique Montreal)
- Nora Cuppens-Boulahia (Polytechnique Montreal)
- Sabrina De Capitani di Vimercati (University of Milan)
- Nicolas E. Diaz Ferreyra (University of Duisburg-Essen)
- Josep Domingo-Ferrer (Universitat Rovira i Virgili)
- Jose M. De Fuentes (Universidad Carlos III de Madrid)
- Sebastien Gambs (Universite du Quebec a Montreal)
- Javier Herranz (Universitat Politecnica de Catalunya)
- Marc Juarez (University of Southern California)
- Christos Kalloniatis (University of the Aegean)
- Florian Kammueller (Middlesex University London)
- Sokratis Katsikas (Norwegian University of Science and Technology)
- Hiroaki Kikuchi (Meiji University)
- Evangelos Kranakis (Carleton University)
- Alptekin Kupcu (Koc University)
- Costas Lambrinoudakis (University of Piraeus)
- Maryline Laurent (Institut Mines-Telecom)
- Giovanni Livraga (University of Milan)
- Brad Malin (Vanderbilt University)
- Chris Mitchell (Royal Holloway, University of London)
- Martin Ochoa (AppGate Inc.)
- Melek Onen (EURECOM)
- Gerardo Pelosi (Politecnico di Milano)
- Silvio Ranise (Fundazione Bruno Kessler)
- Kai Rannenberg (Goethe University Frankfurt)
- Ruben Rios (Universidad de Malada)
- Pierangela Samarati (University of Mila)
- Vicenc Torra (Umea University)
- Yasuyuki Tsukada (Kanto Gakuin University)
- Alexandre Viejo (Universitat Rovira i Virgili)
- Isabel Wagner (De Montfort University)
- Jens Weber (University of Victoria)
- Lena Wiese (University of Gottingen)
- Nicola Zannone (Eindhoven University of Technology)

SPONSORS
=========

The UNESCO Chair in Data Privacy will offer stipends to offset some of
the costs associated with participating in the DPM workshop for
participants coming from transition countries, which we define as
those having GDP per capita less than 20000 international dollars,
according to the World Bank's list. Priority will be given to authors
and students. Interested participants please send a mail with your
vitae to dpm2021@easychair.org

It is expected that extended and revised version of the best papers
from the workshop will be considered for international journal special
issues.

This call for papers and additional information about the conference
can be found at https://deic-web.uab.cat/conferences/dpm/dpm2021/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD Position, Combinatorial Optimization with Uncertainty, University of Twente

PhD Position at the University of Twente
====================================
Combinatorial Optimization with Uncertainty
====================================

A PhD Position is available in the group Discrete Mathematics and Mathematical
Programming (DMMP) at the University of Twente (UT, Enschede, Netherlands).
For this position, we are looking for a highly motivated and enthusiastic
researcher with (or who will shortly acquire) an MSc degree in Mathematics,
Computer Science, Econometrics or a related field. A solid background in
Discrete Optimization, Theoretical Computer Science, Online Optimization,
Approximation Algorithms or Mechanism Design is highly appreciated but
not a must.

The position is fully funded for four years in accordance with the Dutch
Collective Labour Agreement for Universities (CAO).

For more information about the position and how to apply please visit the
careers page of the university:
https://www.utwente.nl/en/organisation/careers/!/103/
The deadline for applications is September 12.

If you have any questions, you can send them to the email address given below.

Ruben Hoeksma
University of Twente
Department of Applied Mathematics
Discrete Mathematics and Mathematical Programming
Enschede, The Netherlands
Email: r.p.hoeksma@utwente.nl
https://people.utwente.nl/r.p.hoeksma

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Final CFP: CGTA Special Issue on Experimental Aspects of Computational Geometry

FINAL CALL FOR PAPERS

Special Issue on Experimental Aspects of Computational Geometry
of
Computational Geometry: Theory and Applications


CGTA is known as a forum for all aspects of computational geometry. The
emphasis of this special issue is on original results that bridge the
often wide gaps between theory and practice by algorithm engineering and
careful experimental evaluation. This includes but is not limited to
numerical, graph theoretical, and combinatorial aspects of computational
geometry as well as algorithms and data structures with a geometric
flavor that arise in application areas, such as computer graphics,
pattern recognition, robotics, image processing, visual computing, graph
drawing, computer-aided (geometric) design and computer-aided
manufacturing, VLSI design, operations research and computational
optimization, and geographical information systems.

This special issue will be edited by Martin Held, Martin Nöllenburg and
Peter Sanders.

New extended deadline for manuscript submission: 15-August-2021.


Manuscript Submission Information
==================================

Manuscripts can be submitted until the deadline. All submissions will be
thoroughly evaluated in a single-blind peer-review process by at least
three independent reviewers on the basis of relevance for the special
issue, novelty, clarity, originality, significance of contribution,
technical quality, and quality of presentation. The guest editors
reserve the right to reject without review any submissions deemed to be
outside the scope of the special issue. Authors are welcome to contact
the special issue editors with questions about scope before preparing a
submission.

Manuscripts submitted for review should represent original, previously
unpublished work or surveys of important results. At the time of
submission, and for the entire review period, the paper (or essentially
the same paper) should neither be under review by any conference with
published proceedings nor by a scientific journal. If any portion of
your submission has previously appeared in or will appear in
conference/workshop proceedings, you should notify this at the time of
submission, make sure that the submission references the conference
publication, and supply a copy of the conference version(s). Please also
provide a brief description of the differences between the submitted
manuscript and the preliminary version(s).

Authors are encouraged to include a link to the source code and/or
datasets (e.g. on the OSF.io platform) to increase confidence in the
reproducibility of their experiments. Codes provided by the authors may
be read and/or executed at the reviewers' discretion.

Manuscripts should be submitted online via Elsevier's Editorial Manager;
see https://www.editorialmanager.com/comgeo/default.aspx. We refer to
https://www.elsevier.com/journals/computational-geometry/0925-7721/guide-for-authors
for a general guide for authors.

Accepted papers will be published continuously online (as soon as
accepted). Hence, there will be no delay due to one slow paper.


Open-Access Policy
==================

In addition to the standard open access options of CGTA
(https://www.elsevier.com/journals/computational-geometry/0925-7721/open-access-options)
all papers in this special issue will be freely available for the first
six months after publication.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Tuesday, July 20, 2021

[DMANET] [10 DAYS - SECOND SUBMISSION]: 2nd Joint Workshop on CPS&IoT Security and Privacy (CPSIoTSec 2021) - for papers rejected from ACM CCS 2021 [FIRM DEADLINE: JULY 30th, 2021]

---------------------------------------------------------------------------------------------------------------
C a l l F o r P a p e r s

2nd Joint Workshop on CPS&IoT Security and Privacy (CPSIoTSec 2021)

**** SECOND SUBMISSION DEADLINE APPLICABLE ONLY TO PAPERS REJECTED FROM
ACM CCS 2021 *****
**** FIRM DEADLINE: JULY 30th, 2021
*****

Seoul, South Korea, November 15 (Monday), 2021

URL: https://cpsiotsec.github.io

co-located with the ACM Conference on Computer and Communications
Security (ACM CCS 2021)

---------------------------------------------------------------------------------------------------------------

===================
CONFERENCE OUTLINE:
===================

The Joint Workshop on CPS&IoT Security and Privacy invites academia,
industry, and governmental entities to submit:

- Original research papers on the security and privacy of CPS&IoT
- Systematization of Knowledge (SoK) papers on the security and privacy
of CPS&IoT
- Demos (hands-on or videos) of testbeds/experiences of CPS&IoT
security and privacy research

We seek submissions from multiple interdisciplinary backgrounds tackling
security and privacy issues in CPS&IoT,
including but not limited to:

- Mathematical foundations for secure CPS/IoT
- Control-theoretic approaches
- High assurance security architectures
- Security and resilience metrics
- Metrics and risk assessment approaches
- Identity and access management
- Privacy and trust
- Network security
- Game theory applied to CPS/IoT security
- Human factors, humans in the loop, and usable security
- Understanding dependencies among security, reliability and safety in
CPS/IoT
- Economics of security and privacy
- Intrusion and anomaly detection
- Model-based security systems engineering
- Sensor and actuator attacks
- CPS/IoT malware analysis
- CPS/IoT firmware analysis
- Hardware-assisted CPS/IoT security

Also of interest will be papers that can point the research community to
new research directions, and those that
can set research agendas and priorities in CPS/IoT security and privacy.
There will be a best paper award.

=================
PAPER SUBMISSION:
=================

Submissions include long papers (12 pages), short papers (6 pages), and
abstracts (1 page):

- Long papers include a) Original research on a CPS/IoT security and
privacy topic, b) Systematization of Knowledge of CPS/IoT security and
privacy;
- Short papers include original work-in-progress research on a CPS/IoT
security and privacy topic; and
- 1-page abstracts include demos/interesting findings/insights on
CPS/IoT security and privacy, which will be accompanied by a hands-on
demo during the workshop.

Submitted papers must include appendices and references (except for SoK
papers where references are excluded).

Submissions must use the ACM SIG Proceedings Templates (see
https://www.acm.org/publications/proceedings-template,
with a simpler version here: https://github.com/acmccs/format). Only PDF
files will be accepted.

Accepted papers will be published by the ACM Press and/or the ACM
Digital Library. Submissions must not substantially overlap
with papers that have been published or that are simultaneously
submitted to a journal or a conference with proceedings. Each
accepted paper must be presented by a registered author. Submissions not
meeting these guidelines risk immediate rejection.
For questions about these policies, please contact the chairs.

NEW FOR 2021: The workshop will feature a second paper submission
deadline for papers that have been submitted but not accepted to the
main conference.
The deadline will be 10 days after the paper notification is out.
Authors are not required to upload CCS reviews; verification of CCS
submission status will be done
by informing the program chairs of the paper ID of the CCS submission.

Paper submission site:
https://easychair.org/conferences/?conf=cpsiotsec2021

================
IMPORTANT DATES:
================

- **FIRM** Submission deadline: ***July 13, 2021*** (23:59 Anywhere on
Earth).
- **FIRM** Submission deadline applicable only to papers rejected from
ACM CCS 2021: ***July 30, 2021*** (23:59 Anywhere on Earth).
- Notification of acceptance/rejection (tentative): August 13, 2021.
- Deadline for submission of camera-ready papers (hard deadline):
September 6, 2021

=========================
Program Committee Chairs:
=========================

- Cristina Alcaraz, University of Malaga, Spain
– Michail Maniatakos, New York University Abu Dhabi, UAE

==================
Program Committee:
==================

- Magnus Almgren, Chalmers University, Sweden
– Rakesh Bobba, Oregon State University, USA
- Gedare Bloom, University of Colorado Colorado Springs, USA
– Alvaro Cardenas, UC Santa Cruz, USA
– Mauro Conti, University of Padua, Italy
– Yongkai Fan, Communication University of China, China
– Vasileios Gkioulos, Norwegian University of Science and Technology,
Norway
– Dawu Gu, Shanghai Jiao Tong University, China
– Le Guan, University of Georgia, USA
– Gerhard Hancke, City University of Hong Kong
– Monowar Hasan, Wichita State University, USA
– Sokratis Katsikas, Open University of Cyprus, Cyprus
– Charalambos Konstantinou, Florida State University, USA
– Marina Krotofil, Honeywell Industrial Cyber Security Lab, USA
– Peng Liu, Pennsylvania State University, USA
– Xiaofeng Lu, Beijing University of Posts and Telecommunications, China
– Emil Lupu, Imperial College, UK
– Weizhi Meng, Technical Universtiy of Denmark, Denmark
- Sibin Mohan, University of Illinois at Urbana-Champaign, USA
– Awais Rashid, University of Bristol, UK
– George Stergiopoulos, University of the Aegean, Greece
– Habeeb Olufowobi, Howard University, USA
– Gang Tan, Pennsylvania State University, USA
– Nils Ole Tippenhauer, CISPA Helmholtz Center for Information Security,
Germany
– Nektarios Georgios Tsoutsos, University of Delaware, USA
– Claire Vishik, Intel, USA
– Avishai Wool, Tel Aviv University, Israel
– Min Yang, Fudan Fudan University
– Stefano Zanero, Politecnico di Milano, Italy China
– Yuqing Zhang, University of CAS–Jianying Zhou, Singapore University of
Technology and Design, Singapore
– Saman Zonouz, Rutgers University, USA

===================
Steering Committee:
===================

- Rakesh Bobba, Oregon State University
– Alvaro Cardenas, University of California, Santa Cruz
– Peng Liu, Penn State University–Sibin Mohan, University of Illinois at
Urbana-Champaign
– Awais Rashid, University of Bristol
– Gang Tan, Penn State University
– Nils Ole Tippenhauer, CISPA–Roshan Thomas, MITRE
– Yuqing Zhang, University of CAS

================
Publicity Chair:
================

- Sergio Gonzalez, University of Malaga, Spain

==========
Web Chair:
==========

- Monowar Hasan, Wichita State University, USA
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CALL FOR PARTICIPATION, DARe Workshop

CALL FOR PARTICIPATION



DARe 2021: 1st Workshop on Distributed Algorithms on Realistic Network
Models

(in conjunction with PODC 2021)

JULY 30 2021

https://podc-dare.github.io/



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

SPEAKERS

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



Stefan Schmid

Patrice Ossana de Mendez

Thomas Bläsius

Michael Dinitz

Pedro Montealegre

Soheil Behnezhad

Andrzej Czygrinow

Janne Korhonen



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

TOPIC

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


The main goal of the workshop is to create a platform for the exchange of

tools, ideas, and questions between researchers working on different

aspects of networks and distributed algorithms. The concepts from the
ever-growing

area of sparse graphs and from network science are not widely known

in the distributed community, and we aim at connecting these research
topics.

We hope that the workshop will foster new cross-field collaborations that

will lead to strong new results. In particular, we hope that the workshop

the usage of structural graph theory in larger systems. On the other hand,

we expect that researchers working on practical problems (both on physical

and social networks) can show possible new directions for theoretical

researches that are relevant for practical applications



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

REGISTRATION

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



Registration is free but mandatory

Check https://podc.org/data/podc2021/registration.html

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

Workshop Organizers

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



Saeed Amiri, University of Cologne

Laurent Feuilloley, University of Lyon 1

Sebastian Siebertz, University of Bremen

Alexandre Vigny, University of Bremen
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************