{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:28Z","timestamp":1759063408437},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1007\/bf01940881","type":"journal-article","created":{"date-parts":[[2005,7,27]],"date-time":"2005-07-27T15:12:55Z","timestamp":1122477175000},"page":"550-571","source":"Crossref","is-referenced-by-count":11,"title":["Area minimization for hierarchical floorplans"],"prefix":"10.1007","volume":"15","author":[{"given":"Peichen","family":"Pan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiping","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. L.","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"BF01940881_CR1","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1142\/S0218126693000484","volume":"3","author":"C. -H. Chen","year":"1993","unstructured":"C. -H. Chen and I. G. Tollis, Area optimization of spiral floorplans,J. Circuits Systems Comput.,3 (2) (1993), 833\u2013857.","journal-title":"J. Circuits Systems Comput."},{"key":"BF01940881_CR2","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1109\/43.229753","volume":"12","author":"K. Chong","year":"1993","unstructured":"K. Chong and S. Sahni, Optimal realizations of floorplans,IEEE Trans. Computer-Aided Design,12 (1993), 793\u2013801.","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"BF01940881_CR3","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1109\/TCAD.1987.1270326","volume":"6","author":"W. -M. Dai","year":"1987","unstructured":"W. -M. Dai and E. S. Kuh, Simultaneous floor planning and global routing for hierarchical building block layout,IEEE Trans. Computer-Aided Design,6 (1987), 828\u2013837.","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"BF01940881_CR4","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H. Edelsbrunner","year":"1990","unstructured":"H. Edelsbrunner and E. P. M\u00fccke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms,ACM Trans. Graphics,9 (1990), 66\u2013104.","journal-title":"ACM Trans. Graphics"},{"key":"BF01940881_CR5","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0304-3975(76)90078-5","volume":"1","author":"M. L. Fredman","year":"1976","unstructured":"M. L. Fredman, How good is the information theory bound in sorting?,Theoret. Comput. Sci.,1 (1976), 355\u2013361.","journal-title":"Theoret. Comput. Sci."},{"key":"BF01940881_CR6","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson,Computers and Intractability, a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"BF01940881_CR7","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O. H. Ibarra","year":"1975","unstructured":"O. H. Ibarra and C. E. Kim, Fast approximation algorithms for the knapsack and sum of subset problems,J. Assoc. Comput. Mach.,22 (1975), 463\u2013468.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01940881_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"T. Lengauer,Combinatorial Algorithms for Integrated Circuit Layout, Wiley, New York, 1990."},{"key":"BF01940881_CR9","volume-title":"Technical Report 46","author":"T. Lengauer","year":"1988","unstructured":"T. Lengauer and R. Muller, The complexity of floorplanning based on binary circuit partitions, Technical Report 46, Department of Mathematics and Computer Science, University of Paderborn, Paderborn, 1988."},{"key":"BF01940881_CR10","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1109\/43.229754","volume":"12","author":"T. Lengauer","year":"1993","unstructured":"T. Lengauer and R. Muller, Robust and accurate hierarchical floorplanning with integrated global wiring,IEEE Trans. Computer-Aided Design,12 (1993), 802\u2013809.","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"BF01940881_CR11","doi-asserted-by":"crossref","unstructured":"R. H. J. M. Otten, Automatic floorplan design,Proc. 19th ACM\/IEEE Design Automation Conf., 1982, pp. 261\u2013267.","DOI":"10.1109\/DAC.1982.1585510"},{"key":"BF01940881_CR12","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/cta.4490160405","volume":"16","author":"R. H. J. M. Otten","year":"1988","unstructured":"R. H. J. M. Otten, Graphs in floorplan design,Internat. J. Circuit Theory Appl.,16 (1988), 391\u2013410.","journal-title":"Internat. J. Circuit Theory Appl."},{"issue":"1","key":"BF01940881_CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1109\/43.363119","volume":"14","author":"P. Pan","year":"1995","unstructured":"P. Pan and C. L. Liu, Area minimization for floorplans,IEEE Trans. on Computer-Aided Design,14(1) (1995), 123\u2013132.","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"BF01940881_CR14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(83)80038-2","volume":"59","author":"L. Stockmeyer","year":"1983","unstructured":"L. Stockmeyer, Optimal orientations of cells in slicing floorplan designs,Inform. and Control,59 (1983), 91\u2013101.","journal-title":"Inform. and Control"},{"key":"BF01940881_CR15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0010-4485(84)80007-X","volume":"16","author":"K. J. Supowit","year":"1984","unstructured":"K. J. Supowit and E. A. Slutz, Placement algorithms for custom VLSI,Comput. Aided Design,16 (1984), 45\u201350.","journal-title":"Comput. Aided Design"},{"key":"BF01940881_CR16","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1109\/43.149770","volume":"11","author":"T. -C. Wang","year":"1992","unstructured":"T. -C. Wang and D. F. Wong, Optimal floorplan area optimization,IEEE Trans. Computer-Aided Design,11 (1992), 992\u20131002.","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"BF01940881_CR17","first-page":"309","volume-title":"Algorithmic Aspects of VLSI Layout","author":"T. -C. Wang","year":"1992","unstructured":"T. -C. Wang and D. F. Wong, A note on the complexity of Stockmeyer's floorplan optimization technique, inAlgorithmic Aspects of VLSI Layout (edited by M. Sarrafzadeh and D. T. Lee), World Scientific, Singapore, 1992, pp. 309\u2013320."},{"key":"BF01940881_CR18","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/43.21832","volume":"8","author":"S. Wimer","year":"1989","unstructured":"S. Wimer, I. Koren, and I. Cederbaum, Optimal aspect ratios of building blocks in VLSI,IEEE Trans. Computer-Aided Design,8 (1989), 139\u2013145.","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"BF01940881_CR19","doi-asserted-by":"crossref","unstructured":"D. F. Wong and P. S. Sakhamuri, Efficient floorplan area optimization,Proc. 26th ACM\/IEEE Design Automation Conf., 1989, pp. 586\u2013589.","DOI":"10.1145\/74382.74481"},{"key":"BF01940881_CR20","doi-asserted-by":"crossref","unstructured":"K. H. Yeap and M. Sarrafzadeh, An integrated algorithm for optimal floorplan sizing and enumeration,European Design Automation Conf., 1993, pp. 29\u201333.","DOI":"10.1109\/EDAC.1993.386505"},{"key":"BF01940881_CR21","doi-asserted-by":"crossref","unstructured":"G. Zimmermann, A new area and shape function estimation technique for VLSI layouts,Proc. 25th ACM\/IEEE Design Automation Conf., 1988, pp. 60\u201365.","DOI":"10.1109\/DAC.1988.14735"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01940881.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01940881\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01940881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T11:08:59Z","timestamp":1586344139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01940881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["BF01940881"],"URL":"https:\/\/doi.org\/10.1007\/bf01940881","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}