{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T01:01:43Z","timestamp":1767920503424,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540667315","type":"print"},{"value":"9783540467847","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_25","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T08:02:55Z","timestamp":1175760175000},"page":"250-261","source":"Crossref","is-referenced-by-count":1,"title":["Box-Rectangular Drawings of Plane Graphs"],"prefix":"10.1007","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":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"T. C. Biedl, Optimal orthogonal drawings of triconnected plane graphs, Proc. SWAT\u201996, Lect. Notes in Compute Science, Springer, 1097 (1996), pp. 333\u2013344.","DOI":"10.1007\/3-540-61422-2_143"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"T. C. Biedl and M. Kaufmann, Area-efficient static and incremental graph drawings, Proc. of 5th European Symposium on Algorithms, Lect. Notes in Computer Science, Springer, 1284 (1997), pp. 37\u201352.","DOI":"10.1007\/3-540-63397-9_4"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jpdc.1998.1495","volume":"55","author":"T. Calamoneri","year":"1998","unstructured":"T. Calamoneri and R. Petreschi, Orthogonally drawing cubic graphs in parallel, Journal of Parallel and Distributed Comp., 55 (1998), pp. 94\u2013108.","journal-title":"Journal of Parallel and Distributed Comp."},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista de","year":"1994","unstructured":"G. de Battista, P. Eades, R. Tamassia and I. G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Comp. Geom. Theory Appl., 4 (1994), pp. 235\u2013282.","journal-title":"Comp. Geom. Theory Appl."},{"key":"25_CR5","unstructured":"U. F\u00f6\u00dfmeier, G. Kant and M. Kaufmann, 2-visibility drawings of plane graphs, Proc. of Graph Drawing\u2019 96, Lect. Notes in Compute Science, Springer, 1190 (1997), pp. 155\u2013168."},{"key":"25_CR6","volume-title":"Facility Layout and Location","author":"R. L. Francis","year":"1974","unstructured":"R. L. Francis and J. A. White, Facility Layout and Location, Prentice-Hall, Inc, New Jersey, 1974."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica (1996) 16, pp. 4\u201332.","journal-title":"Algorithmica"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G. Kant","year":"1997","unstructured":"G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoretical Computer Science, 172 (1997), pp. 175\u2013193.","journal-title":"Theoretical Computer Science"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"K. Kozminski and E. Kinnen, An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits, Proc. of 21st DAC, (1984), pp. 655\u2013656.","DOI":"10.1109\/DAC.1984.1585872"},{"key":"25_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatirial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"T. Lengauer, Combinatirial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, 1990."},{"key":"25_CR11","volume-title":"The Four Color Problem","author":"O. Ore","year":"1967","unstructured":"O. Ore, The Four Color Problem, Academic press, New York, 1967."},{"key":"25_CR12","unstructured":"A. Papakostas and I. G. Tollis, Orthogonal drawings of high degree graphs with small area and few bends, Proc. of 5th Workshop on Algorithms and Data Structures, Lect. Notes in Computer Science, Springer, 1272 (1998), pp. 354\u2013367."},{"issue":"3","key":"25_CR13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0925-7721(98)00003-0","volume":"10","author":"M. S. Rahman","year":"1998","unstructured":"M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular grid drawings of plane graphs, Comp. Geom. Theo. Appl. 10 (3) (1998), pp. 203\u2013220.","journal-title":"Comp. Geom. Theo. Appl."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"M. S. Rahman, S. Nakano and T. Nishizeki, A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs, Proc. of Graph Drawing\u201997, Lect. Notes in Computer Science, Springer, 1353 (1998), pp. 99\u2013110. Also, Journal of Graph Alg. Appl., to appear.","DOI":"10.1007\/3-540-63938-1_54"},{"key":"25_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-2351-2","volume-title":"Algorithms for VLSI Physical Design Automation","author":"N. Sherwani","year":"1995","unstructured":"N. Sherwani, Algorithms for VLSI Physical Design Automation, 2nd edition, Kluwer Academic Publishers, Boston, 1995.","edition":"2nd edition"},{"key":"25_CR16","unstructured":"C. Thomassen, Plane representations of graphs, (Eds.) J.A. Bondy and U.S.R. Murty, Progress in Graph Theory, Academic Press Canada, (1984), pp. 43\u201369."},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987), pp. 421\u2013444.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T03:41:09Z","timestamp":1587440469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}