Strong Backdoors to Bounded Treewidth SAT. Gaspers, S. & Szeider, S. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 489--498, 2013.
Strong Backdoors to Bounded Treewidth SAT [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/focs/GaspersS13,
  author    = {Serge Gaspers and
               Stefan Szeider},
  title     = {Strong Backdoors to Bounded Treewidth {SAT}},
  booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  pages     = {489--498},
  year      = {2013},
  crossref  = {DBLP:conf/focs/2013},
  url       = {http://dx.doi.org/10.1109/FOCS.2013.59},
  doi       = {10.1109/FOCS.2013.59},
  timestamp = {Tue, 16 Dec 2014 00:00:00 +0100},
  biburl    = {http://dblp.dagstuhl.de/rec/bib/conf/focs/GaspersS13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

Downloads: 0