Issue
Dagstuhl Reports, Volume 1, Issue 5
-
Part of:
Volume:
Dagstuhl Reports, Volume 1
Journal: Dagstuhl Reports (DagRep)
Event
Dagstuhl Seminars 11181, 11182, 11191, 11201, 11211Publication Details
- published at: 2011-09-18
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- DBLP: db/journals/dagstuhl-reports/dagstuhl-reports1
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Issue
Dagstuhl Reports, Volume 1, Issue 5, May 2011, Complete Issue
Abstract
Dagstuhl Reports, Volume 1, Issue 5, May 2011, Complete Issue
Cite as
Dagstuhl Reports, Volume 1, Issue 5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@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}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 1, Issue 5, 2011
Abstract
Table of Contents, Frontmatter
Cite as
Dagstuhl Reports, Volume 1, Issue 5, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@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}
}
Document
Organic Computing - Design of Self-Organizing Systems (Dagstuhl Seminar 11181)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 11181 ``Organic Computing - Design of Self-Organizing Systems''.
Cite as
Kirstie Bellman, Andreas Herkersdorf, and Michael G. Hinchey. Organic Computing - Design of Self-Organizing Systems (Dagstuhl Seminar 11181). In Dagstuhl Reports, Volume 1, Issue 5, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@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}
}
Document
Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 11182 ``Exploiting graph structure to cope with hard problems'' which has been held in Schloss Dagstuhl -- Leibniz Center for Informatics from May 1st, 2011 to May 6th, 2011.
During the seminar experts with a common focus on graph algorithms presented various new results in how to attack NP-hard graph problems by using the structure of the input graph.
Moreover, in the afternoon of each seminar's day new problems have been posed and discussed.
Cite as
Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, and Ross McConnell. Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). In Dagstuhl Reports, Volume 1, Issue 5, pp. 29-46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@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}
}
Document
Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 11191
``Graph Drawing with Algorithm Engineering Methods''. We summarize the talks,
open problems, and working group discussions.
Cite as
Camil Demetrescu, Michael Kaufmann, Stephen Kobourov, and Petra Mutzel. Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191). In Dagstuhl Reports, Volume 1, Issue 5, pp. 47-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@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}
}
Document
Constraint Programming meets Machine Learning and Data Mining (Dagstuhl Seminar 11201)
Abstract
This report documents the programme and the outcomes of Dagstuhl Seminar 11201 "Constraint Programming meets Machine Learning and Data Mining". Our starting point in this seminar was that machine learning and data mining have developed largely independently from constraint programming till now, but that it is increasingly becoming clear that there are many opportunities for interactions between these areas: on the one hand, data mining and machine learning can be used to improve constraint solving; on the other hand, constraint solving can be used in data mining in machine learning. This seminar brought together prominent researchers from both communities to discuss these opportunities.
Cite as
Luc De Raedt, Siegfried Nijssen, Barry O'Sullivan, and Pascal Van Hentenryck. Constraint Programming meets Machine Learning and Data Mining (Dagstuhl Seminar 11201). In Dagstuhl Reports, Volume 1, Issue 5, pp. 61-83, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@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}
}
Document
Geometric Modeling (Dagstuhl Seminar 11211)
Abstract
This report documents the program and the results of Dagstuhl Seminar 11211 ``Geometric Modeling'', taking place May 22-27 2011. The focus of the seminar was to discuss modern and emerging topics in Geometric Modeling by researchers and industrial scientists from all over the world.
Cite as
Thomas A. Grandine, Stefanie Hahmann, Jörg Peters, and Wenping Wang. Geometric Modeling (Dagstuhl Seminar 11211). In Dagstuhl Reports, Volume 1, Issue 5, pp. 84-107, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@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}
}