default search action
Search dblp for Publications
export results for "toc:db/conf/dagstuhl/dfu7.bht:"
@incollection{DBLP:conf/dagstuhl/BartoK17, author = {Libor Barto and Marcin Kozik}, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {Absorption in Universal Algebra and {CSP}}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {45--77}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.2}, doi = {10.4230/DFU.VOL7.15301.2}, timestamp = {Mon, 03 Aug 2020 17:29:58 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/BartoK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/dagstuhl/BartoKW17, author = {Libor Barto and Andrei A. Krokhin and Ross Willard}, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {Polymorphisms, and How to Use Them}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {1--44}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.1}, doi = {10.4230/DFU.VOL7.15301.1}, timestamp = {Sun, 21 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/BartoKW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/dagstuhl/BodirskyM17, author = {Manuel Bodirsky and Marcello Mamino}, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {Constraint Satisfaction Problems over Numeric Domains}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {79--111}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.3}, doi = {10.4230/DFU.VOL7.15301.3}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/BodirskyM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/dagstuhl/CooperZ17, author = {Martin C. Cooper and Stanislav Zivn{\'{y}}}, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {Hybrid Tractable Classes of Constraint Problems}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {113--135}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.4}, doi = {10.4230/DFU.VOL7.15301.4}, timestamp = {Mon, 03 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/CooperZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/dagstuhl/GaspersOS17, author = {Serge Gaspers and Sebastian Ordyniak and Stefan Szeider}, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {Backdoor Sets for {CSP}}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {137--157}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.5}, doi = {10.4230/DFU.VOL7.15301.5}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/GaspersOS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/dagstuhl/GuoL17, author = {Heng Guo and Pinyan Lu}, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {On the Complexity of Holant Problems}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {159--177}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.6}, doi = {10.4230/DFU.VOL7.15301.6}, timestamp = {Fri, 11 Aug 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/GuoL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/dagstuhl/GutinY17, author = {Gregory Z. Gutin and Anders Yeo}, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {Parameterized Constraint Satisfaction Problems: a Survey}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {179--203}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.7}, doi = {10.4230/DFU.VOL7.15301.7}, timestamp = {Thu, 22 Feb 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/dagstuhl/GutinY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/dagstuhl/Jerrum17, author = {Mark Jerrum}, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {Counting Constraint Satisfaction Problems}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {205--231}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.8}, doi = {10.4230/DFU.VOL7.15301.8}, timestamp = {Sun, 21 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/Jerrum17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/dagstuhl/KrokhinZ17, author = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {The Complexity of Valued CSPs}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {233--266}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.9}, doi = {10.4230/DFU.VOL7.15301.9}, timestamp = {Mon, 03 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/KrokhinZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/dagstuhl/Larose17, author = {Beno{\^{\i}}t Larose}, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {Algebra and the Complexity of Digraph CSPs: a Survey}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {267--285}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.10}, doi = {10.4230/DFU.VOL7.15301.10}, timestamp = {Mon, 08 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/Larose17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/dagstuhl/MakarychevM17, author = {Konstantin Makarychev and Yury Makarychev}, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {Approximation Algorithms for CSPs}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {287--325}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.11}, doi = {10.4230/DFU.VOL7.15301.11}, timestamp = {Sun, 21 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/MakarychevM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/dagstuhl/Martin17, author = {Barnaby Martin}, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {Quantified Constraints in Twenty Seventeen}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {327--346}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.12}, doi = {10.4230/DFU.VOL7.15301.12}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/Martin17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/dagstuhl/X17, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {Front Matter, Table of Contents, Preface, List of Authors}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, pages = {i--xii}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/DFU.Vol7.15301.0}, doi = {10.4230/DFU.VOL7.15301.0}, timestamp = {Sun, 21 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/X17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:conf/dagstuhl/2017dfu7, editor = {Andrei A. Krokhin and Stanislav Zivn{\'{y}}}, title = {The Constraint Satisfaction Problem: Complexity and Approximability}, series = {Dagstuhl Follow-Ups}, volume = {7}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {http://www.dagstuhl.de/dagpub/978-3-95977-003-3}, isbn = {978-3-95977-003-3}, timestamp = {Mon, 03 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/2017dfu7.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.