Solving <i>d-</i>SAT via Backdoors to Small Treewidth. Fomin, F. V., Lokshtanov, D., Misra, N., Ramanujan, M. S., & Saurabh, S. In Proceedings of Symposium on Discrete Algorithms (SODA), pages 630-641, 2015.
Solving <i>d-</i>SAT via Backdoors to Small Treewidth [link]Paper  bibtex   
@inproceedings{ dblp1913962,
  title = {Solving <i>d-</i>SAT via Backdoors to Small Treewidth},
  author = {Fedor V. Fomin and Daniel Lokshtanov and Neeldhara Misra and M. S. Ramanujan and Saket Saurabh},
  author_short = {Fomin, F. V. and Lokshtanov, D. and Misra, N. and Ramanujan, M. S. and Saurabh, S.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2015},
  key = {dblp1913962},
  id = {dblp1913962},
  biburl = {http://www.dblp.org/rec/bibtex/conf/soda/FominLMRS15},
  url = {http://dx.doi.org/10.1137/1.9781611973730.43},
  conference = {SODA},
  pages = {630-641},
  text = {SODA 2015:630-641},
  booktitle = {Proceedings of Symposium on Discrete Algorithms (SODA)}
}

Downloads: 0