@Article{DagRep.1.5,
  title =	{{Dagstuhl Reports, Volume 1, Issue 5, May 2011, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{5},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.5},
  URN =		{urn:nbn:de:0030-drops-32602},
  doi =		{10.4230/DagRep.1.5},
  annote =	{Keywords: Dagstuhl Reports, Volume 1, Issue 5, May 2011, Complete Issue}
}
@Article{DagRep.1.5.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 1, Issue 5, 2011}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{5},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.5.i},
  URN =		{urn:nbn:de:0030-drops-32596},
  doi =		{10.4230/DagRep.1.5.i},
  annote =	{Keywords: Table of Contents, Frontmatter}
}
@Article{bellman_et_al:DagRep.1.5.1,
  author =	{Bellman, Kirstie and Herkersdorf, Andreas and Hinchey, Michael G.},
  title =	{{Organic Computing - Design of Self-Organizing Systems (Dagstuhl Seminar 11181)}},
  pages =	{1--28},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{5},
  editor =	{Bellman, Kirstie and Herkersdorf, Andreas and Hinchey, Michael G.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.5.1},
  URN =		{urn:nbn:de:0030-drops-32019},
  doi =		{10.4230/DagRep.1.5.1},
  annote =	{Keywords: Organic Computing, Self-Organization, Adaptivity, Trustworthy System Design}
}
@Article{brandstadt_et_al:DagRep.1.5.29,
  author =	{Brandst\"{a}dt, Andreas and Golumbic, Martin Charles and Heggernes, Pinar and McConnell, Ross},
  title =	{{Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182)}},
  pages =	{29--46},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{5},
  editor =	{Brandst\"{a}dt, Andreas and Golumbic, Martin Charles and Heggernes, Pinar and McConnell, Ross},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.5.29},
  URN =		{urn:nbn:de:0030-drops-32027},
  doi =		{10.4230/DagRep.1.5.29},
  annote =	{Keywords: Graph Classes, Graph Algorithms, NP-completeness, Width Parameters, Approximation Algorithms, Parameterized Complexity}
}
@Article{demetrescu_et_al:DagRep.1.5.47,
  author =	{Demetrescu, Camil and Kaufmann, Michael and Kobourov, Stephen and Mutzel, Petra},
  title =	{{Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191)}},
  pages =	{47--60},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{5},
  editor =	{Demetrescu, Camil and Kaufmann, Michael and Kobourov, Stephen and Mutzel, Petra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.5.47},
  URN =		{urn:nbn:de:0030-drops-32046},
  doi =		{10.4230/DagRep.1.5.47},
  annote =	{Keywords: Algorithm Engineering, Graph Drawing}
}
@Article{deraedt_et_al:DagRep.1.5.61,
  author =	{De Raedt, Luc and Nijssen, Siegfried and O'Sullivan, Barry and Van Hentenryck, Pascal},
  title =	{{Constraint Programming meets Machine Learning and Data Mining (Dagstuhl Seminar 11201)}},
  pages =	{61--83},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{5},
  editor =	{De Raedt, Luc and Nijssen, Siegfried and O'Sullivan, Barry and Van Hentenryck, Pascal},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.5.61},
  URN =		{urn:nbn:de:0030-drops-32077},
  doi =		{10.4230/DagRep.1.5.61},
  annote =	{Keywords: Machine learning, data mining, constraint programming, constraints}
}
@Article{grandine_et_al:DagRep.1.5.84,
  author =	{Grandine, Thomas A. and Hahmann, Stefanie and Peters, J\"{o}rg and Wang, Wenping},
  title =	{{Geometric Modeling (Dagstuhl Seminar 11211)}},
  pages =	{84--107},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{5},
  editor =	{Grandine, Thomas A. and Hahmann, Stefanie and Peters, J\"{o}rg and Wang, Wenping},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.5.84},
  URN =		{urn:nbn:de:0030-drops-32132},
  doi =		{10.4230/DagRep.1.5.84},
  annote =	{Keywords: Geometric modeling, design, curve and surface modeling, splines, CAD, B-splines, reconstruction, subdivision methods, multiresolution, parameterization}
}