Combining Treewidth and Backdoors for CSP

Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan

doi:10.4230/LIPIcs.STACS.2017.36

by Robert Ganian, M. S. Ramanujan, Stefan Szeider

Reference:

Combining Treewidth and Backdoors for CSPRobert Ganian, M. S. Ramanujan, Stefan Szeider34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer, Vallée, eds.), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1–36:17, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.

Bibtex Entry:

@InProceedings{GanianRamanujanSzeider17,
  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 Vall{\' e}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={xtract}
}