{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T19:40:24Z","timestamp":1729194024578,"version":"3.27.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10878-024-01217-8","type":"journal-article","created":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T17:01:33Z","timestamp":1728320493000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction of floorplans for plane graphs over polygonal boundaries"],"prefix":"10.1007","volume":"48","author":[{"given":"Rohit","family":"Lohani","sequence":"first","affiliation":[]},{"given":"Krishnendra","family":"Shekhawat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,7]]},"reference":[{"issue":"3","key":"1217_CR1","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/s00453-011-9525-2","volume":"63","author":"Christian A Duncan","year":"2012","unstructured":"Duncan Christian A, Gansner Emden R, Hu YF (2012) Optimal polygonal representation of planar graphs. Algorithmica 63(3):672\u2013691","journal-title":"Algorithmica"},{"issue":"11","key":"1217_CR2","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1109\/31.14464","volume":"35","author":"Krzysztof Kozminski","year":"1988","unstructured":"Kozminski Krzysztof, Kinnen Edwin (1988) Rectangular dualization and rectangular dissections. IEEE Trans Circuits Syst 35(11):1401\u20131416","journal-title":"IEEE Trans Circuits Syst"},{"issue":"3","key":"1217_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/net.3230170306","volume":"17","author":"Jayaram Bhasker","year":"1987","unstructured":"Bhasker Jayaram, Sahni Sartaj (1987) A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph. Networks 17(3):307\u2013317","journal-title":"Networks"},{"issue":"6","key":"1217_CR4","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1137\/0222072","volume":"22","author":"Xin He","year":"1993","unstructured":"He Xin (1993) On finding the rectangular duals of planar triangular graphs. SIAM J Comput 22(6):1218\u20131226","journal-title":"SIAM J Comput"},{"issue":"3","key":"1217_CR5","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/s00454-013-9521-1","volume":"50","author":"Alam Md Jawaherul","year":"2013","unstructured":"Jawaherul Alam Md, Therese Biedl, Stefan Felsner, Michael Kaufmann, Kobourov Stephen G, Torsten Ueckerdt (2013) Computing cartograms with optimal complexity. Discr Comput Geo 50(3):784\u2013810","journal-title":"Discr Comput Geo"},{"key":"1217_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"Hubert de Fraysseix","year":"1990","unstructured":"de Fraysseix Hubert, Pach J\u00e1nos, Pollack Richard (1990) How to draw a planar graph on a grid. Combinatorica 10:41\u201351","journal-title":"Combinatorica"},{"issue":"3","key":"1217_CR7","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1017\/S0004972700027118","volume":"37","author":"Ingrid Rinsma","year":"1988","unstructured":"Rinsma Ingrid (1988) Existence theorems for floorplans. Bull Aust Math Soc 37(3):473\u2013475","journal-title":"Bull Aust Math Soc"},{"key":"1217_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"15","author":"Krzysztof Kozminski","year":"1985","unstructured":"Kozminski Krzysztof, Kinnen Edwin (1985) Rectangular duals of planar graphs. Networks 15:145\u2013157","journal-title":"Networks"},{"issue":"2","key":"1217_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01762117","volume":"3","author":"Jayaram Bhasker","year":"1988","unstructured":"Bhasker Jayaram, Sahni Sartaj (1988) A linear algorithm to find a rectangular dual of a planar triangulated graph. Algorithmica 3(2):247\u2013278","journal-title":"Algorithmica"},{"key":"1217_CR10","doi-asserted-by":"publisher","first-page":"2857","DOI":"10.1109\/ISCAS.1990.112606","volume":"4","author":"Hui Tang","year":"1990","unstructured":"Tang Hui, Chen Wai-Kai (1990) Generation of rectangular duals of a planar triangulated graph by elementary transformations. IEEE Int Sym Cir Syst 4:2857\u20132860","journal-title":"IEEE Int Sym Cir Syst"},{"key":"1217_CR11","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1137\/0222072","volume":"22","author":"Xin He","year":"1993","unstructured":"He Xin (1993) On finding the rectangular duals of planar triangular graphs. SIAM J Comput 22:1218\u20131226","journal-title":"SIAM J Comput"},{"key":"1217_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.autcon.2018.03.037","volume":"92","author":"Krishnendra Shekhawat","year":"2018","unstructured":"Shekhawat Krishnendra (2018) Enumerating generic rectangular floor plans. Autom Constr 92:151\u2013165","journal-title":"Autom Constr"},{"key":"1217_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.autcon.2020.103149","volume":"113","author":"Nitant Upasani","year":"2020","unstructured":"Upasani Nitant, Shekhawat Krishnendra, Sachdeva Garv (2020) Automated generation of dimensioned rectangular floorplans. Autom Constr 113:103\u2013149","journal-title":"Autom Constr"},{"key":"1217_CR14","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.tcs.2021.04.014","volume":"871","author":"Vinod Kumar","year":"2021","unstructured":"Kumar Vinod, Shekhawat Krishnendra (2021) A transformation algorithm to construct a rectangular floorplan. Theoret Comput Sci 871:94\u2013106","journal-title":"Theoret Comput Sci"},{"key":"1217_CR15","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/BF01891831","volume":"10","author":"Yachyang Sun","year":"1990","unstructured":"Sun Yachyang, Sarrafzadeh Majid (1990) Floorplanning by graph dualization: L-shaped modules. Algorithmica 10:429\u2013456","journal-title":"Algorithmica"},{"issue":"3","key":"1217_CR16","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0222035","volume":"22","author":"Kok-Hoo Yeap","year":"1993","unstructured":"Yeap Kok-Hoo, Sarrafzadeh Majid (1993) Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM J Comput 22(3):500\u2013526","journal-title":"SIAM J Comput"},{"issue":"6","key":"1217_CR17","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1137\/S0097539796308874","volume":"28","author":"Xin He","year":"1999","unstructured":"He Xin (1999) On floor-plan of plane graphs. SIAM J Comput 28(6):2150\u20132167","journal-title":"SIAM J Comput"},{"key":"1217_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0196-6774(03)00057-9","volume":"48","author":"Chien-Chih Liao","year":"2003","unstructured":"Liao Chien-Chih, Hsueh-I Lu, Yen Hsu-Chun (2003) Compact floor-planning via orderly spanning trees. J Algorithms 48:441\u2013451","journal-title":"J Algorithms"},{"issue":"3","key":"1217_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0020-0190(02)00490-8","volume":"86","author":"Maciej Kurowski","year":"2003","unstructured":"Kurowski Maciej (2003) Simple and efficient floor-planning. Inf Process Lett 86(3):113\u2013119","journal-title":"Inf Process Lett"},{"issue":"4","key":"1217_CR20","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/s10878-010-9324-8","volume":"22","author":"Huaming Zhang","year":"2011","unstructured":"Zhang Huaming, Sadasivam Sadish (2011) Improved floor-planning of graphs via adjacency-preserving transformations. J Comb Optim 22(4):726\u2013746","journal-title":"J Comb Optim"},{"key":"1217_CR21","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s00170-010-2960-4","volume":"54","author":"Mohammad R Jokar","year":"2011","unstructured":"Jokar Mohammad R, Akbari Sangchooli Ali (2011) Constructing a block layout by face area. Int J Adv Manuf Technol 54:801\u2013809","journal-title":"Int J Adv Manuf Technol"},{"key":"1217_CR22","first-page":"701","volume":"16","author":"Alam Muhammad Jawaherul","year":"2011","unstructured":"Jawaherul Alam Muhammad, Biedl Therese C, Stefan Felsner, Michael Kaufmann, Kobourov Stephen G (2011) Proportional contact representations of planar graphs. J Graph Alg Appl 16:701\u2013728","journal-title":"J Graph Alg Appl"},{"issue":"1","key":"1217_CR23","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1068\/b150111","volume":"15","author":"Ingrid Rinsma","year":"1988","unstructured":"Rinsma Ingrid (1988) Rectangular and orthogonal floorplans with required room areas and tree adjacency. Environ Plann B Plann Des 15(1):111\u2013118","journal-title":"Environ Plann B Plann Des"},{"issue":"4","key":"1217_CR24","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"Marek Chrobak","year":"1995","unstructured":"Chrobak Marek, Payne Thomas H (1995) A linear-time algorithm for drawing a planar graph on a grid. Inf Process Lett 54(4):241\u2013246","journal-title":"Inf Process Lett"},{"key":"1217_CR25","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"John E Hopcroft","year":"1974","unstructured":"Hopcroft John E, Tarjan Robert E (1974) Efficient planarity testing. J ACM 21:549\u2013568","journal-title":"J ACM"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01217-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01217-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01217-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T19:10:25Z","timestamp":1729192225000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01217-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1217"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01217-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,10]]},"assertion":[{"value":"22 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflict of interest, financial or non-financial, directly or indirectly related to the work submitted for publication. No funds, grants, or other support were received during the preparation of this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"22"}}