{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:50:09Z","timestamp":1767927009877,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1007\/bf01582878","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:11Z","timestamp":1114677311000},"page":"29-43","source":"Crossref","is-referenced-by-count":11,"title":["On area-efficient drawings of rectangular duals for VLSI floor-plan"],"prefix":"10.1007","volume":"52","author":[{"given":"Katsunori","family":"Tani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuji","family":"Tsukiyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoji","family":"Shinoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isao","family":"Shirakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even,Graph Algorithms (Computer Science Press, Potomac, MD, 1979)."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"S.L. Hakami, \u201cA problem on rectangular floorplan,\u201dProceedings of 1988 International Symposium on Circuits and Systems (1988) pp. 1533\u20131536.","DOI":"10.1109\/ISCAS.1988.15222"},{"key":"CR3","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary,Graph Theory (Addison-Wesley, Reading, MA, 1969)."},{"key":"CR4","unstructured":"K. Koike, M.H. Yoo, K. Tani, S. Tsukiyama and I. Shirakawa, \u201cA chip floor-plan technique with the use of rectangular dual graph,\u201dMonograph of IECE of Japan CAS 85-144 (1986). [In Japanese.]"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"K. Kozminski and E. Kinnen, \u201cAn algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits,\u201dProceedings of the 21st Design Automation Conference (1984) pp. 655\u2013656. [Also see: \u201cRectangular duals of planar graphs,\u201dNetworks 15(2) (1985) 145\u2013157.]","DOI":"10.1109\/DAC.1984.1585872"},{"issue":"11","key":"CR6","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1109\/31.14464","volume":"35","author":"K. Kozminski","year":"1988","unstructured":"K. Kozminski and E. Kinnen, \u201cRectangular dualization and rectangular dissections,\u201dIEEE Transactions on Circuits and Systems 35(11) (1988) 1401\u20131416.","journal-title":"IEEE Transactions on Circuits and Systems"},{"issue":"12","key":"CR7","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1109\/43.16806","volume":"7","author":"Y.T. Lai","year":"1988","unstructured":"Y.T. Lai and S.M. Leinwand, \u201cAlgorithms for floorplan design via rectangular dualization,\u201dIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 7(12) (1988) 1278\u20131289.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"CR8","unstructured":"K. Maling, S.H. Mueller and W.R. Heller, \u201cOn finding most optimal rectangular package plans,\u201dProceedings of the 19th Design Automation Conference (1982) pp. 663\u2013670."},{"key":"CR9","unstructured":"R.H.J.M. Otten, \u201cEfficient floorplan optimization,\u201dProceedings of 1983 International Conference on Computer Design: VLSI in Computers (1983) pp. 499\u2013502."},{"issue":"2\/3","key":"CR10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(83)80038-2","volume":"57","author":"L. Stockmeyer","year":"1983","unstructured":"L. Stockmeyer, \u201cOptimal orientations of cells in slicing floorplan designs,\u201dInformation and Control 57(2\/3) (1983) 91\u2013101.","journal-title":"Information and Control"},{"key":"CR11","unstructured":"K. Tani, S. Tsukiyama and I. Shirakawa, \u201cA floor-plan system using a rectangular dual,\u201dProceedings of 1988 Joint Technical Conference on Circuits\/Systems, Computers, and Communications (1988) pp. 310\u2013315."},{"key":"CR12","unstructured":"S. Tsukiyama, K. Koike and I. Shirakawa, \u201cAn algorithm to eliminate all complex triangles in a maximal planar graph for use in VLSI floor-plan,\u201dProceedings of 1986 International Symposium on Circuits and Systems (1986) pp. 321\u2013324."},{"key":"CR13","unstructured":"S. Tsukiyama, K. Tani and I. Shirakawa, \u201cAn algorithm generating all rectangular duals for VLSI floor-plan,\u201dDigest of 1987 Symposium on VLSI Circuits (1987) pp. 15\u201316."},{"issue":"3","key":"CR14","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/31.1739","volume":"35","author":"S. Wimer","year":"1988","unstructured":"S. Wimer, I. Koren and I. Cederbaum, \u201cFloorplans, planar graphs, and layouts,\u201dIEEE Transactions on Circuits and Systems 35(3) (1988) pp. 267\u2013278.","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"CR15","unstructured":"D.F. Wong and C.L. Liu, \u201cA new algorithm for floorplan design,\u201dProceedings of the 23rd Design Automation Conference (1986) pp. 101\u2013107."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582878.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582878\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582878","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:15:55Z","timestamp":1556896555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582878"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["BF01582878"],"URL":"https:\/\/doi.org\/10.1007\/bf01582878","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}