@inproceedings{GanianRamanujanSzeider17,
 address = {Dagstuhl, Germany},
 annote = {Keywords: Algorithms and data structures, Fixed Parameter Tractability, Constraint Satisfaction},
 author = {Robert Ganian and M. S. Ramanujan and Stefan Szeider},
 booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
 doi = {10.4230/LIPIcs.STACS.2017.36},
 editor = {Heribert Vollmer and Vall{\' e}e},
 isbn = {978-3-95977-028-6},
 issn = {1868-8969},
 keywords = {xtract},
 pages = {36:1--36:17},
 publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 title = {{Combining Treewidth and Backdoors for CSP}},
 url = {http://drops.dagstuhl.de/opus/volltexte/2017/6998},
 urn = {urn:nbn:de:0030-drops-69986},
 volume = {66},
 year = {2017}
}