Tuesday, June 5, 2018

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

ICALP 2018 Satellite Workshop

"Algorithmic Aspects of Temporal Graphs"

Prague, Czech Republic, Monday 9 July 2018.


We kindly invite you to participate at the ICALP 2018 satellite workshop
on "Algorithmic Aspects of Temporal Graphs" which will be held in Prague
(Czech Republic) on Monday 9 July 2018. 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.

A participant can register only to the workshop (Monday 9 July), or to
both the workshop and the conference (Monday 9 July to Friday 13 July).

Full information about the registration to the workshop and/or the
conference (ICALP 2018), as well as about accommodation, is given here:

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


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
Department of Computer Science
Durham University, UK
Tel: +44 (0) 191 33 42 429
Email: george.mertzios@durham.ac.uk
* 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.
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/