[DMANET] ICALP 2021 Satellite Workshop: Algorithmic Aspects of Temporal Graphs

******************************
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
<https://mertzios.net/Workshops/ICALP-21-Satellite/Temporal-Graphs-ICALP-2021.html>
******************************

We kindly invite you to participate at the 4th ICALP satellite workshop
on "Algorithmic Aspects of Temporal Graphs" which will be held via Zoom
on Monday 12 July 2021. In this one-day workshop, recent advances in the
area of temporal / dynamically changing graphs will be presented, as
well as some of the key challenges will be highlighted.

The workshop will run online on zoom. To receive the zoom link and the
password for the workshop, please register as soon as possible (free of
charge) using this link: https://www.eventbrite.co.uk/e/153473012913

** Registration to the workshop is free of charge (via the link:
https://www.eventbrite.co.uk/e/153473012913) **

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)

Link to the ICALP 2021 conference: http://easyconferences.eu/icalp2021/
<http://easyconferences.eu/icalp2021/registration/>

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

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!



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