{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:04:24Z","timestamp":1773230664910,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1016\/0196-6774(86)90002-7","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"174-184","source":"Crossref","is-referenced-by-count":111,"title":["Planar 3DM is NP-complete"],"prefix":"10.1016","volume":"7","author":[{"given":"M.E","family":"Dyer","sequence":"first","affiliation":[]},{"given":"A.M","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(86)90002-7_BIB1","unstructured":"F. Berman, T. Leighton, P. W. Shor, and L. Snyder, Generalised planar matching."},{"key":"10.1016\/0196-6774(86)90002-7_BIB2","first-page":"183","article-title":"Ordered matchings without alternating cycles in bipartite graphs","volume":"16","author":"Chaty","year":"1979","journal-title":"Utilitas Math."},{"key":"10.1016\/0196-6774(86)90002-7_BIB3","doi-asserted-by":"crossref","unstructured":"M. E. Dyer and A. M. Frieze, On the complexity of partitioning graphs into connected subgraphs, Discrete Appl. Math., in press.","DOI":"10.1016\/0166-218X(85)90008-3"},{"key":"10.1016\/0196-6774(86)90002-7_BIB4","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0196-6774(86)90002-7_BIB5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar formulae and their uses","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(86)90002-7_BIB6","unstructured":"W. R. Pulleyblank, On minimising setups in precedence constrained scheduling, Discrete Appl. Math., in press."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677486900027?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677486900027?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:25:38Z","timestamp":1548725138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677486900027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["0196677486900027"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(86)90002-7","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}