{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T04:03:41Z","timestamp":1777176221522,"version":"3.51.4"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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,1]]},"DOI":"10.1109\/tcad.1987.1270248","type":"journal-article","created":{"date-parts":[[2004,4,28]],"date-time":"2004-04-28T20:28:59Z","timestamp":1083184139000},"page":"79-84","source":"Crossref","is-referenced-by-count":55,"title":["Exact and Approximate Solutions for the Gate Matrix Layout Problem"],"prefix":"10.1109","volume":"6","author":[{"given":"N.","family":"Deo","sequence":"first","affiliation":[]},{"given":"M.S.","family":"Krishnamoorthy","sequence":"additional","affiliation":[]},{"given":"M.A.","family":"Langston","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/T-ED.1980.20086"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"ref12","author":"papdimitriou","year":"1977","journal-title":"Combinatorial Optimization Algorithms and Complexity"},{"key":"ref13","author":"reingold","year":"1977","journal-title":"Combinatorial Algorithms Theory and Practice"},{"key":"ref14","first-page":"681","article-title":"Automated gate matrix layout","author":"wing","year":"0","journal-title":"Proc 1982 Int Symp Circuits Syst"},{"key":"ref15","first-page":"84","article-title":"Interval-graph-based circuit layout","author":"wing","year":"0","journal-title":"Proc 1983 Int Conf CAD"},{"key":"ref4","author":"friesen","year":"0","journal-title":"private communication"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90054-8"},{"key":"ref6","author":"horowitz","year":"1979","journal-title":"Fundamentals of Computer Algorithms"},{"key":"ref5","author":"golumbic","year":"1980","journal-title":"Algorithmic Graph Theory and Perfect Graphs"},{"key":"ref8","author":"kirkpatrick","year":"1982","journal-title":"Optimization by simulated annealing"},{"key":"ref7","first-page":"82","article-title":"An NP-complete problem on interval graph","author":"kashiwabara","year":"0","journal-title":"Proc 1979 IEEE Int Symp Circuits Syst"},{"key":"ref2","first-page":"81","article-title":"Heuristics for the board permutation problem","author":"cohoon","year":"0","journal-title":"Proc 1983 Int Conf CAD"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80045-1"},{"key":"ref9","first-page":"1013","article-title":"Algorithms for gate matrix layout","author":"li","year":"0","journal-title":"Proc 1983 IEEE Int Symp Circuits and 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\/28439\/01270248.pdf?arnumber=1270248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:39:44Z","timestamp":1638200384000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1270248\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,1]]}},"URL":"https:\/\/doi.org\/10.1109\/tcad.1987.1270248","relation":{},"ISSN":["0278-0070"],"issn-type":[{"value":"0278-0070","type":"print"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}