{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:44Z","timestamp":1725488984688},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_22","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"228-239","source":"Crossref","is-referenced-by-count":8,"title":["The Maximum Solution Problem on Graphs"],"prefix":"10.1007","author":[{"given":"Peter","family":"Jonsson","sequence":"first","affiliation":[]},{"given":"Gustav","family":"Nordh","sequence":"additional","affiliation":[]},{"given":"Johan","family":"Thapper","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1137\/S0895480191217569","volume":"7","author":"A. Ageev","year":"1994","unstructured":"Ageev, A.: On finding critical independent and vertex sets. SIAM J. Discrete Math.\u00a07(2), 293\u2013295 (1994)","journal-title":"SIAM J. Discrete Math."},{"issue":"11","key":"22_CR2","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/j.artint.2006.04.002","volume":"170","author":"D. Cohen","year":"2006","unstructured":"Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: The complexity of soft constraint satisfaction. Artif. Intell.\u00a0170(11), 983\u20131016 (2006)","journal-title":"Artif. Intell."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/jctb.1997.1812","volume":"72","author":"T. Feder","year":"1998","unstructured":"Feder, T., Hell, P.: List homomorphisms to reflexive graphs. J. Combin. Th (B)\u00a072, 236\u2013250 (1998)","journal-title":"J. Combin. Th. (B)"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s004939970003","volume":"19","author":"T. Feder","year":"1999","unstructured":"Feder, T., Hell, P., Huang, J.: List Homomorphisms and Circular Arc Graphs. Combinatorica\u00a019, 487\u2013505 (1999)","journal-title":"Combinatorica"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Gutin, G., Hell, P., Rafiey, A., Yeo, A.: A dichotomy for minimum cost graph homomorphisms. European J. Combin. (to appear)","DOI":"10.1016\/j.ejc.2007.11.012"},{"issue":"6","key":"22_CR6","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1016\/j.dam.2005.11.006","volume":"154","author":"G. Gutin","year":"2006","unstructured":"Gutin, G., Rafiey, A., Yeo, A.: Minimum cost and list homomorphisms to semicomplete digraphs. Discrete Applied Mathematics\u00a0154(6), 890\u2013897 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"22_CR7","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.dam.2005.06.012","volume":"154","author":"G. Gutin","year":"2006","unstructured":"Gutin, G., Rafiey, A., Yeo, A., Tso, M.: Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Applied Mathematics\u00a0154(6), 881\u2013889 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jgt.20006","volume":"46","author":"P. Hell","year":"2004","unstructured":"Hell, P., Huang, J.: Interval bigraphs and circular arc graphs. J. Graph Theory\u00a046, 313\u2013327 (2004)","journal-title":"J. Graph Theory"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: The complexity of H-coloring. J. Combinatorial Theory B\u00a048, 92\u2013110 (1990)","journal-title":"J. Combinatorial Theory B"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and Homomorphisms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press (2004)","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/3-540-61551-2_80","volume-title":"Principles and Practice of Constraint Programming - CP\u201996","author":"P. Jeavons","year":"1996","unstructured":"Jeavons, P., Cohen, D., Gyssens, M.: A test for tractability. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol.\u00a01118, pp. 267\u2013281. Springer, Heidelberg (1996)"},{"issue":"1\u20132","key":"22_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0304-3975(98)00343-0","volume":"244","author":"P. Jonsson","year":"2000","unstructured":"Jonsson, P.: Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights. Theoretical Computer Science\u00a0244(1\u20132), 189\u2013203 (2000)","journal-title":"Theoretical Computer Science"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/11821069_48","volume-title":"Mathematical Foundations of Computer Science 2006","author":"P. Jonsson","year":"2006","unstructured":"Jonsson, P., Nordh, G.: Generalised integer programming based on logically defined relations. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 549\u2013560. Springer, Heidelberg (2006)"},{"key":"22_CR14","first-page":"139","volume-title":"Proof Techniques in Graph Theory","author":"F. Roberts","year":"1969","unstructured":"Roberts, F.: Indifference graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp. 139\u2013146. Academic Press, London (1969)"},{"key":"22_CR15","unstructured":"Szendrei, \u00c1. (ed.): Clones in Universal Algebra. Seminaires de Math\u00e9matiques Sup\u00e9rieures, vol.\u00a099. University of Montreal (1986)"},{"issue":"4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.jcss.2004.07.003","volume":"71","author":"N. Vikas","year":"2005","unstructured":"Vikas, N.: A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results. J. Comput. Syst. Sci.\u00a071(4), 406\u2013439 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"22_CR17","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0403037","volume":"3","author":"C.-Q. Zhang","year":"1990","unstructured":"Zhang, C.-Q.: Finding critical independent sets and critical vertex subsets are polynomial problems. SIAM J. Discrete Math.\u00a03(3), 431\u2013438 (1990)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:47Z","timestamp":1619519327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}