{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:47Z","timestamp":1725663287221},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540505174"},{"type":"electronic","value":"9783540460305"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50517-2_73","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:27:19Z","timestamp":1330201639000},"page":"88-107","source":"Crossref","is-referenced-by-count":6,"title":["Inherent nonslicibility of rectangular duals in VLSI floorplanning"],"prefix":"10.1007","author":[{"given":"Susmita","family":"Sur-Kolay","sequence":"first","affiliation":[]},{"given":"Bhargab B.","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Bhasker, J. & S. Sahni, \"A Linear Algorithm to find a Rectangular Dual of a Planar Triangulated Graph,\" Proc. 23rd Design Automation Conference, June 1986, pp. 108\u2013114.","DOI":"10.1145\/318013.318031"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/net.3230170306","volume":"17","author":"J. Bhasker","year":"1987","unstructured":"Bhasker, J. & S. Sahni, \"A Linear Time Algorithm to Check for the Existence of a Rectangular Dual of a Planar Triangulated Graph,\" Networks, Vol. 17, 1987, pp. 307\u2013317.","journal-title":"Networks"},{"key":"7_CR3","unstructured":"Dai, W.M. & E.S. Kuh, \"Hierarchical Floor Planning for Building Block Layout,\" Proc. ICCAD, 1986, pp.454\u2013457."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Harary, F., Graph Theory, Addison-Wesley Publishing Co., Reading, 1969.","DOI":"10.21236\/AD0705364"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Heller, W. R., G. Sorkin & K. Maling, \"The Planar Package Planner for System Designers,\" Proc. 19th Design Automation Conference, 1982, pp.253\u2013260.","DOI":"10.1109\/DAC.1982.1585509"},{"key":"7_CR6","unstructured":"Hu, T.C., & E.S. Kuh, \"Theory and Concepts of Circuit Layout,\" Theory and Design of VLSI Layout, IEEE Press, 1986, pp. 3\u201318."},{"key":"7_CR7","unstructured":"Garey, M. R. & D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman & Co., 1979."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Kozminski, K. & E. Kinnen, \"An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits,\" Proc. 21st Design Automation Conference, June 1984, pp. 655\u2013656.","DOI":"10.1109\/DAC.1984.1585872"},{"issue":"2","key":"7_CR9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"15","author":"K. Kozminski","year":"1985","unstructured":"Kozminski, K. & E. Kinnen, \"Rectangular Dual of Planar Graphs,\" Networks, Vol. 15, No. 2, 1985, pp. 145\u2013157.","journal-title":"Networks"},{"key":"7_CR10","unstructured":"LaPaugh, A.S., \"Algorithms for Integrated Circuit Layout: An Analytic Approach,\" Ph.D. Thesis, M.I.T., 1980."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Leinwand, S. M., & Y.T. Lai, \"An Algorithm for building Rectangular Floor-plans,\" Proc. 21st Design Automation Conference, 1984, pp. 663\u2013664.","DOI":"10.1109\/DAC.1984.1585874"},{"issue":"6","key":"7_CR12","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1109\/TC.1987.1676967","volume":"C-36","author":"W. K. Luk","year":"1987","unstructured":"Luk, W. K., P. Sipala & C.K. Wong, \"Minimum-area Wiring for Slicing Structures,\" IEEE Trans. on Computers, Vol. C-36, No.6, June 1987, pp. 745\u2013760.","journal-title":"IEEE Trans. on Computers"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Otten, R.H.J.M., \"Automatic Floorplan Design,\" Proc. 19th Design Automation Conference, 1982, pp. 261\u2013267.","DOI":"10.1109\/DAC.1982.1585510"},{"key":"7_CR14","unstructured":"Otten, R.H.J.M., \"Layout Structures,\" Proc. Large Scale Systems Symp. (IEEE), 1982, pp. 349\u2013353."},{"key":"7_CR15","unstructured":"Otten, R.H.J.M., \"Efficient Floorplan Optimization,\" Proc. ICCD, 1983, pp. 499\u2013502."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Ousterhout, J., G. Hamachi, R. Mayo, W.Scott & G. Taylor, \"The MAGIC VLSI Layout System,\" IEEE Design and Test, Feb. 1985.","DOI":"10.1109\/DAC.1984.1585789"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., \"The PI (Placement and Interconnect) System,\" Proc. 19th Design Automation Conference, June 1982, pp. 475\u2013481.","DOI":"10.1109\/DAC.1982.1585541"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(83)80038-2","volume":"57","author":"L.J. Stockmeyer","year":"1983","unstructured":"Stockmeyer, L.J., \"Optimal Orientations of Cells in Slicing Floorplan designs,\" Information and Control, Vol. 57, 1983, pp. 91\u2013101.","journal-title":"Information and Control"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Supowit, K.J. & E.F. Slutz, \"Placement Algorithms for Custom VLSI,\" Proc. 20th Design Automation Conference, June 1983, pp. 164\u2013170.","DOI":"10.1109\/DAC.1983.1585643"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Tsukiyama, S., K. Koike & I. Shirakawa, \"An Algorithm to eliminate All Complex Triangles in a Maximal Planar Graph for use in VLSI Floor-plan,\" Proc. Intl. Symposium on Circuits and Systems (IEEE), 1986, pp.321\u2013324.","DOI":"10.1142\/9789812794468_0011"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Wong, D.F. & C.L. Liu, \"A New Algorithm for Floorplan Design,\" Proc. 23rd Design Automation Conference, June 1986, pp. 101\u2013107.","DOI":"10.1109\/DAC.1986.1586075"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50517-2_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:19Z","timestamp":1605647899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50517-2_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540505174","9783540460305"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-50517-2_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}