Issue

Dagstuhl Reports, Volume 3, Issue 3



Thumbnail PDF

Publication Details


Access Numbers

Documents

No documents found matching your filter selection.
Document
Complete Issue
Dagstuhl Reports, Volume 3, Issue 03, March 2013, Complete Issue

Abstract
Dagstuhl Reports, Volume 3, Issue 03, March 2013, Complete Issue

Cite as

Dagstuhl Reports, Volume 3, Issue 03, March 2013, Complete Issue. In Dagstuhl Reports, Volume 3, Issue 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)


Copy BibTex To Clipboard

@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},
  editor =	{},
  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}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 3, Issue 03, 2013

Abstract
Table of Contents, Frontmatter

Cite as

Dagstuhl Reports, Table of Contents, Volume 3, Issue 03, 2013. In Dagstuhl Reports, Volume 3, Issue 3, pp. i-ii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)


Copy BibTex To Clipboard

@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},
  editor =	{},
  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}
}
Document
Computational Geometry (Dagstuhl Seminar 13101)

Authors: Otfried Cheong, Kurt Mehlhorn, and Monique Teillaud


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 13101 "Computational Geometry". The seminar was held from 3rd to 8th March 2013 and 47 senior and young researchers from various countries and continents attended it. Recent developments in the field were presented and new challenges in computational geometry were identified. This report collects abstracts of the talks and a list of open problems.

Cite as

Otfried Cheong, Kurt Mehlhorn, and Monique Teillaud. Computational Geometry (Dagstuhl Seminar 13101). In Dagstuhl Reports, Volume 3, Issue 3, pp. 1-23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)


Copy BibTex To Clipboard

@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}
}
Document
Scheduling (Dagstuhl Seminar 13111)

Authors: Susanne Albers, Onno J. Boxma, and Kirk Pruhs


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 13111 "Scheduling". The primary objective of the seminar is to facilitate dialog and collaboration between researchers in two different mathematically-oriented scheduling research communities, the stochastic scheduling and queuing community, and the worst-case approximation scheduling community.

Cite as

Susanne Albers, Onno J. Boxma, and Kirk Pruhs. Scheduling (Dagstuhl Seminar 13111). In Dagstuhl Reports, Volume 3, Issue 3, pp. 24-50, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)


Copy BibTex To Clipboard

@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}
}
Document
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121)

Authors: Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos


Abstract
We provide a report on the Dagstuhl Seminar 13121: "Bidimensional Structures: Algorithms, Combinatorics and Logic" held at Schloss Dagstuhl in Wadern, Germany between Monday 18 and Friday 22 of March 2013. The report contains the motivation of the seminar, the abstracts of the talks given during the seminar, and the list of open problems.

Cite as

Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos. Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121). In Dagstuhl Reports, Volume 3, Issue 3, pp. 51-74, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)


Copy BibTex To Clipboard

@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}
}
Document
Future Internet (Dagstuhl Seminar 13131)

Authors: Jon Crowcroft, Markus Fidler, Klara Nahrstedt, and Ralf Steinmetz


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 13131 "Future Internet". At the seminar, about 40 invited researchers from academia and industry discussed the promises, approaches, and open challenges of the Future Internet. This report gives a general overview of the presentations and outcomes of discussions of the seminar.

Cite as

Jon Crowcroft, Markus Fidler, Klara Nahrstedt, and Ralf Steinmetz. Future Internet (Dagstuhl Seminar 13131). In Dagstuhl Reports, Volume 3, Issue 3, pp. 75-99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)


Copy BibTex To Clipboard

@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}
}

Filters


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