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.8.115
URN: urn:nbn:de:0030-drops-157718
URL: https://drops.dagstuhl.de/opus/volltexte/2022/15771/
Go back to Dagstuhl Reports


Král’, Daniel ; Pilipczuk, Michał ; Siebertz, Sebastian ; Sullivan, Blair D.
Weitere Beteiligte (Hrsg. etc.): Daniel Král’ and Michał Pilipczuk and Sebastian Siebertz and Blair D. Sullivan

Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391)

pdf-format:
dagrep_v011_i008_p115_21391.pdf (4 MB)


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.

BibTeX - Entry

@Article{kral'_et_al:DagRep.11.8.115,
  author =	{Kr\'{a}l’, Daniel and Pilipczuk, Micha{\l} and Siebertz, Sebastian and Sullivan, Blair D.},
  title =	{{Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391)}},
  pages =	{115--128},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{11},
  number =	{8},
  editor =	{Kr\'{a}l’, Daniel and Pilipczuk, Micha{\l} and Siebertz, Sebastian and Sullivan, Blair D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/15771},
  URN =		{urn:nbn:de:0030-drops-157718},
  doi =		{10.4230/DagRep.11.8.115},
  annote =	{Keywords: Algorithm design, Parameterised complexity, Sparse graphs, Graph decompositions, Model theory}
}

Keywords: Algorithm design, Parameterised complexity, Sparse graphs, Graph decompositions, Model theory
Collection: DagRep, Volume 11, Issue 8
Issue Date: 2022
Date of publication: 18.02.2022


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