Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391)
This report documents the program and the outcomes of Dagstuhl Seminar 21391 "Sparsity in Algorithms, Combinatorics and Logic". The seminar took place in a hybrid format from September 26 - October 1, 2021 and brought together 61 researchers. This report includes a discussion of the motivation of the seminar, presentation of the overall organization, abstracts of talks, and a report from each of the working groups.
Algorithm design
Parameterised complexity
Sparse graphs
Graph decompositions
Model theory
Theory of computation~Parameterized complexity and exact algorithms
Theory of computation~Graph algorithms analysis
Theory of computation~Finite Model Theory
Mathematics of computing~Graph theory
115-128
Regular Paper
Daniel
Král’
Daniel Král’
Masaryk University - Brno, CZ
Michał
Pilipczuk
Michał Pilipczuk
University of Warsaw, PL
Sebastian
Siebertz
Sebastian Siebertz
University of Bremen, DE
Blair D.
Sullivan
Blair D. Sullivan
University of Utah - Salt Lake City, US
10.4230/DagRep.11.8.115
Daniel Král’, Michał Pilipczuk, Sebastian Siebertz, and Blair D. Sullivan
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode