{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:29:44Z","timestamp":1757626184578,"version":"3.44.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1985,3]]},"DOI":"10.1016\/0167-9260(85)90053-7","type":"journal-article","created":{"date-parts":[[2004,8,19]],"date-time":"2004-08-19T09:10:49Z","timestamp":1092906649000},"page":"33-48","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Interval-graph-based PLA folding"],"prefix":"10.1016","volume":"3","author":[{"given":"Qingjian","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omar","family":"Wing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0167-9260(85)90053-7_BIB1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/TCAD.1982.1269996","article-title":"An algorithm for optimal PLA folding","volume":"CAD-1","author":"Hachtel","year":"1982","journal-title":"IEEE Trans. on CAD"},{"issue":"3","key":"10.1016\/0167-9260(85)90053-7_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TCAD.1983.1270033","article-title":"Multiple constrained folding of programmable logic arrays: Theory and applications","volume":"CAD-2","author":"Micheli","year":"1983","journal-title":"IEEE Trans. on CAD"},{"key":"10.1016\/0167-9260(85)90053-7_BIB3","series-title":"Proc. IEEE ISCAS","first-page":"681","article-title":"Automated gate matrix layout","author":"Wing","year":"1982"},{"key":"10.1016\/0167-9260(85)90053-7_BIB4","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/0022-0000(81)90022-2","article-title":"On minimal augmentation to a graph to obtain an interval graph","volume":"1","author":"Ohtsuki","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-9260(85)90053-7_BIB5","series-title":"SHARE-ACM-IEEE Design Automation Workshop","first-page":"155","article-title":"Wire routing by optimizing channel assignment with large apertures","author":"Hashimoto","year":"1971"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926085900537?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926085900537?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:38:08Z","timestamp":1757453888000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926085900537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["0167926085900537"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(85)90053-7","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1985,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Interval-graph-based PLA folding","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(85)90053-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1985 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}