{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:05:19Z","timestamp":1758279919066},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0304-3975(81)90085-2","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T23:13:42Z","timestamp":1034291622000},"page":"321-328","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of graph embeddability problems"],"prefix":"10.1016","volume":"15","author":[{"given":"C.","family":"Benzaken","sequence":"first","affiliation":[]},{"given":"S.","family":"Foldes","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(81)90085-2_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0304-3975(81)90085-2_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/800157.805047","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971","journal-title":"Proc. 3rd Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(81)90085-2_BIB3","doi-asserted-by":"crossref","unstructured":"S. Foldes and R. Steinberg, A topological space for which graph embeddability is undecidable, J. Combinatorial Theory Ser B, to appear.","DOI":"10.1016\/0095-8956(80)90092-1"},{"key":"10.1016\/0304-3975(81)90085-2_BIB4","series-title":"Aufz\u00e4hlbarkeit, Entscheidbarkeit, Berechenbarkeit","author":"Hermes","year":"1971"},{"key":"10.1016\/0304-3975(81)90085-2_BIB5","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1973"},{"key":"10.1016\/0304-3975(81)90085-2_BIB6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(81)90085-2_BIB7","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","article-title":"Recursively enumerable sets of positive integers and their decision problems","volume":"50","author":"Post","year":"1944","journal-title":"Bull Amer. Math. Soc."},{"key":"10.1016\/0304-3975(81)90085-2_BIB8","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397581900852?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397581900852?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T13:25:17Z","timestamp":1554989117000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397581900852"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981]]}},"alternative-id":["0304397581900852"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(81)90085-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}