BibTeX Export for Dagstuhl Reports, Volume 11, Issue 3

Copy to Clipboard Download

@Article{DagRep.11.3,
  title =	{{Dagstuhl Reports, Volume 11, Issue 3, April 2021, Complete Issue}},
  pages =	{1--48},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.3},
  URN =		{urn:nbn:de:0030-drops-146861},
  doi =		{10.4230/DagRep.11.3},
  annote =	{Keywords: Dagstuhl Reports, Volume 11, Issue 3, March 2021, Complete Issue}
}
@Article{DagRep.11.3.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 11, Issue 3, 2021}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.3.i},
  URN =		{urn:nbn:de:0030-drops-146870},
  doi =		{10.4230/DagRep.11.3.i},
  annote =	{Keywords: Table of Contents, Frontmatter}
}
@Article{borner_et_al:DagRep.11.3.1,
  author =	{B\"{o}rner, Katy and Kobourov, Stephen},
  title =	{{Multi-Level Graph Representation for Big Data Arising in Science Mapping (Dagstuhl Seminar 21152)}},
  pages =	{1--15},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{3},
  editor =	{B\"{o}rner, Katy and Kobourov, Stephen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.3.1},
  URN =		{urn:nbn:de:0030-drops-146885},
  doi =		{10.4230/DagRep.11.3.1},
  annote =	{Keywords: graph theory, graph algorithms, science of science, cartography and map-like representations, network visualization, multi-level semantic zooming}
}
@Article{casteigts_et_al:DagRep.11.3.16,
  author =	{Casteigts, Arnaud and Meeks, Kitty and Mertzios, George B. and Niedermeier, Rolf},
  title =	{{Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171)}},
  pages =	{16--46},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{3},
  editor =	{Casteigts, Arnaud and Meeks, Kitty and Mertzios, George B. and Niedermeier, Rolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.3.16},
  URN =		{urn:nbn:de:0030-drops-146892},
  doi =		{10.4230/DagRep.11.3.16},
  annote =	{Keywords: algorithm engineering, complex network analysis, distributed computing, models and classes, parameterized complexity analysis}
}

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