{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:53:27Z","timestamp":1759146807722},"reference-count":13,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"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,9]]},"DOI":"10.1109\/tcad.1987.1270323","type":"journal-article","created":{"date-parts":[[2004,4,29]],"date-time":"2004-04-29T00:28:59Z","timestamp":1083198539000},"page":"802-809","source":"Crossref","is-referenced-by-count":44,"title":["An Efficient Approach to Gate Matrix Layout"],"prefix":"10.1109","volume":"6","author":[{"given":"D.K.","family":"Hwang","sequence":"first","affiliation":[]},{"given":"W.K.","family":"Fuchs","sequence":"additional","affiliation":[]},{"family":"Sung Mo Kang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1982.1585498"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/800153.804930"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676460"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1985.1270118"},{"key":"ref3","first-page":"681","article-title":"Automated gate matrix layout","author":"wing","year":"1982","journal-title":"Proc Int Symp Circuits Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1987.1270248"},{"key":"ref5","first-page":"1013","article-title":"Algorithms for gate matrix layout","author":"li","year":"1983","journal-title":"IEEE Proc Int Symp Circuits Syst"},{"key":"ref8","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":"IEEE Proc Int Symp Circuits Syst"},{"key":"ref7","article-title":"A new algorithm for gate-matrix layout","author":"leong","year":"1986","journal-title":"Dig IEEE Int Conf Computer-Aided Design"},{"key":"ref2","first-page":"84","article-title":"Interval-graph-based circuit layout","author":"wing","year":"1983","journal-title":"Dig IEEE Int Conf Computer-Aided Design"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/T-ED.1980.20086"},{"key":"ref9","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 Syst"}],"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\/28443\/01270323.pdf?arnumber=1270323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:39:46Z","timestamp":1638218386000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1270323\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1987,9]]}},"URL":"https:\/\/doi.org\/10.1109\/tcad.1987.1270323","relation":{},"ISSN":["0278-0070"],"issn-type":[{"value":"0278-0070","type":"print"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}