2026-08-07T16:39:29Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:14689 2024-03-06T10:27:18Z ddc:004 open_access

Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171) Casteigts, Arnaud Meeks, Kitty Mertzios, George B. Niedermeier, Rolf algorithm engineering complex network analysis distributed computing models and classes parameterized complexity analysis This report documents the program and the outcomes of Dagstuhl Seminar 121171 "Temporal Graphs: Structure, Algorithms, Applications". The seminar was organized around four core areas: models, concepts, classes; concrete algorithmic problems; distributed aspects; applications. Because of the ongoing pandemic crisis, the seminar had to be held fully online, with talk and open problems sessions focussing on afternoons. Besides 19 contributed talks and small-group discussions, there were lively open-problem sessions, and some of the problems and research directions proposed there are part of this document. Despite strongly missing the usual Dagstuhl atmosphere and personal interaction possibilities, the seminar helped to establish new contacts and to identify new research directions in a thriving research area between (algorithmic) graph theory and network science. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Arnaud Casteigts and Kitty Meeks and George B. Mertzios and Rolf Niedermeier 2021 Is Part Of Dagstuhl Reports, Volume 11, Issue 3 (2021) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.11.3.16 urn:nbn:de:0030-drops-146892 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.3.16 eng https://creativecommons.org/licenses/by/4.0/legalcode