{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:06Z","timestamp":1759063686564},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642306419"},{"type":"electronic","value":"9783642306426"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30642-6_16","type":"book-chapter","created":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T08:01:39Z","timestamp":1344672099000},"page":"160-171","source":"Crossref","is-referenced-by-count":3,"title":["Finding Vertex-Surjective Graph Homomorphisms"],"prefix":"10.1007","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Lidick\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-17517-6_33","volume-title":"Algorithms and Computation","author":"A. Adiga","year":"2010","unstructured":"Adiga, A., Chitnis, R., Saurabh, S.: Parameterized Algorithms for Boxicity. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol.\u00a06506, pp. 366\u2013377. Springer, Heidelberg (2010)"},{"key":"16_CR2","unstructured":"Bodirsky, M., K\u00e1ra, J., Martin, B.: The complexity of surjective homomorphism problems \u2013 a survey (manuscript), ArXiv, \n                    \n                      http:\/\/arxiv.org\/abs\/1104.5257"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11821069_21","volume-title":"Mathematical Foundations of Computer Science 2006","author":"J. Chen","year":"2006","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved Parameterized Upper Bounds for Vertex Cover. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Mathematics\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-46135-3_21","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"V. Dalmau","year":"2002","unstructured":"Dalmau, V., Kolaitis, P.G., Vardi, M.Y.: Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 310\u2013326. Springer, Heidelberg (2002)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-11269-0_10","volume-title":"Parameterized and Exact Computation","author":"R. Enciso","year":"2009","unstructured":"Enciso, R., Fellows, M.R., Guo, J., Kanj, I., Rosamond, F., Such\u00fd, O.: What Makes Equitable Connected Partition Easy. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 122\u2013133. Springer, Heidelberg (2009)"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/080738866","volume":"24","author":"T. Feder","year":"2010","unstructured":"Feder, T., Hell, P., Jonsson, P., Krokhin, A., Nordh, G.: Retractions to pseudoforests. SIAM Journal on Discrete Mathematics\u00a024, 101\u2013112 (2010)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"M.R. Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph Layout Problems Parameterized by Vertex Cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cosrev.2008.06.001","volume":"2","author":"J. Fiala","year":"2008","unstructured":"Fiala, J., Kratochv\u00edl, J.: Locally constrained graph homomorphisms \u2013 structure, complexity, and applications. Computer Science Review\u00a02, 97\u2013111 (2008)","journal-title":"Computer Science Review"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"2513","DOI":"10.1016\/j.tcs.2010.10.043","volume":"412","author":"J. Fiala","year":"2011","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comp. Sci.\u00a0412, 2513\u20132523 (2011)","journal-title":"Theor. Comp. Sci."},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2005.09.029","volume":"349","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theor. Comp. Sci.\u00a0349, 67\u201381 (2005)","journal-title":"Theor. Comp. Sci."},{"key":"16_CR12","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. Springer, Berlin (2006)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica\u00a07, 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-20712-9_20","volume-title":"Computer Science \u2013 Theory and Applications","author":"P.A. Golovach","year":"2011","unstructured":"Golovach, P.A., Paulusma, D., Song, J.: Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol.\u00a06651, pp. 261\u2013274. Springer, Heidelberg (2011)"},{"key":"16_CR15","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.R.: Computers and intractability. Freeman, NY (1979)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM\u00a054 (2007)","DOI":"10.1145\/1206035.1206036"},{"key":"16_CR17","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.: On the complexity of H-colouring. Journal of Combinatorial Theory, Series B\u00a048, 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and homomorphisms. Oxford University Pr. (2004)","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra Jr.","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res.\u00a08, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-23786-7_43","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"B. Martin","year":"2011","unstructured":"Martin, B., Paulusma, D.: The Computational Complexity of Disconnected Cut and 2K\n                  2-Partition. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 561\u2013575. Springer, Heidelberg (2011)"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1137\/S0097539701383522","volume":"32","author":"N. Vikas","year":"2002","unstructured":"Vikas, N.: Computational complexity of compaction to reflexive cycles. SIAM Journal on Computing\u00a032, 253\u2013280 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/S0097539701397801","volume":"33","author":"N. Vikas","year":"2004","unstructured":"Vikas, N.: Compaction, retraction, and constraint satisfaction. SIAM Journal on Computing\u00a033, 761\u2013782 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR23","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, 406\u2013439 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-22685-4_29","volume-title":"Computing and Combinatorics","author":"N. Vikas","year":"2011","unstructured":"Vikas, N.: Algorithms for Partition of Some Class of Graphs under Compaction. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol.\u00a06842, pp. 319\u2013330. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30642-6_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:47:43Z","timestamp":1620128863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30642-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642306419","9783642306426"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30642-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}