{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T04:05:25Z","timestamp":1751083525547},"reference-count":28,"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.1270326","type":"journal-article","created":{"date-parts":[[2004,4,29]],"date-time":"2004-04-29T00:28:59Z","timestamp":1083198539000},"page":"828-837","source":"Crossref","is-referenced-by-count":42,"title":["Simultaneous Floor Planning and Global Routing for Hierarchical Building-Block Layout"],"prefix":"10.1109","volume":"6","author":[{"family":"Wei-Ming Dai","sequence":"first","affiliation":[]},{"given":"E.S.","family":"Kuh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/800158.805070"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1982.1585509"},{"key":"ref13","first-page":"1179","article-title":"A characterization of the partial 3-tree in terms of certain structures","author":"kajitani","year":"1985","journal-title":"Proc 1985 IEEE Int Symp Circuits and Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1984.1585872"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1979.1600080"},{"key":"ref17","author":"lauther","year":"1986","journal-title":"private communication"},{"key":"ref18","first-page":"481","article-title":"Hierarchical global wiring for custom chip design","author":"luk","year":"1986","journal-title":"Proc 23rd Design Automation Conf"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1984.1585874"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130202"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1983.1270040"},{"key":"ref27","first-page":"15","article-title":"Steiner trees in outerplanar graphs","author":"wald","year":"1982","journal-title":"Proc 13th Southeastern Conf on Combinatorics Graph Theory and Computing"},{"key":"ref3","first-page":"756","article-title":"A non 'placement\/routing' approach to automation of VLSI layout design","author":"burstein","year":"1982","journal-title":"Proc 1982 IEEE Int Symp on Circuits and Syst"},{"key":"ref6","first-page":"1214","article-title":"Layout aspects of the VLSI microprocessor design","author":"colbry","year":"1982","journal-title":"Proc 1982 IEEE Int Symp on Circuits and Syst"},{"key":"ref5","article-title":"The Berkeley building-block (BBL) layout system for VLSI design","author":"chen","year":"1983","journal-title":"Dig Tech Papers IEEE Int Conf on Computer-Aided Design"},{"key":"ref8","article-title":"Hierarchical floor planning for building block layout","author":"dai","year":"1986","journal-title":"Dig Tech Papers IEEE Int Conf Computer-Aided Design"},{"key":"ref7","first-page":"189","article-title":"Routing region definition and ordering scheme for building-block layout","volume":"cad 4","author":"dai","year":"1985","journal-title":"IEEE Trans Computer-Aided Design"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0607033"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1145\/37888.37945","article-title":"a dynamic and efficient representation of building-block layout","author":"dai","year":"1987","journal-title":"24th ACM\/IEEE Design Automation Conference"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070104"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1982.1585510"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1986.1586152"},{"key":"ref21","author":"preas","year":"1979","journal-title":"Placement and Routing Algorithms for Hierarchical Integrated Circuit Layout"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/800146.804841"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90042-9"},{"key":"ref26","first-page":"321","article-title":"An algorithm to eliminate all complex triangles in a maximal planar graph for use in VLSI floor-plan","author":"tsukiyama","year":"1986","journal-title":"Proc 1986 IEEE Int Symp on Circuits and Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1981.12167"}],"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\/01270326.pdf?arnumber=1270326","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\/1270326\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1987,9]]}},"URL":"https:\/\/doi.org\/10.1109\/tcad.1987.1270326","relation":{},"ISSN":["0278-0070"],"issn-type":[{"value":"0278-0070","type":"print"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}