License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.11.3.16
URN: urn:nbn:de:0030-drops-146892
URL: https://drops.dagstuhl.de/opus/volltexte/2021/14689/
Go back to Dagstuhl Reports


Casteigts, Arnaud ; Meeks, Kitty ; Mertzios, George B. ; Niedermeier, Rolf
Weitere Beteiligte (Hrsg. etc.): Arnaud Casteigts and Kitty Meeks and George B. Mertzios and Rolf Niedermeier

Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171)

pdf-format:
dagrep_v011_i003_p016_21171.pdf (1 MB)


Abstract

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.

BibTeX - Entry

@Article{casteigts_et_al:DagRep.11.3.16,
  author =	{Casteigts, Arnaud and Meeks, Kitty and Mertzios, George B. and Niedermeier, Rolf},
  title =	{{Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171)}},
  pages =	{16--46},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{3},
  editor =	{Casteigts, Arnaud and Meeks, Kitty and Mertzios, George B. and Niedermeier, Rolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/14689},
  URN =		{urn:nbn:de:0030-drops-146892},
  doi =		{10.4230/DagRep.11.3.16},
  annote =	{Keywords: algorithm engineering, complex network analysis, distributed computing, models and classes, parameterized complexity analysis}
}

Keywords: algorithm engineering, complex network analysis, distributed computing, models and classes, parameterized complexity analysis
Collection: DagRep, Volume 11, Issue 3
Issue Date: 2021
Date of publication: 07.09.2021


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI