Accepted Papers
Full Papers
- Families of tractable problems with respect to vertex-interval-membership width and its generalisations
Jessica Enright, Samuel Hand, Laura Larios-Jones and Kitty Meeks - Complexity gaps between point and interval temporal graphs for some reachability problems
Guillaume Aubian, Filippo Brunelli, Feodor Dragan, Guillaume Ducoffe, Michel Habib, Allen Ibiapina and Laurent Viennot - Broadcasts in anonymous, dynamic networks: A new algorithm and impossibility results
Volker Turau - Extending Ghouila-Houri’s characterization of comparability graphs to temporal graphs
Pierre Charbit, Michel Habib and Amalia Sorondo - Asynchronous rendezvous of anonymous deterministic mobile automata in the plane
Mohamed Anouar Baaziz and Andrzej Pelc - FO and MSO model checking on temporal graphs
Michelle Döring, Jessica Enright, Laura Larios-Jones and George Skretas - Asymptotic subspace consensus in dynamic networks
Matthias Függer and Thomas Nowak - Sublinear-time reconfiguration of programmable matter with joint movements
Manish Kumar, Othon Michail, Andreas Padalkin and Christian Scheideler - Nanobot algorithms for treatment of diffuse cancer
Noble Harasha and Nancy Lynch - Online algorithms for set packing with renewable capacities
Anya Chaturvedi, William K. Moses Jr., Christian Scheideler and Prudence Wong - Robust temporal cut
Jessica Enright, Thomas Erlebach, Kitty Meeks and Nils Morawietz - Designing sparse temporal graphs satisfying connectivity requirements
Thomas Bellitto, Jules Bouton Popper, Justine Cauvi, Bruno Escoffier and Raphaëlle Maistre - On sufficient conditions for short journeys in temporal graphs
David Ilcinkas, Nils Morawietz and Antoine Toullalan - Label correcting algorithms for the multiobjective temporal shortest path problem
Edina Marica, Clemens Thielen and Alina Wittmann - Searching for an eventually-emerging black hole in rings
FranCois Bonnet, Quentin Bramas and Anissa Lamani - Minimize the sum of waiting times in periodic temporal trees
Julia Meusel, Nils Morawietz, Matthias Müller-Hannemann and Klaus Reinhardt
Brief Announcements
- Brief Announcement: Exploration of always S-connected temporal graphs
Duncan Adamson and Paul G. Spirakis - Brief Announcement: Revisiting the realizability of periodic temporal graphs with bounded stretch
Julia Meusel, Nils Morawietz, Matthias Müller-Hannemann and Klaus Reinhardt - Brief Announcement: Time-travel planning with tenet turnstiles
Thibaut Blanc, Quentin Bramas, Jean-Romain Luttringer and Sebastien Tixeuil - Brief Announcement: A special case of maximum flow over time with network changes
Kristin Sheridan and Shuchi Chawla - Brief Announcement: DACH: Demand-aware consistent hashing with bounded loads and greedy routing
Arash Pourdamghani, Chen Avin and Stefan Schmid - Brief Announcement: Fault-tolerant 3D leader election in the Amoebot model
Daniel Warner and Christian Scheideler - Brief Announcement: Leader election with noisy reconfigurable circuits in the Amoebot model
Daniel Warner and Christian Scheideler - Brief Announcement: Adaptive self-organization in anonymous dynamic networks
Garrett Parzych and Joshua Daymude