{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T01:02:29Z","timestamp":1774400549573,"version":"3.50.1"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1109\/icecs.2005.4633438","type":"proceedings-article","created":{"date-parts":[[2008,9,29]],"date-time":"2008-09-29T16:03:55Z","timestamp":1222704235000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["Floorplan-aware Steiner tree reconstruction for optimal buffer insertion"],"prefix":"10.1109","author":[{"given":"Jin-Tai","family":"Yan","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan, R.O.C"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chia-Fang","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan, R.O.C"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzu-Ya","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan, R.O.C"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"556","article-title":"Steiner tree optimization for buffers, blockages, and bays","author":"hu","year":"2001","journal-title":"IEEE ICCAD"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/43.752927","article-title":"Non-Hanan routing","volume":"18","author":"hou","year":"1999","journal-title":"IEEE Trans Computer-Aided Design"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1990.112223"},{"key":"ref5","first-page":"92","article-title":"Buffer insertion with adaptive blockage avoidance","author":"alpert","year":"2002","journal-title":"ISPD"},{"key":"ref8","first-page":"461","article-title":"A simulated-annealing-based approach for timing-constrained flexibility-driven routing tree construction","author":"yan","year":"2004","journal-title":"IEEE MWSCAS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775980"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"ref9","first-page":"683","article-title":"Timing-constrained congestion-driven global routing","author":"yan","year":"2004","journal-title":"IEEE ASPDAC"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1999.810675"}],"event":{"name":"2005 12th IEEE International Conference on Electronics, Circuits and Systems - (ICECS 2005)","location":"Gammarth, Tunisia","start":{"date-parts":[[2005,12,11]]},"end":{"date-parts":[[2005,12,14]]}},"container-title":["2005 12th IEEE International Conference on Electronics, Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4617928\/4633368\/04633438.pdf?arnumber=4633438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T00:31:34Z","timestamp":1774398694000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4633438\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/icecs.2005.4633438","relation":{},"subject":[],"published":{"date-parts":[[2005,12]]}}}