{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:46Z","timestamp":1725514426145},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_53","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T07:36:39Z","timestamp":1185089799000},"page":"584-594","source":"Crossref","is-referenced-by-count":11,"title":["Orthogonal Drawings for Plane Graphs with Specified Face Areas"],"prefix":"10.1007","author":[{"given":"Akifumi","family":"Kawaguchi","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0020-0190(92)90210-M","volume":"44","author":"F. d\u2019Amore","year":"1992","unstructured":"d\u2019Amore, F., Franciosa, P.G.: On the optimal binary plane partition for sets of isothetic rectangles. Information Proc. Letters\u00a044, 255\u2013259 (1992)","journal-title":"Information Proc. Letters"},{"key":"53_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11618058_6","volume-title":"Graph Drawing","author":"M. Berg de","year":"2006","unstructured":"de Berg, M., Speckmann, B., Mumford, E.: On Rectilinear Duals for Vertex-Weighted Plane Graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 61\u201372. Springer, Heidelberg (2006)"},{"key":"53_CR3","volume-title":"Graph drawing: Algorithms for the visualization of graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., et al.: Graph drawing: Algorithms for the visualization of graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"53_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Drawing","author":"H.-C. Yen","year":"2002","unstructured":"Yen, H.-C., Lu, H.-I., Liao, C.-C.: Floor-Planning via Orderly Spanning Trees. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, Springer, Heidelberg (2002)"},{"issue":"2","key":"53_CR5","first-page":"281","volume":"E87-D","author":"T. Nishizeki","year":"2004","unstructured":"Nishizeki, T., Miura, K., Rahman, M.S.: Algorithms for drawing plane graphs. IEICE Trans. Electron.\u00a0E87-D(2), 281\u2013289 (2004)","journal-title":"IEICE Trans. Electron."},{"key":"53_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/978-3-540-30559-0_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.S. Rahman","year":"2004","unstructured":"Rahman, M.S., Miura, K., Nishizeki, T.: Octagonal drawings of plane graphs with prescribed face areas. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 320\u2013331. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:38:26Z","timestamp":1619501906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_53","relation":{},"subject":[]}}