BibTeX Export for Dagstuhl Reports, Volume 3, Issue 3

Copy to Clipboard Download

@Article{DagRep.3.3,
  title =	{{Dagstuhl Reports, Volume 3, Issue 03, March 2013, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.3},
  URN =		{urn:nbn:de:0030-drops-41663},
  doi =		{10.4230/DagRep.3.3},
  annote =	{Keywords: Dagstuhl Reports, Volume 3, Issue 03, March 2013, Complete Issue}
}
@Article{DagRep.3.3.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 3, Issue 03, 2013}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.3.i},
  URN =		{urn:nbn:de:0030-drops-41658},
  doi =		{10.4230/DagRep.3.3.i},
  annote =	{Keywords: Dagstuhl Reports, Table of Contents, Volume 3, Issue 03, 2013}
}
@Article{cheong_et_al:DagRep.3.3.1,
  author =	{Cheong, Otfried and Mehlhorn, Kurt and Teillaud, Monique},
  title =	{{Computational Geometry (Dagstuhl Seminar 13101)}},
  pages =	{1--23},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{3},
  editor =	{Cheong, Otfried and Mehlhorn, Kurt and Teillaud, Monique},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.3.1},
  URN =		{urn:nbn:de:0030-drops-40210},
  doi =		{10.4230/DagRep.3.3.1},
  annote =	{Keywords: Algorithms, geometry, theory, approximation, implementation, combinatorics, topology}
}
@Article{albers_et_al:DagRep.3.3.24,
  author =	{Albers, Susanne and Boxma, Onno J. and Pruhs, Kirk},
  title =	{{Scheduling (Dagstuhl Seminar 13111)}},
  pages =	{24--50},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{3},
  editor =	{Albers, Susanne and Boxma, Onno J. and Pruhs, Kirk},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.3.24},
  URN =		{urn:nbn:de:0030-drops-40244},
  doi =		{10.4230/DagRep.3.3.24},
  annote =	{Keywords: Scheduling, Algorithms, Stochastic, Optimization, Queuing}
}
@Article{demaine_et_al:DagRep.3.3.51,
  author =	{Demaine, Erik D. and Fomin, Fedor V. and Hajiaghayi, MohammadTaghi and Thilikos, Dimitrios M.},
  title =	{{Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121)}},
  pages =	{51--74},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{3},
  editor =	{Demaine, Erik D. and Fomin, Fedor V. and Hajiaghayi, MohammadTaghi and Thilikos, Dimitrios M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.3.51},
  URN =		{urn:nbn:de:0030-drops-40131},
  doi =		{10.4230/DagRep.3.3.51},
  annote =	{Keywords: Graph Minors, Treewidth, Graph algorithms, Parameterized Algorithms}
}
@Article{crowcroft_et_al:DagRep.3.3.75,
  author =	{Crowcroft, Jon and Fidler, Markus and Nahrstedt, Klara and Steinmetz, Ralf},
  title =	{{Future Internet (Dagstuhl Seminar 13131)}},
  pages =	{75--99},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{3},
  editor =	{Crowcroft, Jon and Fidler, Markus and Nahrstedt, Klara and Steinmetz, Ralf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.3.75},
  URN =		{urn:nbn:de:0030-drops-40736},
  doi =		{10.4230/DagRep.3.3.75},
  annote =	{Keywords: Future Internet, Network Design, Testbed, Software Defined Networking, Virtualization, OpenFlow}
}

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