{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:14:03Z","timestamp":1760440443140},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":[[1993,12]]},"DOI":"10.1007\/bf01891831","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T07:18:01Z","timestamp":1120547881000},"page":"429-456","source":"Crossref","is-referenced-by-count":22,"title":["Floorplanning by graph dualization: L-shaped modules"],"prefix":"10.1007","volume":"10","author":[{"given":"Yachyang","family":"Sun","sequence":"first","affiliation":[]},{"given":"Majid","family":"Sarrafzadeh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01891831_CR1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/net.3230170306","volume":"17","author":"J. Bhasker","year":"1987","unstructured":"Bhasker, J., and Sahni, S., A Linear Time Algorithm To Check for the Existence of a Rectangular Dual of a Planar Triangulated Graph,Networks, Vol. 17, pp. 307\u2013317, 1987.","journal-title":"Networks"},{"key":"BF01891831_CR2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01762117","volume":"3","author":"J. Bhasker","year":"1988","unstructured":"Bhasker, J., and Sahni, S., A Linear Algorithm To Find a Rectangular Dual of a Planar Triangulated Graph,Algorithmica, Vol. 3, pp. 247\u2013278, 1988.","journal-title":"Algorithmica"},{"issue":"No. 1","key":"BF01891831_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/jgt.3190030108","volume":"3","author":"S. L. Hakimi","year":"1979","unstructured":"Hakimi, S. L., and Schmeichel, E. F., On the Number of Cycles of LengthK in a Maximal Planar Graph,Journal of Graph Theory, Vol. 3, No. 1, pp. 69\u201386, 1979.","journal-title":"Journal of Graph Theory"},{"key":"BF01891831_CR4","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.,Graph Theory, Addison-Wesley, Reading, MA, 1969."},{"issue":"No. 4","key":"BF01891831_CR5","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., and Rodeh, M., Finding a Minimum Circuit in a Graph,SIAM Journal of Computing, Vol. 7, No. 4, pp. 413\u2013423, 1978.","journal-title":"SIAM Journal of Computing"},{"key":"BF01891831_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"15","author":"K. Kozminiski","year":"1985","unstructured":"Kozminiski, K., and Kinnen, E., Rectangular Dual of Planar Graphs,Networks, Vol. 15, pp. 145\u2013157, January 1985.","journal-title":"Networks"},{"issue":"No. 11","key":"BF01891831_CR7","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1109\/31.14464","volume":"35","author":"K. Kozminski","year":"1988","unstructured":"Kozminski, K., and Kinnen, E., Rectangular Dualization and Rectangular Dissections,IEEE Transactions on Circuits and Systems, Vol. 35, No. 11, pp. 1401\u20131416, November 1988.","journal-title":"IEEE Transactions on Circuits and Systems"},{"issue":"No. 12","key":"BF01891831_CR8","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1109\/43.16806","volume":"7","author":"Y. T. Lai","year":"1988","unstructured":"Lai, Y. T., and Leinwand, S. M., Algorithms for Floorplan Design via Rectangular Dualization,IEEE Transactions on Computer-Aided Design, Vol. 7, No. 12, pp. 1278\u20131289, December 1988.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"BF01891831_CR9","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TEC.1961.5219222","volume":"10","author":"C. Y. Lee","year":"1961","unstructured":"Lee, C. Y., An Algorithm for Path Connections and Its Applications,IRE Transactions on Electronic Computers, Vol. 10, pp. 346\u2013365, September 1961.","journal-title":"IRE Transactions on Electronic Computers"},{"key":"BF01891831_CR10","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/cta.4490160405","volume":"16","author":"R. H. J. M. Otten","year":"1988","unstructured":"Otten, R. H. J. M., Graphs in Floor-Plan Design,International Journal of Circuit Theory and Applications, Vol. 16, pp. 391\u2013410, 1988.","journal-title":"International Journal of Circuit Theory and Applications"},{"key":"BF01891831_CR11","first-page":"87","volume-title":"Physical Design Automation of VLSI Systems","author":"B. T. Preas","year":"1988","unstructured":"Preas, B. T., and Karger, P. G., Placement, Assignment and Floorplanning,Physical Design Automation of VLSI Systems, ed. by Preas, B. T., and Lorenzetti, M. J., Benjamin\/Cummings, Menlo Park, CA, pp. 87\u2013155, 1988."},{"key":"BF01891831_CR12","doi-asserted-by":"crossref","unstructured":"Tsukiyama, S., Koike, K., and Shirakawa, I., An Algorithm To Eliminate All Complex Triangles in a Maximal Planar Graph for Use in VLSI Floor-Plan,Proceedings of the International Symposium on Circuits and Systems, Philadelphia, PA, pp. 321\u2013324, 1986.","DOI":"10.1142\/9789812794468_0011"},{"issue":"No. 2","key":"BF01891831_CR13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01553890","volume":"4","author":"D. F. Wong","year":"1989","unstructured":"Wong, D. F., and Liu, C. L., Floorplan Design of VLSI Circuits,Algorithmica, Vol. 4, No. 2, pp. 263\u2013291, 1989.","journal-title":"Algorithmica"},{"key":"BF01891831_CR14","unstructured":"Yeap, K. H., and Sarrafzadeh, M., Rectangular Dualization: 2-Bend Shapes Suffice,Proceedings of the 29th Allerton Conference, Montincello, IL, pp. 79\u201385, October 1991."},{"key":"BF01891831_CR15","unstructured":"Yeap, K. H., and Sarrafzadeh, M., Sliceable Floorplans by Dualization,Second Great Lakes Computer Science Symposium, Kalamazoo, MI, pp. 41\u201347, November 1991."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01891831.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01891831\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01891831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T04:22:19Z","timestamp":1586319739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01891831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF01891831"],"URL":"https:\/\/doi.org\/10.1007\/bf01891831","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}