Postponement of the workshop (13 March 2020).
Due to the on-going development of the coronavirus in the UK and the corresponding advice from the University of Liverpool, it is decided to postpone the workshop until things become normal. The workshop will be rescheduled for some time in the future when the situation becomes more predictable.
Due to the on-going development of the coronavirus in the UK and the corresponding advice from the University of Liverpool, it is decided to postpone the workshop until things become normal. The workshop will be rescheduled for some time in the future when the situation becomes more predictable.
Temporal graph theory is an emerging area motivated by the need of mathematical foundations for analysis of temporal networks arising from rich and rapidly growing domain of modern systems with dynamic interactions including Internet, mobile-phone networks, ecological networks, social networks, wireless ad hoc networks, transportation networks, etc.
The aims of this one-day workshop are:
- highlight and strengthen the links between temporal graph theory and other areas of mathematics and computer science;
- bring together interested academics from computer science, mathematics and other areas and stimulate cross-fertilizing discussion;
- foster an interest in the new exciting field and challenging problems in the participants, especially in postgraduate students and early career researchers.
The event if free of charge, but registration is required in order to arrange the coffee breaks and reception.
The workshop is suppored by The London Mathematical Society, Networks Sciences & Technologies initiative, and the Department of Computer Science of the University of Liverpool.
Invited Speakers
Schedule
| 10:00 | Registration & Coffee | |||
|---|---|---|---|---|
| 10:30 | ||||
| 11:00 | Kitty Meeks Changing times to optimise reachability in temporal graphs | |||
| 11:30 | Alexey Pokrovskiy Long monotone paths in edge-ordered graphs | |||
| 12:00 | Lunch | |||
| 12:30 | ||||
| 13:00 | ||||
| 13:30 | ||||
| 14:00 | Viktor Zamaraev Computing maximum matchings in temporal graphs | |||
| 14:30 | Thomas Erlebach Strict and non-strict temporal exploration | |||
| 15:00 | Coffee break | |||
| 15:30 | Open Problem Session | |||
| 16:00 | Wine Reception | |||
| 16:30 | ||||
Supported by
