{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T17:50:48Z","timestamp":1694627448815},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1109\/tcad.1987.1270259","type":"journal-article","created":{"date-parts":[[2004,4,29]],"date-time":"2004-04-29T00:28:59Z","timestamp":1083198539000},"page":"159-164","source":"Crossref","is-referenced-by-count":12,"title":["A Heuristic Algorithm for Gate Assignment in One-Dimensional Array Approach"],"prefix":"10.1109","volume":"6","author":[{"given":"T.","family":"Fujii","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Horikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Kikuno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"136","author":"kani","year":"1983","journal-title":"Fundamentals of VLSI-CAD"},{"key":"ref3","author":"horikawa","year":"1985","journal-title":"A layout algorithm for one-dimensional array"},{"key":"ref10","first-page":"199","article-title":"Gate matrix layout","author":"wing","year":"1985","journal-title":"Proc 1985 Int Symp Circuits Syst"},{"key":"ref6","first-page":"141","article-title":"A heuristic procedure for ordering MOS arrays","volume":"j59 a","author":"kawanishi","year":"1976","journal-title":"Trans IECE Japan"},{"key":"ref5","first-page":"657","article-title":"NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph","author":"kashiwabara","year":"1979","journal-title":"Proc 1979 Int Symp Circuits Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1979.1084695"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.1980.1051462"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1987.1270259"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.1967.1049816"},{"key":"ref1","first-page":"1","article-title":"An optimum gate placement algorithm for MOS one-dimensional arrays","volume":"vi","author":"asano","year":"1982","journal-title":"J Digital Systems"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/43\/28440\/01270259.pdf?arnumber=1270259","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:39:45Z","timestamp":1638218385000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1270259\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,3]]}},"URL":"https:\/\/doi.org\/10.1109\/tcad.1987.1270259","relation":{},"ISSN":["0278-0070"],"issn-type":[{"value":"0278-0070","type":"print"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}