[DMANET] Registration details: ICALP 2021 Satellite Workshop "Algorithmic Aspects of Temporal Graphs IV"

******************************
ICALP 2021 Satellite Workshop

"Algorithmic Aspects of Temporal Graphs IV"

Glasgow, Scotland, UK, Monday 12 July 2021 (held online due to Covid-19)

Website:
https://mertzios.net/Workshops/ICALP-21-Satellite/Temporal-Graphs-ICALP-2021.html

*REGISTRATION (free of charge):* https://forms.gle/U9cY9FhTeha6NXLTA
******************************

The 4th ICALP satellite workshop on "Algorithmic Aspects of Temporal
Graphs" will be held via Zoom on Monday 12 July 2021.

To receive the Zoom link and password for the workshop, you need to
*fill in the registration form* here: https://forms.gle/U9cY9FhTeha6NXLTA

Please note that the * Registration to the workshop is free of charge *

Workshop Organizers:
- George B. Mertzios (Durham University, UK)
- Paul G. Spirakis (University of Liverpool, UK and University of
Patras, Greece)
- Eleni C. Akrida (Durham University, UK)
- Viktor Zamaraev (University of Liverpool, UK)


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

Topic:
In modern systems the classical modeling paradigm using static graphs
may be restrictive or oversimplifying, as the interactions among the
elementary system units usually change over time in a highly dynamic
manner. For example, friendships are added and removed over time in a
social network and links in a communication network may change
dynamically, either according to a specific known pattern (satellites
following a trajectory) or in an unpredictable manner (mobile ad hoc
networks). The common characteristic in all these application areas is
that the system structure, i.e. graph topology, is subject to discrete
changes over time. In such dynamically changing graphs the notion of
vertex adjacency needs to be revisited and various graph concepts, e.g.
reachability and connectedness, now crucially depend on the exact
temporal ordering of the edges' presence.

A temporal graph is a graph that changes over time. Assuming discrete
time and a fixed set V of vertices, a temporal graph can be viewed as a
discrete sequence G1, G2, ... of static graphs, each with vertex set V.
Many notions and algorithms from the static case can be naturally
transferred in a meaningful way to their temporal counterpart, while in
other cases new approaches are needed to define the appropriate temporal
notions. In particular, some problems become radically different and
substantially more difficult when the time dimension is additionally
taken into account.

Presentations are given by invitation only. Everyone is welcome to
register and attend!

--
Dr. George B. Mertzios
Associate Professor in Computer Science
Department of Computer Science
Durham University, UK
Tel: +44 (0) 191 33 42 429
Email: george.mertzios@durham.ac.uk
https://community.dur.ac.uk/george.mertzios/

**********************************************************
*
* 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/
*
**********************************************************