DagRep.11.8.115.pdf
- Filesize: 3.7 MB
- 14 pages
Document
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 11, Issue 8
Volume: Dagstuhl Reports, Volume 11
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2022-02-18
Cite AsGet BibTex
Daniel Král’, Michał Pilipczuk, Sebastian Siebertz, and Blair D. Sullivan. Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). In Dagstuhl Reports, Volume 11, Issue 8, pp. 115-128, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/DagRep.11.8.115
https://doi.org/10.4230/DagRep.11.8.115
Abstract
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.
Subject Classification
ACM Subject Classification
- 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
Keywords
- Algorithm design
- Parameterised complexity
- Sparse graphs
- Graph decompositions
- Model theory
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads