{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:06:24Z","timestamp":1743019584423,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":13,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_283","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:30:15Z","timestamp":1214505015000},"page":"639-640","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized SAT"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Szeider","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"283_CR1_283","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem\u2010proving procedures. In: Proc. 3rd Annual Symp. on Theory of Computing, Shaker Heights, OH 1971, pp.\u00a0151\u2013158","DOI":"10.1145\/800157.805047"},{"key":"283_CR2_283","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity. Monographs in Computer Science","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Berlin (1999)"},{"key":"283_CR3_283","series-title":"Texts in Theoretical Computer Science, vol. XIV. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science, vol.\u00a0XIV. An EATCS Series. Springer, Berlin (2006)"},{"key":"283_CR4_283","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0004-3702(02)00182-0","volume":"138","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Scarcello, F., Sideri, M.: Fixed\u2010parameter complexity in AI and nonmonotonic reasoning. Artif. Intell. 138, 55\u201386 (2002)","journal-title":"Artif. Intell."},{"key":"283_CR5_283","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Szeider, S.: Fixed\u2010parameter algorithms for artificial intelligence, constraint satisfaction, and database problems. Comput.\u00a0J., Special Issue on Parameterized Complexity, Advanced Access (2007)","DOI":"10.1093\/comjnl\/bxm056"},{"key":"283_CR6_283","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed\u2010Parameter Algorithms, Oxford Lecture Series in Mathematics and Its Applications","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed\u2010Parameter Algorithms, Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford, UK (2006)"},{"key":"283_CR7_283","unstructured":"Nishimura, N., Ragde, P., Szeider, S.: Detecting backdoor sets with respect to Horn and binary clauses. In: Informal proceedings of SAT 2004, 7th International Conference on Theory and Applications of Satisfiability Testing, Vancouver, BC, Canada, 10\u201313 May 2004, pp.\u00a096\u2013103"},{"issue":"7\u20138","key":"283_CR8_283","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00236-007-0056-x","volume":"44","author":"N. Nishimura","year":"2007","unstructured":"Nishimura, N., Ragde, P., Szeider, S.: Solving SAT using vertex covers. Acta Inf. 44(7\u20138), 509\u2013523 (2007)","journal-title":"Acta Inf."},{"key":"283_CR9_283","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0022-0000(88)90042-6","volume":"37","author":"C.H. Papadimitriou","year":"1988","unstructured":"Papadimitriou, C.H., Wolfe, D.: The complexity of facets resolved. J.\u00a0Comput. Syst. Sci. 37, 2\u201313 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"283_CR10_283","first-page":"484","volume-title":"Proceedings of LPAR 2007, 14th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Yerevan, Armenia, 15\u201319 October 2007. Lecture Notes in Computer Science, vol. 4790","author":"M. Samer","year":"2007","unstructured":"Samer, M., Szeider, S.: Algorithms for propositional model counting. In: Proceedings of LPAR 2007, 14th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Yerevan, Armenia, 15\u201319 October 2007. Lecture Notes in Computer Science, vol.\u00a04790, pp.\u00a0484\u2013498. Springer, Berlin (2007)"},{"key":"283_CR11_283","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1016\/j.jcss.2004.04.009","volume":"69","author":"S. Szeider","year":"2004","unstructured":"Szeider, S.: Minimal unsatisfiable formulas with bounded clause\u2010variable difference are fixed\u2010parameter tractable. J.\u00a0Comput. Syst. Sci. 69, 656\u2013674 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"283_CR12_283","first-page":"188","volume-title":"Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers. Lecture Notes in Computer Science, vol. 2919","author":"S. Szeider","year":"2004","unstructured":"Szeider, S.: On fixed\u2010parameter tractable parameterizations of SAT. In: Giunchiglia, E., Tacchella, A. (eds.) Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers. Lecture Notes in Computer Science, vol.\u00a02919, pp.\u00a0188\u2013202. Springer, Berlin (2004)"},{"key":"283_CR13_283","unstructured":"Williams, R., Gomes, C., Selman, B.: On the connections between backdoors, restarts, and heavy\u2010tailedness in combinatorial search, In: informal proceedings of SAT 2003 (Sixth International Conference on Theory and Applications of Satisfiability Testing, 5\u20138 May 2003, S.\u00a0Margherita Ligure\u00a0\u2013 Portofino, Italy), 2003, pp.\u00a0222\u2013230"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:23:03Z","timestamp":1662175383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_283"}},"subtitle":["2003; Szeider"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_283","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}