BibTeX Export for Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)

Copy to Clipboard Download

@Article{jansen_et_al:DagRep.1.2.67,
  author =	{Jansen, Klaus and Matieu, Claire and Shachnai, Hadas and Young, Neal E.},
  title =	{{Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)}},
  pages =	{67--93},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{Jansen, Klaus and Matieu, Claire and Shachnai, Hadas and Young, Neal E.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.1.2.67},
  URN =		{urn:nbn:de:0030-drops-31579},
  doi =		{10.4230/DagRep.1.2.67},
  annote =	{Keywords: Packing, scheduling, information and communication services, combinatorial optimization, mathematical programming, parameterized complexity}
}

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