HTML Export for Dagstuhl Seminar Proceedings, Volume 9511

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 9511, </h2>
<ul>
<li>
    <span class="authors">Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dániel Marx</span>
    <span class="title">09511 Abstracts Collection – Parameterized complexity and approximation algorithms</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09511.1">10.4230/DagSemProc.09511.1</a>
</li>
<li>
    <span class="authors">Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dániel Marx</span>
    <span class="title">09511 Executive Summary – Parameterized complexity and approximation algorithms</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09511.2">10.4230/DagSemProc.09511.2</a>
</li>
<li>
    <span class="authors">Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dániel Marx</span>
    <span class="title">09511 Open Problems – Parameterized complexity and approximation algorithms</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09511.3">10.4230/DagSemProc.09511.3</a>
</li>
<li>
    <span class="authors">Guy Kortsarz and Zeev Nutov</span>
    <span class="title">Approximating minimum cost connectivity problems</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09511.4">10.4230/DagSemProc.09511.4</a>
</li>
<li>
    <span class="authors">Fedor V. Fomin, Petr Golovach, and Dimitrios M. Thilikos</span>
    <span class="title">Contraction Bidimensionality: the Accurate Picture</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09511.5">10.4230/DagSemProc.09511.5</a>
</li>
<li>
    <span class="authors">Kunal Talwar, Anupam Gupta, Katrina Ligett, Frank McSherry, and Aaron Roth</span>
    <span class="title">Differentially Private Combinatorial Optimization</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09511.6">10.4230/DagSemProc.09511.6</a>
</li>
<li>
    <span class="authors">Holger Dell and Dieter van Melkebeek</span>
    <span class="title">Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09511.7">10.4230/DagSemProc.09511.7</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