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

Copy to Clipboard Download

@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/entities/document/10.4230/DagRep.11.8.115},
  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}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode