Algorithmic Aspects of Temporal Graphs III*
Satellite workshop of ICALP 2020
Tuesday 7 July 2020
(held online due to the corona pandemic)
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.
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. As this research area grows and broadens, our aim is to bring together people from theoretical and practical communities of temporal graphs in order to establish new and strengthen existing links between these communities.
Presentations are given by invitation only. Everyone is welcome to register and attend.
Every presentation is given 25 minutes in total, which is expected to be 20 minutes of talk and 5 minutes of questions.
The presentations are grouped into four sessions (two in the morning and two in the afternoon).
Details of the invited speakers and the schedule can be found below.
Access to the workshops will be free of charge, i.e. will not require a paid registration.
However, a light-weight authentication mechanism may need to be put in place
(details will be announced here).
Full information about the registration to the main conference (ICALP 2020) is given here:
Workshop Schedule (tentative)
|9:30-9:55||Arnaud Casteigts (LaBRI and University of Bordeaux, France) TBA|
|9:55-10:20||Amitabh Trehan (Loughborough University, UK) TBA|
|10:20-10:45||Clémence Magnien (CNRS and LIP6, Sorbonne Université, France) TBA|
|11:15-11:40||Hendrik Molter (Technical University Berlin, Germany) TBA|
|11:40-12:05||Till Fluschnik (Technical University Berlin, Germany) TBA|
|12:05-12:30||Philipp Zschoche (Technical University Berlin, Germany) TBA|
|14:00-14:25||Thomas Erlebach (University of Leicester, UK) TBA|
|14:25-14:50||Andrea Clementi (University of Rome Tor Vergata, Italy) TBA|
|14:50-15:15||Othon Michail (University of Liverpool, UK) TBA|
|15:45-16:10||Julia Stoyanovich (New York University Tandon School of Engineering, USA) TBA|
|16:10-16:35||Nicola Santoro (Carleton University, Canada) TBA|
|16:35-17:00||Paola Flocchini (University of Ottawa, Canada) TBA|
Arnaud Casteigts (LaBRI and University of Bordeaux, France)
Amitabh Trehan (Loughborough University, UK)
Clémence Magnien (CNRS and LIP6, Sorbonne Université, France)
Hendrik Molter (Technical University Berlin, Germany)
Till Fluschnik (Technical University Berlin, Germany)
Philipp Zschoche (Technical University Berlin, Germany)
Thomas Erlebach (University of Leicester, UK)
Andrea Clementi (University of Rome Tor Vergata, Italy)
Othon Michail (University of Liverpool, UK)
Julia Stoyanovich (New York University Tandon School of Engineering, USA)
Nicola Santoro (Carleton University, Canada)
Paola Flocchini (University of Ottawa, Canada)
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)
* Partially supported by the EPSRC grants EP/P020372/1 and EP/P02002X/1, and by the EEE/CS University of Liverpool Initiative NeST.