Solving d-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. Paper doi bibtex @inproceedings{FominLMRamanujanS15,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Neeldhara Misra and
M. S. Ramanujan and
Saket Saurabh},
title = {Solving {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},
year = {2015},
url = {http://dx.doi.org/10.1137/1.9781611973730.43},
doi = {10.1137/1.9781611973730.43},
timestamp = {Wed, 28 Jan 2015 11:28:51 +0100},
}
Downloads: 0
{"_id":"e7D3bB9nXtb2uwAPr","bibbaseid":"fomin-lokshtanov-misra-ramanujan-saurabh-solvingdsatviabackdoorstosmalltreewidth-2015","downloads":0,"creationDate":"2017-10-05T10:51:21.869Z","title":"Solving d-SAT via Backdoors to Small Treewidth","author_short":["Fomin, F. V.","Lokshtanov, D.","Misra, N.","Ramanujan, M. S.","Saurabh, S."],"year":2015,"bibtype":"inproceedings","biburl":"https://www2.warwick.ac.uk/fac/sci/dcs/people/ramanujan_sridharan/publications-web_copy.bib","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":[]}],"title":"Solving 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","year":"2015","url":"http://dx.doi.org/10.1137/1.9781611973730.43","doi":"10.1137/1.9781611973730.43","timestamp":"Wed, 28 Jan 2015 11:28:51 +0100","bibtex":"@inproceedings{FominLMRamanujanS15,\n author = {Fedor V. Fomin and\n Daniel Lokshtanov and\n Neeldhara Misra and\n M. S. Ramanujan and\n Saket Saurabh},\n title = {Solving {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 year = {2015},\n url = {http://dx.doi.org/10.1137/1.9781611973730.43},\n doi = {10.1137/1.9781611973730.43},\n timestamp = {Wed, 28 Jan 2015 11:28:51 +0100},\n\n}\n\n","author_short":["Fomin, F. V.","Lokshtanov, D.","Misra, N.","Ramanujan, M. S.","Saurabh, S."],"key":"FominLMRamanujanS15","id":"FominLMRamanujanS15","bibbaseid":"fomin-lokshtanov-misra-ramanujan-saurabh-solvingdsatviabackdoorstosmalltreewidth-2015","role":"author","urls":{"Paper":"http://dx.doi.org/10.1137/1.9781611973730.43"},"downloads":0,"html":""},"search_terms":["solving","sat","via","backdoors","small","treewidth","fomin","lokshtanov","misra","ramanujan","saurabh"],"keywords":[],"authorIDs":["59d60ea928edf54e23000035"],"dataSources":["NMnTopwcKW96LjkcR"]}