@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}
}

{"_id":"urDtN5GuwTHThSo3e","bibbaseid":"gaspers-szeider-strongbackdoorstoboundedtreewidthsat-2013","downloads":0,"creationDate":"2016-10-22T00:59:55.891Z","title":"Strong Backdoors to Bounded Treewidth SAT","author_short":["Gaspers, S.","Szeider, S."],"year":2013,"bibtype":"inproceedings","biburl":"http://dblp.org/pers/tb2/g/Gaspers:Serge","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Serge"],"propositions":[],"lastnames":["Gaspers"],"suffixes":[]},{"firstnames":["Stefan"],"propositions":[],"lastnames":["Szeider"],"suffixes":[]}],"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","bibtex":"@inproceedings{DBLP:conf/focs/GaspersS13,\n author = {Serge Gaspers and\n Stefan Szeider},\n title = {Strong Backdoors to Bounded Treewidth {SAT}},\n booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}\n 2013, 26-29 October, 2013, Berkeley, CA, {USA}},\n pages = {489--498},\n year = {2013},\n crossref = {DBLP:conf/focs/2013},\n url = {http://dx.doi.org/10.1109/FOCS.2013.59},\n doi = {10.1109/FOCS.2013.59},\n timestamp = {Tue, 16 Dec 2014 00:00:00 +0100},\n biburl = {http://dblp.dagstuhl.de/rec/bib/conf/focs/GaspersS13},\n bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n","author_short":["Gaspers, S.","Szeider, S."],"key":"DBLP:conf/focs/GaspersS13","id":"DBLP:conf/focs/GaspersS13","bibbaseid":"gaspers-szeider-strongbackdoorstoboundedtreewidthsat-2013","role":"author","urls":{"Paper":"http://dx.doi.org/10.1109/FOCS.2013.59"},"downloads":0},"search_terms":["strong","backdoors","bounded","treewidth","sat","gaspers","szeider"],"keywords":[],"authorIDs":[],"dataSources":["7TArQCcqBvtscygA6"]}