7 Works

High-Performance Graph Algorithms (Dagstuhl Seminar 18241)

Henning Meyerhenke, Richard Peng & Ilya Safro
This report documents the program and outcomes of Dagstuhl Seminar 18241 ``High-performance Graph Algorithms''. The seminar reflected the ongoing 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 with which graph problems are solved. This change is having a tremendous impact on the field of graph algorithms in terms of algorithm...

Software Protection Decision Support and Evaluation Methodologies (Dagstuhl Seminar 19331)

Bjorn De Sutter, Christian Collberg & Mila Dalla Preda
This report documents the program and the outcomes of Dagstuhl Seminar 19331 ``Software Protection Decision Support and Evaluation Methodologies''. The seminar is situated in the domain of software protection against so-called man-at-the-end attacks, in which attackers have white-box access to the software that embeds valuable assets with security requirements such as confidentiality and integrity. The attackers try to compromise those by reverse-engineering the software and by tampering with it. Within this domain, the seminar focused...

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 19341)

Dmitriy Bilyk, Aicke Hinrichs, Frances Y. Kuo & Klaus Ritter
From 18.08. to 23.08.2019, the Dagstuhl Seminar 19341 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (LZI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar can be found in this report. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are...

Computational Proteomics (Dagstuhl Seminar 19351)

Nuno Bandeira & Lennart Martens
This report documents the program and the outcomes of Dagstuhl Seminar 19351 ``Computational Proteomics''. The Seminar was originally built around four topics, identification and quantification of DIA data; algorithms for the analysis of protein cross-linking data; creating an online view on complete, browsable proteomes from public data; and detecting interesting biology from proteomics findings. These four topics were led to four correpsonding breakout sessions, which in turn led to five offshoot breakout sessions. The abstracts...

Advances and Challenges in Protein-RNA Recognition, Regulation and Prediction (Dagstuhl Seminar 19342)

Rolf Backofen, Yael Mandel-Gutfreund, Uwe Ohler & Gabriele Varani
This report documents the program and the outcomes of Dagstuhl Seminar 19342 ``Advances and Challenges in Protein-RNA Recognition, Regulation and Prediction''.

The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231)

Martin Grohe, Venkatesan Guruswami & Stanislav Zivny
Constraint satisfaction has always played a central role in computational complexity theory; appropriate versions of CSPs are classical complete problems for most standard complexity classes. CSPs constitute a very rich and yet sufficiently manageable class of problems to give a good perspective on general computational phenomena. For instance, they help to understand which mathematical properties make a computational problem tractable (in a wide sense, e.g., polynomial-time solvable, non-trivially approximable, fixed-parameter tractable, or definable in a...

Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352)

Maartten Löffler, Anna Lubiw, Saul Schleimer & Erin Moriarty Wolf Chambers
This report documents the program and the outcomes of Dagstuhl Seminar 19352 ``Computation in Low-Dimensional Geometry and Topology''. The seminar participants investigated problems in: knot theory, trajectory analysis, algorithmic topology, computational geometry of curves, and graph drawing, with an emphasis on how low-dimensional structures change over time.

Registration Year

  • 2019
    5
  • 2018
    2

Resource Types

  • Text
    7