{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:18Z","timestamp":1759637898832},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332920"},{"type":"electronic","value":"9783642332937"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33293-7_6","type":"book-chapter","created":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T10:50:58Z","timestamp":1346237458000},"page":"37-48","source":"Crossref","is-referenced-by-count":10,"title":["A New Algorithm for Parameterized MAX-SAT"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Bliznets","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Golovnev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/3-540-45995-2_32","volume-title":"LATIN 2002: Theoretical Informatics","author":"J. Chen","year":"2002","unstructured":"Chen, J., Kanj, I.A.: Improved Exact Algorithms for MAX-SAT. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 341\u2013355. Springer, Heidelberg (2002)"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms\u00a031(2), 335\u2013354 (1999)","journal-title":"J. Algorithms"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/3-540-48523-6_54","volume-title":"Automata, Languages and Programming","author":"R. Niedermeier","year":"1999","unstructured":"Niedermeier, R., Rossmanith, P.: New Upper Bounds for MaxSat. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 575\u2013584. Springer, Heidelberg (1999)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-46632-0_26","volume-title":"Algorithms and Computations","author":"N. Bansal","year":"1999","unstructured":"Bansal, N., Raman, V.: Upper Bounds for MaxSat: Further Improved. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol.\u00a01741, pp. 247\u2013258. Springer, Heidelberg (1999)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/s00453-010-9428-7","volume":"61","author":"N. Alon","year":"2011","unstructured":"Alon, N., Gutin, G., Kim, E., Szeider, S., Yeo, A.: Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica\u00a061, 638\u2013655 (2011)","journal-title":"Algorithmica"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s00453-011-9550-1","volume":"64","author":"R. Crowston","year":"2012","unstructured":"Crowston, R., Gutin, G., Jones, M., Yeo, A.: A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications. Algorithmica\u00a064(1), 56\u201368 (2012)","journal-title":"Algorithmica"},{"issue":"17","key":"6_CR7","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1016\/j.dam.2011.07.001","volume":"159","author":"J.M. Rooij van","year":"2011","unstructured":"van Rooij, J.M., Bodlaender, H.L.: Exact algorithms for dominating set. Discrete Applied Mathematics\u00a0159(17), 2147\u20132164 (2011)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-74510-5_21","volume-title":"Computer Science \u2013 Theory and Applications","author":"A. Kulikov","year":"2007","unstructured":"Kulikov, A., Kutzkov, K.: New Bounds for MAX-SAT by Clause Learning. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol.\u00a04649, pp. 194\u2013204. Springer, Heidelberg (2007)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Bliznets: A New Upper Bound for (n,3)-MAX-SAT. Zapiski Nauchnikh Seminarov POMI, 5\u201314 (2012)","DOI":"10.1007\/s10958-012-1101-z"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1145\/322248.322260","volume":"28","author":"K.J. Lieberherr","year":"1981","unstructured":"Lieberherr, K.J., Specker, E.: Complexity of Partial Satisfaction. J. ACM\u00a028, 411\u2013421 (1981)","journal-title":"J. ACM"},{"key":"6_CR11","unstructured":"Yannakakis, M.: On the approximation of maximum satisfiability. In: SODA 1992, pp. 1\u20139 (1992)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33293-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:03:30Z","timestamp":1620129810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33293-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332920","9783642332937"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33293-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}