Algorithmic Aspects of Temporal Graphs VII*

Satellite workshop of ICALP 2024
Tallinn, Estonia
Sunday 7 July 2024


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 \(G_1, G_2, \ldots\) 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.

The topic of the workshop is of high interest and relevance to ICALP track A, as it mainly focuses on algorithms and computational complexity, but it can also straddle to parameterized complexity, structural graph theory, combinatorial optimization, distributed and mobile computing, as well as randomness in computation.

This workshop is the sequel of the six previous workshops at ICALP 2023 (in Paderborn and online, hybrid mode), ICALP 2022 (in Paris and online, hybrid mode), ICALP 2021 (online), ICALP 2020 (online), ICALP 2019 (in Patras), and ICALP 2018 (in Prague).

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


Practical information

Every presentation is given 30 minutes in total, which is expected to be 20-25 minutes of talk and 5-10 minutes for questions and change-over. The presentations are grouped into four sessions (two in the morning and two in the afternoon). Details of the speakers and the schedule will be announced over time.

For those who cannot attend in person, the meeting will also be hosted on zoom at the following link:

https://durhamuniversity.zoom.us/j/93457538321

To receive the password for the zoom session, please register as soon as possible (with your name and email address) using this link: https://forms.gle/4xRWYrAzML37C2WS9

After you register, we will send you the zoom login details by email. For the online participants, we will have the following rules in place for the workshop to run smoothly:
- Please log in to the Zoom meeting using your REAL NAME and AFFILIATION, e.g. "Eleni Akrida, Durham University" or "Eleni Akrida, Durham".
- Please keep your microphone muted unless you would like to speak publicly, e.g. when you ask a question.
- Should you have any questions while a speaker is presenting, please try to not interrupt (unless you think it is necessary). Instead, please prefer write "Q" (for "Question") or "C" (for "Comment") in the chat. After the talk is over and it is time for questions, the chair of the session will advise those who have commented to ask their questions.


Video Recording