pdf-format: |
|
@InProceedings{ganian_et_al:LIPIcs:2017:6998, author = {Robert Ganian and M. S. Ramanujan and Stefan Szeider}, title = {{Combining Treewidth and Backdoors for CSP}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, pages = {36:1--36:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-028-6}, ISSN = {1868-8969}, year = {2017}, volume = {66}, editor = {Heribert Vollmer and Brigitte Vallée}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/6998}, URN = {urn:nbn:de:0030-drops-69986}, doi = {10.4230/LIPIcs.STACS.2017.36}, annote = {Keywords: Algorithms and data structures, Fixed Parameter Tractability, Constraint Satisfaction} }
Keywords: | Algorithms and data structures, Fixed Parameter Tractability, Constraint Satisfaction | |
Seminar: | 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) | |
Issue date: | 2017 | |
Date of publication: | 06.03.2017 |