Solving d-SAT via Backdoors to Small Treewidth

Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Ramanujan, M. S.; Saurabh, Saket

doi:10.1137/1.9781611973730.43

by Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh

Reference:

Solving d-SAT via Backdoors to Small TreewidthFedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket SaurabhProceedings 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.

Bibtex Entry:

@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       = {10.1137/1.9781611973730.43">http://dx.doi.org/10.1137/1.9781611973730.43},
  doi       = {10.1137/1.9781611973730.43},
  timestamp = {Wed, 28 Jan 2015 11:28:51 +0100},

}