HTML Export for DFU - Vol. 7

Copy to Clipboard Download

<h2>Dagstuhl Follow-Ups, Volume 7, DFU - Vol. 7</h2>
<ul>
<li>
    <span class="authors">Andrei Krokhin and Stanislav Zivny</span>
    <span class="title">DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301">10.4230/DFU.Vol7.15301</a>
</li>
<li>
    <span class="authors">Andrei Krokhin and Stanislav Zivny</span>
    <span class="title">Front Matter, Table of Contents, Preface, List of Authors</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.i">10.4230/DFU.Vol7.15301.i</a>
</li>
<li>
    <span class="authors">Libor Barto, Andrei Krokhin, and Ross Willard</span>
    <span class="title">Polymorphisms, and How to Use Them</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.1">10.4230/DFU.Vol7.15301.1</a>
</li>
<li>
    <span class="authors">Libor Barto and Marcin Kozik</span>
    <span class="title">Absorption in Universal Algebra and CSP</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.45">10.4230/DFU.Vol7.15301.45</a>
</li>
<li>
    <span class="authors">Manuel Bodirsky and Marcello Mamino</span>
    <span class="title">Constraint Satisfaction Problems over Numeric Domains</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.79">10.4230/DFU.Vol7.15301.79</a>
</li>
<li>
    <span class="authors">Martin C. Cooper and Stanislav Zivny</span>
    <span class="title">Hybrid Tractable Classes of Constraint Problems</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.113">10.4230/DFU.Vol7.15301.113</a>
</li>
<li>
    <span class="authors">Serge Gaspers, Sebastian Ordyniak, and Stefan Szeider</span>
    <span class="title">Backdoor Sets for CSP</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.137">10.4230/DFU.Vol7.15301.137</a>
</li>
<li>
    <span class="authors">Heng Guo and Pinyan Lu</span>
    <span class="title">On the Complexity of Holant Problems</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.159">10.4230/DFU.Vol7.15301.159</a>
</li>
<li>
    <span class="authors">Gregory Gutin and Anders Yeo</span>
    <span class="title">Parameterized Constraint Satisfaction Problems: a Survey</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.179">10.4230/DFU.Vol7.15301.179</a>
</li>
<li>
    <span class="authors">Mark Jerrum</span>
    <span class="title">Counting Constraint Satisfaction Problems</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.205">10.4230/DFU.Vol7.15301.205</a>
</li>
<li>
    <span class="authors">Andrei Krokhin and Stanislav Zivny</span>
    <span class="title">The Complexity of Valued CSPs</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.233">10.4230/DFU.Vol7.15301.233</a>
</li>
<li>
    <span class="authors">Benoit Larose</span>
    <span class="title">Algebra and the Complexity of Digraph CSPs: a Survey</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.267">10.4230/DFU.Vol7.15301.267</a>
</li>
<li>
    <span class="authors">Konstantin Makarychev and Yury Makarychev</span>
    <span class="title">Approximation Algorithms for CSPs</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.287">10.4230/DFU.Vol7.15301.287</a>
</li>
<li>
    <span class="authors">Barnaby Martin</span>
    <span class="title">Quantified Constraints in Twenty Seventeen</span>
    <a class="doi" href="https://doi.org/10.4230/DFU.Vol7.15301.327">10.4230/DFU.Vol7.15301.327</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