BibTeX Export for Dagstuhl Reports, Volume 1, Issue 2

Copy to Clipboard Download

@Article{DagRep.1.2,
  title =	{{Dagstuhl Reports, Volume 1, Issue 2, February 2011, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2},
  URN =		{urn:nbn:de:0030-drops-32091},
  doi =		{10.4230/DagRep.1.2},
  annote =	{Keywords: Dagstuhl Reports, Volume 1, Issue 2, February 2011, Complete Issue}
}
@Article{DagRep.1.2.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 1, Issue 2, 2011}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2.i},
  URN =		{urn:nbn:de:0030-drops-31922},
  doi =		{10.4230/DagRep.1.2.i},
  annote =	{Keywords: Table of Contents, Frontmatter}
}
@Article{fischerhubner_et_al:DagRep.1.2.1,
  author =	{Fischer-H\"{u}bner, Simone and Hoofnagle, Chris and Rannenberg, Kai and Waidner, Michael and Krontiris, Ioannis and Marh\"{o}fer, Michael},
  title =	{{Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061)}},
  pages =	{1--15},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{Fischer-H\"{u}bner, Simone and Hoofnagle, Chris and Rannenberg, Kai and Waidner, Michael and Krontiris, Ioannis and Marh\"{o}fer, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2.1},
  URN =		{urn:nbn:de:0030-drops-31515},
  doi =		{10.4230/DagRep.1.2.1},
  annote =	{Keywords: Online privacy, Data protection, Data security, Data loss prevention, Informational self-determination, Web 2.0, (mobile) Internet}
}
@Article{pezze_et_al:DagRep.1.2.16,
  author =	{Pezz\`{e}, Mauro and Rinard, Martin C. and Weimer, Westley and Zeller, Andreas},
  title =	{{Self-Repairing Programs (Dagstuhl Seminar 11062)}},
  pages =	{16--29},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{Pezz\`{e}, Mauro and Rinard, Martin C. and Weimer, Westley and Zeller, Andreas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2.16},
  URN =		{urn:nbn:de:0030-drops-31525},
  doi =		{10.4230/DagRep.1.2.16},
  annote =	{Keywords: Automated program repair, contract, debugging, fault, patch, self-healing}
}
@Article{fomin_et_al:DagRep.1.2.30,
  author =	{Fomin, Fedor V. and Fraigniaud, Pierre and Kreutzer, Stephan and Thilikos, Dimitrios M.},
  title =	{{Theory and Applications of Graph Searching Problems  (GRASTA 2011) (Dagstuhl Seminar 11071)}},
  pages =	{30--46},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{Fomin, Fedor V. and Fraigniaud, Pierre and Kreutzer, Stephan 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.1.2.30},
  URN =		{urn:nbn:de:0030-drops-31534},
  doi =		{10.4230/DagRep.1.2.30},
  annote =	{Keywords: Graph Searching, Pursuit Evasion Games, Cop and Robers Games, Fugitive Search Games}
}
@Article{crochemore_et_al:DagRep.1.2.47,
  author =	{Crochemore, Maxime and Kari, Lila and Mohri, Mehryar and Nowotka, Dirk},
  title =	{{Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081)}},
  pages =	{47--66},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{Crochemore, Maxime and Kari, Lila and Mohri, Mehryar and Nowotka, Dirk},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2.47},
  URN =		{urn:nbn:de:0030-drops-31554},
  doi =		{10.4230/DagRep.1.2.47},
  annote =	{Keywords: Combinatorics on words, computational biology, stringology, natural computing, machine learning}
}
@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.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

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail