HTML Export for Dagstuhl Reports, Volume 12, Issue 11

Copy to Clipboard Download

<h2>Dagstuhl Reports, Volume 12, Issue 11, </h2>
<ul>
<li>
    <span class="title">Dagstuhl Reports, Volume 12, Issue 11, November 2022, Complete Issue</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.12.11">10.4230/DagRep.12.11</a>
</li>
<li>
    <span class="title">Dagstuhl Reports, Table of Contents, Volume 12, Issue 11, 2022</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.12.11.i">10.4230/DagRep.12.11.i</a>
</li>
<li>
    <span class="authors">Dilian Gurov, Reiner Hähnle, Marieke Huisman, Giles Reger, and Christian Lidström</span>
    <span class="title">Principles of Contract Languages (Dagstuhl Seminar 22451)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.12.11.1">10.4230/DagRep.12.11.1</a>
</li>
<li>
    <span class="authors">Martin Hoefer, Sigal Oren, Roger Wattenhofer, and Giovanna Varricchio</span>
    <span class="title">Computational Social Dynamics (Dagstuhl Seminar 22452)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.12.11.28">10.4230/DagRep.12.11.28</a>
</li>
<li>
    <span class="authors">Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, and Nicole Wein</span>
    <span class="title">Dynamic Graph Algorithms (Dagstuhl Seminar 22461)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.12.11.45">10.4230/DagRep.12.11.45</a>
</li>
<li>
    <span class="authors">Susanne Bleisch, Steven Chaplick, Jan-Henrik Haunert, Eva Mayr, Marc van Kreveld, and Annika Bonerath</span>
    <span class="title">Set Visualization and Uncertainty (Dagstuhl Seminar 22462)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.12.11.66">10.4230/DagRep.12.11.66</a>
</li>
<li>
    <span class="authors">Artur Hecker, Stefan Schmid, Henning Schulzrinne, Lily Hügerich, Sándor Laki, and Iosif Salem</span>
    <span class="title">Towards More Flexible and Automated Communication Networks (Dagstuhl Seminar 22471)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.12.11.96">10.4230/DagRep.12.11.96</a>
</li>
<li>
    <span class="authors">Maria Chudnovsky, Neeldhara Misra, Daniel Paulusma, Oliver Schaudt, and Akanksha Agrawal</span>
    <span class="title">Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.12.11.109">10.4230/DagRep.12.11.109</a>
</li>
<li>
    <span class="authors">Holger Dell, Mark R. Jerrum, Haiko Müller, Konrad Anand, and Marcus Pappik</span>
    <span class="title">Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482)</span>
    <a class="doi" href="https://doi.org/10.4230/DagRep.12.11.124">10.4230/DagRep.12.11.124</a>
</li>
</ul>

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