@Collection{DFU.Vol7.15301,
title = {{DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volume}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301},
URN = {urn:nbn:de:0030-drops-69752},
doi = {10.4230/DFU.Vol7.15301},
annote = {Keywords: Nonnumerical Algorithms and Problems}
}
@InCollection{krokhin_et_al:DFU.Vol7.15301.i,
author = {Krokhin, Andrei and Zivny, Stanislav},
title = {{Front Matter, Table of Contents, Preface, List of Authors}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {0:i--0:xii},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.i},
URN = {urn:nbn:de:0030-drops-69702},
doi = {10.4230/DFU.Vol7.15301.i},
annote = {Keywords: Front Matter, Table of Contents, Preface, List of Authors}
}
@InCollection{barto_et_al:DFU.Vol7.15301.1,
author = {Barto, Libor and Krokhin, Andrei and Willard, Ross},
title = {{Polymorphisms, and How to Use Them}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {1--44},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.1},
URN = {urn:nbn:de:0030-drops-69595},
doi = {10.4230/DFU.Vol7.15301.1},
annote = {Keywords: Constraint satisfaction, Complexity, Universal algebra, Polymorphism}
}
@InCollection{barto_et_al:DFU.Vol7.15301.45,
author = {Barto, Libor and Kozik, Marcin},
title = {{Absorption in Universal Algebra and CSP}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {45--77},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.45},
URN = {urn:nbn:de:0030-drops-69608},
doi = {10.4230/DFU.Vol7.15301.45},
annote = {Keywords: Constraint satisfaction problem, Algebraic approach, Absorption}
}
@InCollection{bodirsky_et_al:DFU.Vol7.15301.79,
author = {Bodirsky, Manuel and Mamino, Marcello},
title = {{Constraint Satisfaction Problems over Numeric Domains}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {79--111},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.79},
URN = {urn:nbn:de:0030-drops-69580},
doi = {10.4230/DFU.Vol7.15301.79},
annote = {Keywords: Constraint satisfaction problems, Numerical domains}
}
@InCollection{cooper_et_al:DFU.Vol7.15301.113,
author = {Cooper, Martin C. and Zivny, Stanislav},
title = {{Hybrid Tractable Classes of Constraint Problems}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {113--135},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.113},
URN = {urn:nbn:de:0030-drops-69616},
doi = {10.4230/DFU.Vol7.15301.113},
annote = {Keywords: Constraint satisfaction problems, Optimisation, Tractability}
}
@InCollection{gaspers_et_al:DFU.Vol7.15301.137,
author = {Gaspers, Serge and Ordyniak, Sebastian and Szeider, Stefan},
title = {{Backdoor Sets for CSP}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {137--157},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.137},
URN = {urn:nbn:de:0030-drops-69626},
doi = {10.4230/DFU.Vol7.15301.137},
annote = {Keywords: Backdoor sets, Constraint satisfaction problems, Parameterized complexity, Polymorphisms}
}
@InCollection{guo_et_al:DFU.Vol7.15301.159,
author = {Guo, Heng and Lu, Pinyan},
title = {{On the Complexity of Holant Problems}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {159--177},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.159},
URN = {urn:nbn:de:0030-drops-69630},
doi = {10.4230/DFU.Vol7.15301.159},
annote = {Keywords: Computational complexity, Counting complexity, Dichotomy theorems, Approximate counting, Holant problems}
}
@InCollection{gutin_et_al:DFU.Vol7.15301.179,
author = {Gutin, Gregory and Yeo, Anders},
title = {{Parameterized Constraint Satisfaction Problems: a Survey}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {179--203},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.179},
URN = {urn:nbn:de:0030-drops-69641},
doi = {10.4230/DFU.Vol7.15301.179},
annote = {Keywords: Constraint satisfaction problems, Fixed-parameter tractability}
}
@InCollection{jerrum:DFU.Vol7.15301.205,
author = {Jerrum, Mark},
title = {{Counting Constraint Satisfaction Problems}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {205--231},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.205},
URN = {urn:nbn:de:0030-drops-69655},
doi = {10.4230/DFU.Vol7.15301.205},
annote = {Keywords: Approximation algorithms, Computational complexity, Constraint satisfaction problems, Counting problems, Partition functions}
}
@InCollection{krokhin_et_al:DFU.Vol7.15301.233,
author = {Krokhin, Andrei and Zivny, Stanislav},
title = {{The Complexity of Valued CSPs}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {233--266},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.233},
URN = {urn:nbn:de:0030-drops-69665},
doi = {10.4230/DFU.Vol7.15301.233},
annote = {Keywords: Constraint satisfaction problems, Optimisation, Tractability}
}
@InCollection{larose:DFU.Vol7.15301.267,
author = {Larose, Benoit},
title = {{Algebra and the Complexity of Digraph CSPs: a Survey}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {267--285},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.267},
URN = {urn:nbn:de:0030-drops-69677},
doi = {10.4230/DFU.Vol7.15301.267},
annote = {Keywords: Constraint satisfaction problems, Polymorphisms, Digraphs}
}
@InCollection{makarychev_et_al:DFU.Vol7.15301.287,
author = {Makarychev, Konstantin and Makarychev, Yury},
title = {{Approximation Algorithms for CSPs}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {287--325},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.287},
URN = {urn:nbn:de:0030-drops-69685},
doi = {10.4230/DFU.Vol7.15301.287},
annote = {Keywords: Constraint satisfaction problems, Approximation algorithms, SDP, UGC}
}
@InCollection{martin:DFU.Vol7.15301.327,
author = {Martin, Barnaby},
title = {{Quantified Constraints in Twenty Seventeen}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {327--346},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.327},
URN = {urn:nbn:de:0030-drops-69699},
doi = {10.4230/DFU.Vol7.15301.327},
annote = {Keywords: Quantified constraints, Constraint satisfaction problems, Computational complexity, Parameterized complexity, Universal algebra}
}
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
Feedback for Dagstuhl Publishing