Issue

Dagstuhl Reports, Volume 4, Issue 11

Thumbnail PDF

Event

  • Dagstuhl Seminars 14451, 14452, 14461, 14462, 14471, 14481, 14482

Publication Details


Access Numbers

Documents

No documents found matching your filter selection.
Document
Complete Issue
DOI: 10.4230/DagRep.4.11
Dagstuhl Reports, Volume 4, Issue 11, November 2014, Complete Issue
Abstract
Dagstuhl Reports, Volume 4, Issue 11, November 2014, Complete Issue
Cite as

Dagstuhl Reports, Volume 4, Issue 11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{DagRep.4.11,
  title =	{{Dagstuhl Reports, Volume 4, Issue 11, November 2014, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{11},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.11},
  URN =		{urn:nbn:de:0030-drops-50031},
  doi =		{10.4230/DagRep.4.11},
  annote =	{Keywords: Dagstuhl Reports, Volume 4, Issue 11, November 2014, Complete Issue}
}
Document
Front Matter
DOI: 10.4230/DagRep.4.11.i
Dagstuhl Reports, Table of Contents, Volume 4, Issue 11, 2014
Abstract
Table of Contents, Frontmatter
Cite as

Dagstuhl Reports, Volume 4, Issue 11, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{DagRep.4.11.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 4, Issue 11, 2014}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{11},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.11.i},
  URN =		{urn:nbn:de:0030-drops-50026},
  doi =		{10.4230/DagRep.4.11.i},
  annote =	{Keywords: Dagstuhl Reports, Table of Contents, Volume 4, Issue 11, 2014}
}
Document
DOI: 10.4230/DagRep.4.11.1
Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451)

Authors: Stefan Kratsch, Daniel Lokshtanov, Dániel Marx, and Peter Rossmanith

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14451 "Optimality and tight results in parameterized complexity". Over the last two decades parameterized complexity has become one of the main tools for handling intractable problems. Recently, tools have been developed not only to classify problems, but also to make statements about how close an algorithm is to being optimal with respect to running time. The focus of this seminar is to highlight and discuss recent, relevant results within this optimality framework and discover fruitful research directions. The report contains the abstracts of the results presented at the seminar, as well as a collection of open problems stated at the seminar.
Cite as

Stefan Kratsch, Daniel Lokshtanov, Dániel Marx, and Peter Rossmanith. Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451). In Dagstuhl Reports, Volume 4, Issue 11, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{kratsch_et_al:DagRep.4.11.1,
  author =	{Kratsch, Stefan and Lokshtanov, Daniel and Marx, D\'{a}niel and Rossmanith, Peter},
  title =	{{Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451)}},
  pages =	{1--21},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{11},
  editor =	{Kratsch, Stefan and Lokshtanov, Daniel and Marx, D\'{a}niel and Rossmanith, Peter},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.11.1},
  URN =		{urn:nbn:de:0030-drops-49677},
  doi =		{10.4230/DagRep.4.11.1},
  annote =	{Keywords: Algorithms, parameterized complexity, kernels, width measures, exponential time hypothesis, lower bounds}
}
Document
DOI: 10.4230/DagRep.4.11.22
Algorithmic Cheminformatics (Dagstuhl Seminar 14452)

Authors: Wolfgang Banzhaf, Christoph Flamm, Daniel Merkle, and Peter F. Stadler

Abstract
Dagstuhl Seminar 14452 "Algorithmic Cheminformatics" brought together leading researchers from both chemistry and computer science. The meeting successfully aimed at bridging in the apparent gap between the two disciplines. The participants surveyed areas of overlapping interests and identified possible fields of joint future research.
Cite as

Wolfgang Banzhaf, Christoph Flamm, Daniel Merkle, and Peter F. Stadler. Algorithmic Cheminformatics (Dagstuhl Seminar 14452). In Dagstuhl Reports, Volume 4, Issue 11, pp. 22-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{banzhaf_et_al:DagRep.4.11.22,
  author =	{Banzhaf, Wolfgang and Flamm, Christoph and Merkle, Daniel and Stadler, Peter F.},
  title =	{{Algorithmic Cheminformatics (Dagstuhl Seminar 14452)}},
  pages =	{22--39},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{11},
  editor =	{Banzhaf, Wolfgang and Flamm, Christoph and Merkle, Daniel and Stadler, Peter F.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.11.22},
  URN =		{urn:nbn:de:0030-drops-49686},
  doi =		{10.4230/DagRep.4.11.22},
  annote =	{Keywords: Graph Transformation Systems, Graph and Hypergraph Invariants, Graph Comparison, Network Flows, Hypergraphs, Formal Languages, Algebraic Chemistry}
}
Document
DOI: 10.4230/DagRep.4.11.40
High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461)

Authors: Ulrich Carsten Meyer, Henning Meyerhenke, Ali Pinar, and Ilya Safro

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14461 "High- performance Graph Algorithms and Applications in Computational Science". The seminar reflected the recent qualitative change how graph algorithms are used in practice due to (i) the complex structure of graphs in new and emerging applications, (ii) the size of typical inputs, and (iii) the computer systems on which graph problems are solved. This change is having a tremendous impact on the field of graph algorithms in terms of algorithm theory and implementation as well as hardware requirements and application areas. The seminar covered recent advances in all these aspects with a focus on practical algorithms and their efficient implementation for large-scale problems. The abstracts included in this report contain recent state-of-the-art results, but also point to promising new directions for high-performance graph algorithms and their applications.
Cite as

Ulrich Carsten Meyer, Henning Meyerhenke, Ali Pinar, and Ilya Safro. High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461). In Dagstuhl Reports, Volume 4, Issue 11, pp. 40-58, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{meyer_et_al:DagRep.4.11.40,
  author =	{Meyer, Ulrich Carsten and Meyerhenke, Henning and Pinar, Ali and Safro, Ilya},
  title =	{{High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461)}},
  pages =	{40--58},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{11},
  editor =	{Meyer, Ulrich Carsten and Meyerhenke, Henning and Pinar, Ali and Safro, Ilya},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.11.40},
  URN =		{urn:nbn:de:0030-drops-49697},
  doi =		{10.4230/DagRep.4.11.40},
  annote =	{Keywords: graphs, graph algorithms, graph theory, computational science, complex networks, network science, graph partitioning, linear algebra, parallel program}
}
Document
DOI: 10.4230/DagRep.4.11.59
Systems and Algorithms for Large-scale Graph Analytics (Dagstuhl Seminar 14462)

Authors: Eiko Yoneki, Amitabha Roy, and Derek Murray

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14462 "Systems and Algorithms for Large-scale Graph Analytics". The seminar was a successful gathering of computer scientists from the domains of systems, algorithms, architecture and databases all of whom are interested in graph processing.
Cite as

Eiko Yoneki, Amitabha Roy, and Derek Murray. Systems and Algorithms for Large-scale Graph Analytics (Dagstuhl Seminar 14462). In Dagstuhl Reports, Volume 4, Issue 11, pp. 59-77, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{yoneki_et_al:DagRep.4.11.59,
  author =	{Yoneki, Eiko and Roy, Amitabha and Murray, Derek},
  title =	{{Systems and Algorithms for Large-scale Graph Analytics (Dagstuhl Seminar 14462)}},
  pages =	{59--77},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{11},
  editor =	{Yoneki, Eiko and Roy, Amitabha and Murray, Derek},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.11.59},
  URN =		{urn:nbn:de:0030-drops-49700},
  doi =		{10.4230/DagRep.4.11.59},
  annote =	{Keywords: Large-scale graph processing, Graph structured data, Database, Graph algorithms, Parallel I/O, Parallel programming, Storage, Distributed systems, GPU}
}
Document
DOI: 10.4230/DagRep.4.11.78
Towards an Affordable Internet Access for Everyone: The Quest for Enabling Universal Service Commitment (Dagstuhl Seminar 14471)

Authors: Jon Crowcroft, Adam Wolisz, and Arjuna Sathiaseelan

Abstract
This report document the program and outcomes of the Dagstuhl Seminar 14471 "Towards an Affordable Internet Access for Everyone: The Quest for Enabling Universal Service Commitment". At the seminar, about 27 invited researchers from academia and industry discussed the challenges and solutions for enabling universal and affordable Internet access. This report gives a general overview of the presentations and outcomes of discussions of the seminar.
Cite as

Jon Crowcroft, Adam Wolisz, and Arjuna Sathiaseelan. Towards an Affordable Internet Access for Everyone: The Quest for Enabling Universal Service Commitment (Dagstuhl Seminar 14471). In Dagstuhl Reports, Volume 4, Issue 11, pp. 78-137, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{crowcroft_et_al:DagRep.4.11.78,
  author =	{Crowcroft, Jon and Wolisz, Adam and Sathiaseelan, Arjuna},
  title =	{{Towards an Affordable Internet Access for Everyone: The Quest for Enabling Universal Service Commitment (Dagstuhl Seminar 14471)}},
  pages =	{78--137},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{11},
  editor =	{Crowcroft, Jon and Wolisz, Adam and Sathiaseelan, Arjuna},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.11.78},
  URN =		{urn:nbn:de:0030-drops-49717},
  doi =		{10.4230/DagRep.4.11.78},
  annote =	{Keywords: Internet access, cost, wireless, regulation, social, deployments, protocols}
}
Document
DOI: 10.4230/DagRep.4.11.138
Multiscale Spatial Computational Systems Biology (Dagstuhl Seminar 14481)

Authors: David Gilbert, Monika Heiner, Koichi Takahashi, and Adelinde M. Uhrmacher

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14481 "Multiscale Spatial Computational Systems Biology". This seminar explored challenges arising from the need to model and analyse complex biological systems at multiple scales (spatial and temporal), which falls within the general remit of Computational Systems Biology. A distinguishing factor of the seminar was the modelling exercise -- where teams explored different modelling paradigms, in order to better understand the details of the approaches, their challenges, potential applications, and their pros and cons. This activity was carried out in a collaborative and self-directed manner using the Open Space Technology approach as evidenced by a high degree of communication both within and between the teams. Eight teams were formed, and reports from five of them are included in this document.
Cite as

David Gilbert, Monika Heiner, Koichi Takahashi, and Adelinde M. Uhrmacher. Multiscale Spatial Computational Systems Biology (Dagstuhl Seminar 14481). In Dagstuhl Reports, Volume 4, Issue 11, pp. 138-226, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{gilbert_et_al:DagRep.4.11.138,
  author =	{Gilbert, David and Heiner, Monika and Takahashi, Koichi and Uhrmacher, Adelinde M.},
  title =	{{Multiscale Spatial Computational Systems Biology (Dagstuhl Seminar 14481)}},
  pages =	{138--226},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{11},
  editor =	{Gilbert, David and Heiner, Monika and Takahashi, Koichi and Uhrmacher, Adelinde M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.11.138},
  URN =		{urn:nbn:de:0030-drops-49723},
  doi =		{10.4230/DagRep.4.11.138},
  annote =	{Keywords: Multiscale, multidimensional, computational modelling, space, time, systems biology, synthetic biology}
}
Document
DOI: 10.4230/DagRep.4.11.227
Automated Planning and Model Checking (Dagstuhl Seminar 14482)

Authors: Alessandro Cimatti, Stefan Edelkamp, Maria Fox, Daniele Magazzeni, and Erion Plaku

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14482 "Automated Planning and Model Checking". There has been a lot of work on the exchanges between the areas of automated planning and model checking, based on the observation that a model-checking problem can be cast as a planning problem and vice-versa. The motivation for this seminar was to increase the synergy between the two research communities, and explore recent progress in the two areas in terms of techniques, tools and formalisms for describing planning and verification problems. The main outcomes were a greater common understanding of planning and model-checking issues and challenges, and greater appreciation of the crosswover between the modelling languages and methods. Different application domains were also explored, where planning and model-checking can be effectively integrated.
Cite as

Alessandro Cimatti, Stefan Edelkamp, Maria Fox, Daniele Magazzeni, and Erion Plaku. Automated Planning and Model Checking (Dagstuhl Seminar 14482). In Dagstuhl Reports, Volume 4, Issue 11, pp. 227-245, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{cimatti_et_al:DagRep.4.11.227,
  author =	{Cimatti, Alessandro and Edelkamp, Stefan and Fox, Maria and Magazzeni, Daniele and Plaku, Erion},
  title =	{{Automated Planning and Model Checking (Dagstuhl Seminar 14482)}},
  pages =	{227--245},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{11},
  editor =	{Cimatti, Alessandro and Edelkamp, Stefan and Fox, Maria and Magazzeni, Daniele and Plaku, Erion},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.11.227},
  URN =		{urn:nbn:de:0030-drops-49731},
  doi =		{10.4230/DagRep.4.11.227},
  annote =	{Keywords: planning via model checking, directed model checking, plan validation, falsification, GPU-based state space exploration, hybrid systems, heuristic sea}
}

Filters

  • Authors
  • B
  • Banzhaf, Wolfgang
  • C
  • Cimatti, Alessandro
  • Crowcroft, Jon
  • E
  • Edelkamp, Stefan
  • F
  • Flamm, Christoph
  • Fox, Maria
  • G
  • Gilbert, David
  • H
  • Heiner, Monika
  • K
  • Kratsch, Stefan
  • L
  • Lokshtanov, Daniel
  • M
  • Magazzeni, Daniele
  • Marx, Dániel
  • Merkle, Daniel
  • Meyer, Ulrich Carsten
  • Meyerhenke, Henning
  • Murray, Derek
  • P
  • Pinar, Ali
  • Plaku, Erion
  • R
  • Rossmanith, Peter
  • Roy, Amitabha
  • S
  • Safro, Ilya
  • Sathiaseelan, Arjuna
  • Stadler, Peter F.
  • T
  • Takahashi, Koichi
  • U
  • Uhrmacher, Adelinde M.
  • W
  • Wolisz, Adam
  • Y
  • Yoneki, Eiko

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact