{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:21:48Z","timestamp":1761862908820},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,4,24]],"date-time":"2010-04-24T00:00:00Z","timestamp":1272067200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9324-8","type":"journal-article","created":{"date-parts":[[2010,4,23]],"date-time":"2010-04-23T11:16:42Z","timestamp":1272021402000},"page":"726-746","source":"Crossref","is-referenced-by-count":8,"title":["Improved floor-planning of graphs via\u00a0adjacency-preserving transformations"],"prefix":"10.1007","volume":"22","author":[{"given":"Huaming","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Sadish","family":"Sadasivam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,24]]},"reference":[{"key":"9324_CR1","volume-title":"Graph drawing: algorithms for the visualization of graphs","author":"GD Battista","year":"1998","unstructured":"Battista GD, Eades P, Tamassia R, Tollis I (1998) Graph drawing: algorithms for the visualization of graphs. Prentice Hall, New York"},{"key":"9324_CR2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/net.3230170306","volume":"17","author":"J Bhasker","year":"1987","unstructured":"Bhasker J, Sahni S (1987) A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph. Networks 17:307\u2013317","journal-title":"Networks"},{"key":"9324_CR3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01762117","volume":"3","author":"J Bhasker","year":"1988","unstructured":"Bhasker J, Sahni S (1988) A linear algorithm to find for a rectangular dual of planar triangulated graph. Algorithmica 3:247\u2013278","journal-title":"Algorithmica"},{"key":"9324_CR4","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1007\/3-540-45465-9_89","volume-title":"Proceedings 29th international colloquium on automata, languages and programming","author":"N Bonichon","year":"2002","unstructured":"Bonichon N, Sa\u00ebc BL, Mosbah M (2002) Wagner\u2019s theorem on realizers. In: Proceedings 29th international colloquium on automata, languages and programming. Lecture notes in computer science, vol 2380. Springer, Berlin, pp 1043\u20131053"},{"key":"9324_CR5","unstructured":"Brehm E (2000) 3-orientations and Schnyder 3-tree-decompositions: construction and order structure. Diploma thesis, FB Mathemtik und Informatik, Freie Universit\u00e4t. Berlin,"},{"key":"9324_CR6","series-title":"Lecture notes in computer science","first-page":"177","volume-title":"Proceedings of 13th international symposium on graph drawing","author":"\u00c9 Fusy","year":"2005","unstructured":"Fusy \u00c9 (2005) Transversal structures on triangulations, with application to straight-line drawing. In: Proceedings of 13th international symposium on graph drawing. Lecture notes in computer science, vol\u00a03843. Springer, Berlin, pp 177\u2013188"},{"key":"9324_CR7","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1137\/0222072","volume":"22","author":"X He","year":"1993","unstructured":"He X (1993) On finding the rectangular duals of planar triangular graphs. SIAM J Comput 22:1218\u20131226","journal-title":"SIAM J Comput"},{"key":"9324_CR8","doi-asserted-by":"crossref","first-page":"2150","DOI":"10.1137\/S0097539796308874","volume":"28","author":"X He","year":"1999","unstructured":"He X (1999) On floor-plan of plane graphs. SIAM J Comput 28:2150\u20132167","journal-title":"SIAM J Comput"},{"key":"9324_CR9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"15","author":"K Ko\u017ami\u0144ski","year":"1985","unstructured":"Ko\u017ami\u0144ski K, Kinnen E (1985) Rectangular dual of planar graphs. Networks 15:145\u2013157","journal-title":"Networks"},{"key":"9324_CR10","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1109\/31.14464","volume":"35","author":"K Ko\u017ami\u0144ski","year":"1988","unstructured":"Ko\u017ami\u0144ski K, Kinnen E (1988) Rectangular dualization and rectangular dissection. IEEE Trans Circuits Syst 35:1401\u20131416","journal-title":"IEEE Trans Circuits Syst"},{"key":"9324_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0020-0190(02)00490-8","volume":"86","author":"M Kurowski","year":"2003","unstructured":"Kurowski M (2003) Simple and efficient floor-planning. Inf Process Lett 86:113\u2013119","journal-title":"Inf Process Lett"},{"key":"9324_CR12","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF01840399","volume":"5","author":"YT Lai","year":"1990","unstructured":"Lai YT, Leinwand SM (1990) A theory of rectangular dual graphs. Algorithmica 5:467\u2013483","journal-title":"Algorithmica"},{"key":"9324_CR13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0196-6774(03)00057-9","volume":"48","author":"CC Liao","year":"2003","unstructured":"Liao CC, Lu HI, Yen HC (2003) Compact floor-planning via orderly spanning trees. J\u00a0Algorithms 48:441\u2013451","journal-title":"J\u00a0Algorithms"},{"key":"9324_CR14","unstructured":"Mailing K, Mueller SH, Heller WR (1982) On finding most optimal rectangular package planes. In: Proceedings of the 19th annual IEEE design automation conference, pp\u00a0263\u2013270"},{"key":"9324_CR15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W Schnyder","year":"1989","unstructured":"Schnyder W (1989) Planar graphs and poset dimension. Order 5:323\u2013343","journal-title":"Order"},{"key":"9324_CR16","unstructured":"Schnyder W (1990) Embedding planar graphs on the grid. In: Proceedings of the first annual ACM-SIAM symposium on discrete algorithms, pp\u00a0138\u2013148"},{"key":"9324_CR17","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF01891831","volume":"10","author":"Y Sun","year":"1993","unstructured":"Sun Y, Sarrafzadeh M (1993) Floor-planning by graph dualization: L-shaped models. Algorithmica 10:429\u2013456","journal-title":"Algorithmica"},{"key":"9324_CR18","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1137\/0222035","volume":"22","author":"KH Yeap","year":"1993","unstructured":"Yeap KH, Sarrafzadeh M (1993) Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM J Comput 22:500\u2013526","journal-title":"SIAM J Comput"},{"key":"9324_CR19","series-title":"Lecture notes in computer science","first-page":"213","volume-title":"Proceedings of 15th international symposium on graph drawing","author":"H Zhang","year":"2007","unstructured":"Zhang H, Sadasivam S (2007) On planar polyline drawings. In: Proceedings of 15th international symposium on graph drawing. Lecture notes in computer science, vol 4875. Springer, Berlin, pp 213\u2013218"},{"key":"9324_CR20","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s00453-008-9215-x","volume":"57","author":"H Zhang","year":"2010","unstructured":"Zhang H (2010) Planar polyline drawings via graph transformations. Algorithmica 57:381\u2013397","journal-title":"Algorithmica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9324-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9324-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9324-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:14Z","timestamp":1559262194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9324-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,24]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9324"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9324-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,24]]}}}