October 25 – 30 , 2020, Dagstuhl Seminar 20441

CANCELLED Dynamic Graph Algorithms

Due to the Covid-19 pandemic, this seminar was cancelled.


Aaron Bernstein (Rutgers University – New Brunswick, US)
Shiri Chechik (Tel Aviv University, IL)
Sebastian Forster (Universität Salzburg, AT)
Monika Henzinger (Universität Wien, AT)
Tsvi Kopelowitz (Bar-Ilan University – Ramat Gan, IL)

For support, please contact

Jutka Gasiorowski for administrative matters

Andreas Dolzmann for scientific matters


The field of dynamic graph algorithms studies algorithms for processing graphs that are changing over time. Formally, the goal is to process an interleaved sequence of update and query operations, where an update operation changes the input graph (e.g. inserts/deletes an edge), while the query operation is problem-specific and asks for some property of the current graph - for example, an s-t path, or a minimum spanning tree. The field has evolved rapidly over the past decade, and this Dagstuhl Seminar aims to bring together leading researchers in dynamic algorithms and related areas of graph algorithms. Some specific goals for the seminar are outlined below.

  • Because the field has grown so much in recent years, one of the main motivations for this seminar is to establish the main challenges that remain - both a list of specific open problems that continue to resist progress, as well as a discussion of more general limitations to our current upper and lower bound techniques. The seminar will also provide a venue for the community to actively shape the direction of the field going forward.
  • Much of the recent progress in the field has stemmed from a new set of techniques, many of which originated in other areas of graph or approximation algorithms. One of the goals of this seminar is thus to discuss how recent developments in graph algorithms broadly construed can be applied to the dynamic setting in particular, and to disseminate some of the recent techniques that have already had tremendous success in this regard. To this end, we plan to organize several tutorials from top experts in the field.
  • The experimental evaluation of dynamic graph algorithms is still in its infancy. There are no established data sets or even evaluation methodologies. This seminar aims to include the leading researchers in the area of algorithms engineering of dynamic graph algorithms to address and, hopefully, resolve these fundamental questions.

Motivation text license
  Creative Commons BY 3.0 DE
  Aaron Bernstein, Shiri Chechik, Sebastian Forster, Monika Henzinger, and Tsvi Kopelowitz


  • Data Structures / Algorithms / Complexity


  • Graph algorithms
  • Dynamic graphs

Book exhibition

Books from the participants of the current Seminar

Book exhibition in the library, ground floor, during the seminar week.


In the series Dagstuhl Reports each Dagstuhl Seminar and Dagstuhl Perspectives Workshop is documented. The seminar organizers, in cooperation with the collector, prepare a report that includes contributions from the participants' talks together with a summary of the seminar.


Download overview leaflet (PDF).


Furthermore, a comprehensive peer-reviewed collection of research papers can be published in the series Dagstuhl Follow-Ups.

Dagstuhl's Impact

Please inform us when a publication was published as a result from your seminar. These publications are listed in the category Dagstuhl's Impact and are presented on a special shelf on the ground floor of the library.