{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:55:17Z","timestamp":1649033717372},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0020-0190(01)00225-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"175-178","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of homomorphisms to direct products of graphs"],"prefix":"10.1016","volume":"81","author":[{"given":"Judit","family":"B\u00fcki","sequence":"first","affiliation":[]},{"given":"Csaba","family":"Szab\u00f3","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00225-3_BIB001","unstructured":"T. Feder, P. Hell, J. Huang, List homomorphisms to general graphs, Manuscript, 1996"},{"key":"10.1016\/S0020-0190(01)00225-3_BIB002","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1006\/jctb.1997.1812","article-title":"List homomorphism to reflexive graphs","volume":"72","author":"Feder","year":"1998","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0020-0190(01)00225-3_BIB003","series-title":"Proc. 25th Annual ACM Symposium on Theory of Computing","first-page":"612","article-title":"Monotone monadic SNP and constraint satisfaction","author":"Feder","year":"1993"},{"key":"10.1016\/S0020-0190(01)00225-3_BIB004","series-title":"Retractions de graphes, Ph.D. Thesis","author":"Hell","year":"1972"},{"key":"10.1016\/S0020-0190(01)00225-3_BIB005","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","article-title":"On the complexity of H-coloring","volume":"48","author":"Hell","year":"1990","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0020-0190(01)00225-3_BIB006","unstructured":"G. MacGillivary, Personal information"},{"key":"10.1016\/S0020-0190(01)00225-3_BIB007","series-title":"Diploma Thesis","author":"Ol\u00e1h","year":"1998"},{"key":"10.1016\/S0020-0190(01)00225-3_BIB008","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(87)90058-8","article-title":"Absolute retracts of bipartite graphs","volume":"16","author":"Bandelt","year":"1987","journal-title":"Discrete Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002253?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002253?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T01:50:33Z","timestamp":1556848233000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0020019001002253"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00225-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}