BibTeX Export for Dagstuhl Reports, Volume 3, Issue 10

Copy to Clipboard Download

@Article{DagRep.3.10,
  title =	{{Dagstuhl Reports, Volume 3, Issue 10, October 2013, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{3},
  number =	{10},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.10},
  URN =		{urn:nbn:de:0030-drops-45033},
  doi =		{10.4230/DagRep.3.10},
  annote =	{Keywords: Dagstuhl Reports, Volume 3, Issue 10, October 2013, Complete Issue}
}
@Article{DagRep.3.10.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 3, Issue 10, 2013}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{3},
  number =	{10},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.10.i},
  URN =		{urn:nbn:de:0030-drops-45023},
  doi =		{10.4230/DagRep.3.10.i},
  annote =	{Keywords: Table of Contents, Frontmatter}
}
@Article{bjorner_et_al:DagRep.3.10.1,
  author =	{Bjorner, Nikolaj and H\"{a}hnle, Reiner and Nipkow, Tobias and Weidenbach, Christoph},
  title =	{{Deduction and Arithmetic (Dagstuhl Seminar 13411)}},
  pages =	{1--24},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{3},
  number =	{10},
  editor =	{Bjorner, Nikolaj and H\"{a}hnle, Reiner and Nipkow, Tobias and Weidenbach, Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.10.1},
  URN =		{urn:nbn:de:0030-drops-44250},
  doi =		{10.4230/DagRep.3.10.1},
  annote =	{Keywords: Automated Deduction; Program Verification; Arithmetic Constraint Solving}
}
@Article{hamacher_et_al:DagRep.3.10.25,
  author =	{Hamacher, Kay and Hubaux, Jean Pierre and Tsudik, Gene},
  title =	{{Genomic Privacy (Dagstuhl Seminar 13412)}},
  pages =	{25--35},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{3},
  number =	{10},
  editor =	{Hamacher, Kay and Hubaux, Jean Pierre and Tsudik, Gene},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.10.25},
  URN =		{urn:nbn:de:0030-drops-44267},
  doi =		{10.4230/DagRep.3.10.25},
  annote =	{Keywords: Genomics, Genetics, Health Data, Privacy Protection, Differential Privacy, Privacy by Design, Information Security, Cryptography, Secure Computation}
}
@Article{borradaile_et_al:DagRep.3.10.36,
  author =	{Borradaile, Glencora and Klein, Philp and Marx, D\'{a}niel and Mathieu, Claire},
  title =	{{Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421)}},
  pages =	{36--57},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{3},
  number =	{10},
  editor =	{Borradaile, Glencora and Klein, Philp and Marx, D\'{a}niel and Mathieu, Claire},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.10.36},
  URN =		{urn:nbn:de:0030-drops-44274},
  doi =		{10.4230/DagRep.3.10.36},
  annote =	{Keywords: Algorithms, planar graphs, theory, approximation, fixed-parameter tractable, network flow, network design, kernelization}
}
@Article{bojanczyk_et_al:DagRep.3.10.58,
  author =	{Bojanczyk, Mikolaj and Klin, Bartek and Kurz, Alexander and Pitts, Andrew M.},
  title =	{{Nominal Computation Theory (Dagstuhl Seminar 13422)}},
  pages =	{58--71},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{3},
  number =	{10},
  editor =	{Bojanczyk, Mikolaj and Klin, Bartek and Kurz, Alexander and Pitts, Andrew M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.10.58},
  URN =		{urn:nbn:de:0030-drops-44285},
  doi =		{10.4230/DagRep.3.10.58},
  annote =	{Keywords: nominal sets, Fraenkel-Mostowski sets}
}
@Article{grau_et_al:DagRep.3.10.72,
  author =	{Grau, Oliver and Magnor, Marcus A. and Sorkine-Hornung, Olga and Theobalt, Christian},
  title =	{{Real-World Visual Computing (Dagstuhl Seminar 13431)}},
  pages =	{72--91},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{3},
  number =	{10},
  editor =	{Grau, Oliver and Magnor, Marcus A. and Sorkine-Hornung, Olga and Theobalt, Christian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.10.72},
  URN =		{urn:nbn:de:0030-drops-44322},
  doi =		{10.4230/DagRep.3.10.72},
  annote =	{Keywords: Image Aquisition, Scene Modeling/Rendering, Image/3D Sensors, Photorealism, Visual Effects, Motion Reconstruction, Animation}
}
@Article{agosti_et_al:DagRep.3.10.92,
  author =	{Agosti, Maristella and Fuhr, Norbert and Toms, Elaine and Vakkari, Pertti},
  title =	{{Evaluation Methodologies in Information Retrieval (Dagstuhl Seminar 13441)}},
  pages =	{92--126},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{3},
  number =	{10},
  editor =	{Agosti, Maristella and Fuhr, Norbert and Toms, Elaine and Vakkari, Pertti},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.10.92},
  URN =		{urn:nbn:de:0030-drops-44335},
  doi =		{10.4230/DagRep.3.10.92},
  annote =	{Keywords: evaluation, testbeds, user studies, measures}
}

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