{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:59:25Z","timestamp":1773194365903,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0196-6774(03)00057-9","type":"journal-article","created":{"date-parts":[[2003,6,20]],"date-time":"2003-06-20T20:09:47Z","timestamp":1056139787000},"page":"441-451","source":"Crossref","is-referenced-by-count":42,"title":["Compact floor-planning via orderly spanning trees"],"prefix":"10.1016","volume":"48","author":[{"given":"Chien-Chih","family":"Liao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsueh-I","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0196-6774(03)00057-9_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 a planar triangulated graph","volume":"17","author":"Bhasker","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0196-6774(03)00057-9_BIB002","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01762117","article-title":"A linear algorithm to find a rectangular dual of a planar triangulated graph","volume":"3","author":"Bhasker","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0196-6774(03)00057-9_BIB003","doi-asserted-by":"crossref","unstructured":"N. Bonichon, B. Le Sa\u00ebc, M. Mosbah, Orthogonal drawings based on the stratification of planar graphs, Technical Report RR-1246-00, Laboratoire Bordelais de Recherche en Informatique (LaBRI), 2000, presented at the 6th International Conference on Graph Theory, Marseille, France, August 28\u2013September 1, 2000","DOI":"10.1016\/S1571-0653(05)80118-0"},{"key":"10.1016\/S0196-6774(03)00057-9_BIB004","series-title":"Proceedings of the 12th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Washington, DC, USA, 7\u20139 January","first-page":"506","article-title":"Orderly spanning trees with applications to graph encoding and graph drawing","author":"Chiang","year":"2001"},{"key":"10.1016\/S0196-6774(03)00057-9_BIB005","series-title":"Proceedings of the 25th International Colloquium on Automata, Languages, and Programming, Aalborg, Denmark","first-page":"118","article-title":"Compact encodings of planar graphs via canonical ordering and multiple parentheses","volume":"1443","author":"Chuang","year":"1998"},{"key":"10.1016\/S0196-6774(03)00057-9_BIB006","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1017\/S0963548300001139","article-title":"On triangle contact graphs","volume":"3","author":"de Fraysseix","year":"1994","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0196-6774(03)00057-9_BIB007","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","article-title":"How to draw a planar graph on a grid","volume":"10","author":"de Fraysseix","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/S0196-6774(03)00057-9_BIB008","series-title":"Proceedings of the 4th International Symposium on Graph Drawing, CA, USA","first-page":"155","article-title":"2-visibility drawings of planar graphs","volume":"1190","author":"F\u00f6\u00dfmeier","year":"1996"},{"key":"10.1016\/S0196-6774(03)00057-9_BIB009","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1137\/0222072","article-title":"On finding the rectangular duals of planar triangular graphs","volume":"22","author":"He","year":"1993","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/S0196-6774(03)00057-9_BIB010","doi-asserted-by":"crossref","first-page":"2150","DOI":"10.1137\/S0097539796308874","article-title":"On floor-plan of plane graphs","volume":"28","author":"He","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(03)00057-9_BIB011","series-title":"Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, 30 October\u20131 November","first-page":"549","article-title":"Space-efficient static trees and graphs","author":"Jacobson","year":"1989"},{"issue":"1","key":"10.1016\/S0196-6774(03)00057-9_BIB012","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/BF02086606","article-title":"Drawing planar graphs using the canonical ordering","volume":"16","author":"Kant","year":"1996","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"10.1016\/S0196-6774(03)00057-9_BIB013","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","article-title":"Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems","volume":"172","author":"Kant","year":"1997","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0196-6774(03)00057-9_BIB014","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230150202","article-title":"Rectangular duals of planar graphs","volume":"15","author":"K\u00f3zmi\u0144ski","year":"1985","journal-title":"Networks"},{"issue":"11","key":"10.1016\/S0196-6774(03)00057-9_BIB015","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1109\/31.14464","article-title":"Rectangular dualization and rectangular dissections","volume":"35","author":"K\u00f3zmi\u0144ski","year":"1988","journal-title":"IEEE Trans. Circuits Systems"},{"issue":"4","key":"10.1016\/S0196-6774(03)00057-9_BIB016","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"},{"key":"10.1016\/S0196-6774(03)00057-9_BIB017","series-title":"Proceedings of the 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\/S0196-6774(03)00057-9_BIB018","series-title":"Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, 20\u201322 October","first-page":"118","article-title":"Succinct representation of balanced parentheses, static trees and planar graphs","author":"Munro","year":"1997"},{"key":"10.1016\/S0196-6774(03)00057-9_BIB019","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF00353652","article-title":"Planar graphs and poset dimension","volume":"5","author":"Schnyder","year":"1989","journal-title":"Order"},{"key":"10.1016\/S0196-6774(03)00057-9_BIB020","series-title":"Proceedings of the First Annual ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"138","article-title":"Embedding planar graphs on the grid","author":"Schnyder","year":"1990"},{"issue":"6","key":"10.1016\/S0196-6774(03)00057-9_BIB021","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF01891831","article-title":"Floor-planning by graph dualization: L-shaped modules","volume":"10","author":"Sun","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0196-6774(03)00057-9_BIB022","series-title":"Proceedings of the IEEE International Symposium on Circuits and Systems","first-page":"321","article-title":"An algorithm to eliminate all complex triangles in a maximal planar graph for use in VLSI floorplan","author":"Tsukiyama","year":"1986"},{"issue":"3","key":"10.1016\/S0196-6774(03)00057-9_BIB023","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."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000579?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000579?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T02:24:35Z","timestamp":1553048675000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677403000579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0196677403000579"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(03)00057-9","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}