{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:58:25Z","timestamp":1725533905411},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_27","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T02:58:18Z","timestamp":1245985098000},"page":"276-283","source":"Crossref","is-referenced-by-count":2,"title":["The Parameterized Complexity of k-Flip Local Search for SAT and MAX\u00a0SAT"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Szeider","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(01)00174-8","volume":"289","author":"E. Dantsin","year":"2002","unstructured":"Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J.M., Papadimitriou, C.H., Raghavan, P., Sch\u00f6ning, U.: A deterministic (2\u2009\u2212\u20092\/(k\u2009+\u20091))\n                    n\n                   algorithm for k-SAT based on local search. Theoret. Comput. Sci.\u00a0289(1), 69\u201383 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR2","series-title":"Monographs in Computer Science","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. Monographs in Computer Science. Springer, Heidelberg (1999)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-39890-5_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.R. Fellows","year":"2003","unstructured":"Fellows, M.R.: Blow-Ups, Win\/Win\u2019s, and Crown Rules: Some New Directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 1\u201312. Springer, Heidelberg (2003)"},{"key":"27_CR4","series-title":"Texts in Theoretical Computer Science. 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. An EATCS Series, vol.\u00a0XIV. Springer, Heidelberg (2006)"},{"issue":"6","key":"27_CR5","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1145\/504794.504798","volume":"48","author":"M. Frick","year":"2001","unstructured":"Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. J. ACM\u00a048(6), 1184\u20131206 (2001)","journal-title":"J. ACM"},{"key":"27_CR6","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Elsevier\/Morgan Kaufmann (2004)"},{"issue":"4","key":"27_CR7","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. of Computer and System Sciences\u00a063(4), 512\u2013530 (2001)","journal-title":"J. of Computer and System Sciences"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. of Computer and System Sciences\u00a037(1), 79\u2013100 (1988)","journal-title":"J. of Computer and System Sciences"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1137\/S0097539799363359","volume":"32","author":"S. Khuller","year":"2003","unstructured":"Khuller, S., Bhatia, R., Pless, R.: On local search and placement of meters in networks. SIAM J. Comput.\u00a032(2), 470\u2013487 (2003)","journal-title":"SIAM J. Comput."},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-540-70575-8_54","volume-title":"Automata, Languages and Programming","author":"A.A. Krokhin","year":"2008","unstructured":"Krokhin, A.A., Marx, D.: On the hardness of losing weight. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 662\u2013673. Springer, Heidelberg (2008)"},{"issue":"1","key":"27_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.orl.2007.02.008","volume":"36","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Searching the k-change neighborhood for TSP is W[1]-hard. Oper. Res. Lett.\u00a036(1), 31\u201336 (2008)","journal-title":"Oper. Res. Lett."},{"key":"27_CR12","series-title":"Oxford Lecture Series in Mathematics and its Applications","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 Lecture Series in Mathematics and its Applications. Oxford University Press, Oxford (2006)"},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"67","author":"K. Pietrzak","year":"2003","unstructured":"Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. of Computer and System Sciences\u00a067(4), 757\u2013771 (2003)","journal-title":"J. of Computer and System Sciences"},{"key":"27_CR14","first-page":"425","volume-title":"Handbook of Satisfiability, ch.\u00a013","author":"M. Samer","year":"2009","unstructured":"Samer, M., Szeider, S.: Fixed-parameter tractability. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, ch.\u00a013, pp. 425\u2013454. IOS Press, Amsterdam (2009)"},{"issue":"1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1009873324187","volume":"3","author":"M. Yagiura","year":"1999","unstructured":"Yagiura, M., Ibaraki, T.: Analyses on the 2 and 3-flip neighborhoods for the MAX SAT. J. Comb. Optim.\u00a03(1), 95\u2013114 (1999)","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T19:56:31Z","timestamp":1552074991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}