Solving \emphd-SAT via Backdoors to Small Treewidth

Solving \emphd-SAT via Backdoors to Small Treewidth. Fomin, F. V., Lokshtanov, D., Misra, N., Ramanujan, M. S., & Saurabh, S. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 630–641, 2015. SIAM.
$Solving \emphd-SAT via Backdoors to Small Treewidth [link]$ Paper doi bibtex

@inproceedings{DBLP:conf/soda/FominLMRS15,
  author    = {Fedor V. Fomin and
               Daniel Lokshtanov and
               Neeldhara Misra and
               M. S. Ramanujan and
               Saket Saurabh},
  editor    = {Piotr Indyk},
  title     = {Solving \emph{d-}SAT via Backdoors to Small Treewidth},
  booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  pages     = {630--641},
  publisher = {{SIAM}},
  year      = {2015},
  url       = {https://doi.org/10.1137/1.9781611973730.43},
  doi       = {10.1137/1.9781611973730.43},
  timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/FominLMRS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0

{"_id":"oPbfhpaXz7mkSSXbh","bibbaseid":"fomin-lokshtanov-misra-ramanujan-saurabh-solvingemphdsatviabackdoorstosmalltreewidth-2015","author_short":["Fomin, F. V.","Lokshtanov, D.","Misra, N.","Ramanujan, M. S.","Saurabh, S."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Fedor","V."],"propositions":[],"lastnames":["Fomin"],"suffixes":[]},{"firstnames":["Daniel"],"propositions":[],"lastnames":["Lokshtanov"],"suffixes":[]},{"firstnames":["Neeldhara"],"propositions":[],"lastnames":["Misra"],"suffixes":[]},{"firstnames":["M.","S."],"propositions":[],"lastnames":["Ramanujan"],"suffixes":[]},{"firstnames":["Saket"],"propositions":[],"lastnames":["Saurabh"],"suffixes":[]}],"editor":[{"firstnames":["Piotr"],"propositions":[],"lastnames":["Indyk"],"suffixes":[]}],"title":"Solving \\emphd-SAT via Backdoors to Small Treewidth","booktitle":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015","pages":"630–641","publisher":"SIAM","year":"2015","url":"https://doi.org/10.1137/1.9781611973730.43","doi":"10.1137/1.9781611973730.43","timestamp":"Tue, 02 Feb 2021 17:07:30 +0100","biburl":"https://dblp.org/rec/conf/soda/FominLMRS15.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/soda/FominLMRS15,\n author = {Fedor V. Fomin and\n Daniel Lokshtanov and\n Neeldhara Misra and\n M. S. Ramanujan and\n Saket Saurabh},\n editor = {Piotr Indyk},\n title = {Solving \\emph{d-}SAT via Backdoors to Small Treewidth},\n booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete\n Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},\n pages = {630--641},\n publisher = {{SIAM}},\n year = {2015},\n url = {https://doi.org/10.1137/1.9781611973730.43},\n doi = {10.1137/1.9781611973730.43},\n timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},\n biburl = {https://dblp.org/rec/conf/soda/FominLMRS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Fomin, F. V.","Lokshtanov, D.","Misra, N.","Ramanujan, M. S.","Saurabh, S."],"editor_short":["Indyk, P."],"key":"DBLP:conf/soda/FominLMRS15","id":"DBLP:conf/soda/FominLMRS15","bibbaseid":"fomin-lokshtanov-misra-ramanujan-saurabh-solvingemphdsatviabackdoorstosmalltreewidth-2015","role":"author","urls":{"Paper":"https://doi.org/10.1137/1.9781611973730.43"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/85/6789.bib","dataSources":["tDMHZRX27gzjeY5r7"],"keywords":[],"search_terms":["solving","emphd","sat","via","backdoors","small","treewidth","fomin","lokshtanov","misra","ramanujan","saurabh"],"title":"Solving \\emphd-SAT via Backdoors to Small Treewidth","year":2015}