BibTeX Export for Dagstuhl Reports, Volume 5, Issue 7

Copy to Clipboard Download

@Article{DagRep.5.7,
  title =	{{Dagstuhl Reports, Volume 5, Issue 7, July 2015, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{7},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.7},
  URN =		{urn:nbn:de:0030-drops-56816},
  doi =		{10.4230/DagRep.5.7},
  annote =	{Keywords: Dagstuhl Reports, Volume 5, Issue 7, July 2015, Complete Issue}
}
@Article{DagRep.5.7.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 5, Issue 7, 2015}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{7},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.7.i},
  URN =		{urn:nbn:de:0030-drops-56808},
  doi =		{10.4230/DagRep.5.7.i},
  annote =	{Keywords: Dagstuhl Reports, Table of Contents, Volume 5, Issue 7, 2015}
}
@Article{casanova_et_al:DagRep.5.7.1,
  author =	{Casanova, Henri and Deelman, Ewa and Robert, Yves and Schwiegelshohn, Uwe},
  title =	{{Algorithms and Scheduling Techniques to Manage Resilience and Power Consumption in Distributed Systems (Dagstuhl Seminar 15281)}},
  pages =	{1--21},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{7},
  editor =	{Casanova, Henri and Deelman, Ewa and Robert, Yves and Schwiegelshohn, Uwe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.7.1},
  URN =		{urn:nbn:de:0030-drops-56705},
  doi =		{10.4230/DagRep.5.7.1},
  annote =	{Keywords: Fault tolerance, Resilience, Energy efficiency, Distributed and high performance computing, Scheduling, Workflows}
}
@Article{bulatov_et_al:DagRep.5.7.22,
  author =	{Bulatov, Andrei A. and Guruswami, Venkatesan and Krokhin, Andrei and Marx, D\'{a}niel},
  title =	{{The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301)}},
  pages =	{22--41},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{7},
  editor =	{Bulatov, Andrei A. and Guruswami, Venkatesan and Krokhin, Andrei and Marx, D\'{a}niel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.7.22},
  URN =		{urn:nbn:de:0030-drops-56714},
  doi =		{10.4230/DagRep.5.7.22},
  annote =	{Keywords: Constraint satisfaction problem (CSP), Computational complexity, CSP dichotomy conjecture, Hardness of approximation, Unique games conjecture, Fixed-parameter tractability, Descriptive complexity, Universal algebra, Logic, Decomposition methods}
}
@Article{garciacastro_et_al:DagRep.5.7.42,
  author =	{Garcia Castro, Alexander and Hastings, Janna and Stevens, Robert and Weichselgartner, Erich},
  title =	{{Digital Scholarship and Open Science in Psychology and the Behavioral Sciences (Dagstuhl Perspectives Workshop 15302)}},
  pages =	{42--68},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{7},
  editor =	{Garcia Castro, Alexander and Hastings, Janna and Stevens, Robert and Weichselgartner, Erich},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.7.42},
  URN =		{urn:nbn:de:0030-drops-56721},
  doi =		{10.4230/DagRep.5.7.42},
  annote =	{Keywords: Digital Scholarship, Open Science, Psychology, Behavioral Sciences, e-Science}
}

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