{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:44Z","timestamp":1725500744302},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_31","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T11:36:53Z","timestamp":1358768213000},"page":"334-345","source":"Crossref","is-referenced-by-count":1,"title":["Box-Rectangular Drawings of Planar Graphs"],"prefix":"10.1007","author":[{"given":"Md. Manzurul","family":"Hasan","sequence":"first","affiliation":[]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[]},{"given":"Md. Rezaul","family":"Karim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-61422-2_143","volume-title":"Algorithm Theory - SWAT \u201996","author":"T.C. Biedl","year":"1996","unstructured":"Biedl, T.C.: Optimal Orthogonal Drawings of Triconnected Plane Graphs. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol.\u00a01097, pp. 333\u2013344. Springer, Heidelberg (1996)"},{"issue":"1","key":"31_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1328911.1328919","volume":"4","author":"A.L. Buchbaum","year":"2008","unstructured":"Buchbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Transactions on Algorithms 4(1), 8.1\u20138.28 (2008)","journal-title":"ACM Transactions on Algorithms"},{"key":"31_CR3","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Englewood Cliffs (1999)"},{"issue":"1","key":"31_CR4","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/jagm.2001.1161","volume":"40","author":"X. He","year":"2001","unstructured":"He, X.: A simple linear time algorithm for proper box rectangular drawings of plane graphs. Journal of Algorithms\u00a040(1), 82\u2013101 (2001)","journal-title":"Journal of Algorithms"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica\u00a016, 4\u201332 (1996)","journal-title":"Algorithmica"},{"key":"31_CR6","first-page":"279","volume":"524","author":"S. Munemoto","year":"2000","unstructured":"Munemoto, S., Katoh, N., Imamura, G.: Finding an optimal floor layout based on an orthogonal graph drawing algorithm. Journal of Architecture, Planning and Environmental Engineering (Transactions of AIJ)\u00a0524, 279\u2013286 (2000)","journal-title":"Journal of Architecture, Planning and Environmental Engineering (Transactions of AIJ)"},{"key":"31_CR7","doi-asserted-by":"crossref","DOI":"10.1142\/5648","volume-title":"Planar Graph Drawing","author":"T. Nishizeki","year":"2004","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1006\/jagm.2000.1105","volume":"37","author":"M.S. Rahman","year":"2000","unstructured":"Rahman, M.S., Nakano, S., Nishizeki, T.: Box-rectangular drawings of plane graphs. Journal of Algorithms\u00a037, 363\u2013398 (2000)","journal-title":"Journal of Algorithms"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/S0196-6774(03)00126-3","volume":"50","author":"M.S. Rahman","year":"2004","unstructured":"Rahman, M.S., Nishizeki, T., Ghosh, S.: Rectangular drawings of planar graphs. Journal of Algorithms\u00a050, 62\u201378 (2004)","journal-title":"Journal of Algorithms"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0020-0190(91)90059-Q","volume":"39","author":"R. Tamassia","year":"1991","unstructured":"Tamassia, R., Tollis, I.G., Vitter, J.S.: Lower bounds for planar orthogonal drawings of graphs. Information Processing Letters\u00a039, 35\u201340 (1991)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:35:02Z","timestamp":1620120902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}