{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:14:26Z","timestamp":1743041666931,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174926"},{"type":"electronic","value":"9783642174933"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17493-3_10","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T08:41:01Z","timestamp":1291365661000},"page":"84-94","source":"Crossref","is-referenced-by-count":2,"title":["A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application"],"prefix":"10.1007","author":[{"given":"Robert","family":"Crowston","sequence":"first","affiliation":[]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Jones","sequence":"additional","affiliation":[]},{"given":"Anders","family":"Yeo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/11847250_24","volume-title":"Parameterized and Exact Computation","author":"F.N. Abu-Khzam","year":"2006","unstructured":"Abu-Khzam, F.N., Fernau, H.: Kernels: Annotated, proper and induced. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 264\u2013275. Springer, Heidelberg (2006)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Y., Flum, J., M\u00fcller, M.: Lower bounds for kernelizations and other preprocessing procedures. In: Proc. CiE 2009, vol.\u00a05635, pp. 118\u2013128 (2009)","DOI":"10.1007\/978-3-642-03073-4_13"},{"key":"10_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"10_CR4","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-3975(85)90166-5","volume":"40","author":"M.A. Huang","year":"1985","unstructured":"Huang, M.A., Lieberherr, K.J.: Implications of forbidden structures for extremal algorithmic problems. Theoret. Comput. Sci.\u00a040, 195\u2013210 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.endm.2007.07.077","volume":"29","author":"C. K\u00e4ppeli","year":"2007","unstructured":"K\u00e4ppeli, C., Scheder, D.: Partial satisfaction of k-satisfiable formulas. Electronic Notes in Discrete Math.\u00a029, 497\u2013501 (2007)","journal-title":"Electronic Notes in Discrete Math."},{"key":"10_CR7","unstructured":"Kr\u00e1l, D.: Locally satisfiable formulas. In: Proc. SODA 2004, pp. 330\u2013339 (2004)"},{"issue":"2","key":"10_CR8","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(2), 411\u2013421 (1981)","journal-title":"J. ACM"},{"key":"10_CR9","unstructured":"Lieberherr, K.J., Specker, E.: Complexity of partial satisfaction, II. Tech. Report 293 of Dept. of EECS, Princeton Univ. (1982)"},{"issue":"2","key":"10_CR10","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":"10_CR11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1137\/S0895480197326528","volume":"17","author":"L. Trevisan","year":"2004","unstructured":"Trevisan, L.: On local versus global satisfiability. SIAM J. Discret. Math.\u00a017(4), 541\u2013547 (2004)","journal-title":"SIAM J. Discret. Math."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1006\/jagm.1994.1045","volume":"17","author":"M. Yannakakis","year":"1994","unstructured":"Yannakakis, M.: On the approximation of maximum satisfiability. J. Algorithms\u00a017, 475\u2013502 (1994)","journal-title":"J. Algorithms"},{"key":"10_CR14","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)","edition":"2"}],"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-17493-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:38:54Z","timestamp":1559835534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17493-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174926","9783642174933"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17493-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}