{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T15:47:26Z","timestamp":1748015246022},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0925-7721(01)00061-x","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T19:00:31Z","timestamp":1034276431000},"page":"121-138","source":"Crossref","is-referenced-by-count":15,"title":["Rectangular drawings of plane graphs without designated corners"],"prefix":"10.1016","volume":"21","author":[{"given":"Md.Saidur","family":"Rahman","sequence":"first","affiliation":[]},{"given":"Shin-ichi","family":"Nakano","sequence":"additional","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00061-X_BIB001","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\/S0925-7721(01)00061-X_BIB002","series-title":"Graph Drawing","author":"Di Battista","year":"1999"},{"issue":"6","key":"10.1016\/S0925-7721(01)00061-X_BIB003","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1137\/0222072","article-title":"On finding the rectangular duals of planar triangulated graphs","volume":"22","author":"He","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(01)00061-X_BIB004","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/BF01189069","article-title":"An efficient parallel algorithm for finding rectangular duals of plane triangulated graphs","volume":"13","author":"He","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00061-X_BIB005","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."},{"key":"10.1016\/S0925-7721(01)00061-X_BIB006","series-title":"Proc. 21st DAC, Albuquerque","first-page":"655","article-title":"An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits","author":"Kozminski","year":"1984"},{"key":"10.1016\/S0925-7721(01)00061-X_BIB007","series-title":"Combinatirial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"key":"10.1016\/S0925-7721(01)00061-X_BIB008","first-page":"279","article-title":"Finding an optimal floor layout based on an orthogonal graph drawing algorithm","volume":"524","author":"Munemoto","year":"2000","journal-title":"J. Arch. Plann. Envi. Engg."},{"issue":"3","key":"10.1016\/S0925-7721(01)00061-X_BIB009","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0925-7721(98)00003-0","article-title":"Rectangular grid drawings of plane graphs","volume":"10","author":"Rahman","year":"1998","journal-title":"Computational Geometry"},{"issue":"4","key":"10.1016\/S0925-7721(01)00061-X_BIB010","doi-asserted-by":"crossref","first-page":"31","DOI":"10.7155\/jgaa.00017","article-title":"A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs","volume":"3","author":"Rahman","year":"1999","journal-title":"J. Graph Alg. Appl."},{"key":"10.1016\/S0925-7721(01)00061-X_BIB011","series-title":"Proc. COCOON2000","first-page":"85","article-title":"Rectangular drawings of plane graphs without designated corners (Extended abstract)","volume":"1858","author":"Rahman","year":"2000"},{"key":"10.1016\/S0925-7721(01)00061-X_BIB012","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1006\/jagm.2000.1105","article-title":"Box-rectangular drawings of plane graphs","volume":"37","author":"Rahman","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/S0925-7721(01)00061-X_BIB013","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01582878","article-title":"On area-efficent drawings of rectangular duals for VLSI floor-plan","volume":"52","author":"Tani","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/S0925-7721(01)00061-X_BIB014","series-title":"Progress in Graph Theory","first-page":"43","article-title":"Plane representations of graphs","author":"Thomassen","year":"1984"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S092577210100061X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S092577210100061X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:26:06Z","timestamp":1556670366000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S092577210100061X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S092577210100061X"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00061-x","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}