{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:01Z","timestamp":1759638961789},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0020-0190(02)00490-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"113-119","source":"Crossref","is-referenced-by-count":5,"title":["Simple and efficient floor-planning"],"prefix":"10.1016","volume":"86","author":[{"given":"Maciej","family":"Kurowski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00490-8_BIB001","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/net.3230170306","article-title":"A linear algorithm to check for the existence of a rectangular dual of planar triangulated graph","volume":"17","author":"Bhasker","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(02)00490-8_BIB002","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01762117","article-title":"A linear algorithm to find for a rectangular dual of planar triangulated graph","volume":"3","author":"Bhasker","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(02)00490-8_BIB003","series-title":"Proceedings of the 9th International Symposium on Graph Drawing","article-title":"Floor-planning via orderly spanning trees","author":"Liao","year":"2001"},{"key":"10.1016\/S0020-0190(02)00490-8_BIB004","unstructured":"C.-C. Liao, H.-I Lu, H.-C. Yen, Personal communication"},{"key":"10.1016\/S0020-0190(02)00490-8_BIB005","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for drawing graphs: an annotated bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0020-0190(02)00490-8_BIB006","series-title":"Proc. 20th Annual ACM Sympos. Theory Comput.","first-page":"426","article-title":"Small sets supporting Fary embedding of planar graphs","author":"de Fraysseix","year":"1988"},{"key":"10.1016\/S0020-0190(02)00490-8_BIB007","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230150202","article-title":"Rectangular duals of planar graphs","volume":"15","author":"Kozminski","year":"1985","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(02)00490-8_BIB008","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1109\/31.14464","article-title":"Rectangular dualization and rectangular dissection","volume":"35","author":"Kozminski","year":"1988","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0020-0190(02)00490-8_BIB009","series-title":"Proc. 19th Annual IEEE Design Automation Conference","first-page":"263","article-title":"On finding most optimal rectangular package plans","author":"Mailing","year":"1982"},{"key":"10.1016\/S0020-0190(02)00490-8_BIB010","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF01840399","article-title":"A theory of rectangular dual graphs","volume":"5","author":"Lai","year":"1990","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/S0020-0190(02)00490-8_BIB011","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1137\/0222035","article-title":"Floor-planning by graph dualization: 2-concave rectilinear modules","volume":"22","author":"Yeap","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00490-8_BIB012","series-title":"Proc. IEEE International Symposium on Circuits and Systems","first-page":"2845","article-title":"Floor-planning by graph dualization: L-shaped models","author":"Sun","year":"1990"},{"key":"10.1016\/S0020-0190(02)00490-8_BIB013","series-title":"STOC Procedings","first-page":"426","article-title":"On floorplans of planar graphs","author":"He","year":"1997"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004908?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004908?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T17:29:31Z","timestamp":1553448571000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002004908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0020019002004908"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00490-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}