{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:18Z","timestamp":1725761118777},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_35","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T00:28:55Z","timestamp":1385944135000},"page":"400-411","source":"Crossref","is-referenced-by-count":1,"title":["On Orthogonally Convex Drawings of Plane Graphs"],"prefix":"10.1007","author":[{"given":"Yi-Jun","family":"Chang","sequence":"first","affiliation":[]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Alam, Md. J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S. G., Ueckert, T.: Computing Cartograms with Optimal Complexity. In: Symposium on Computational Geometry (SoCG 2012), pp. 21\u201330 (2012)","DOI":"10.1145\/2261250.2261254"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","first-page":"111","volume-title":"GD 2011","author":"S. Cornelsen","year":"2011","unstructured":"Cornelsen, S., Karrenbauer, A.: Accelerated Bend Minimization. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 111\u2013122. Springer, Heidelberg (2011)"},{"issue":"6","key":"35_CR3","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G. Battista Di","year":"1998","unstructured":"Di Battista, G., Liotta, G., Vargiu, F.: Spirality and Optimal Orthogonal Drawings. SIAM Journal on Computing\u00a027(6), 1764\u20131811 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR4","unstructured":"Duncan, C.A., Goodrich, M.T.: Planar Orthogonal and Polyline Drawing Algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, ch. 7. CRC Press (2013)"},{"issue":"2","key":"35_CR5","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the Computational Complexity of Upward and Rectilinear Planarity Testing. SIAM Journal on Computing\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"15","author":"K. Kozminski","year":"1985","unstructured":"Kozminski, K., Kinnen, E.: Rectangular Dual of Planar Graphs. Networks\u00a015, 145\u2013157 (1985)","journal-title":"Networks"},{"issue":"2-3","key":"35_CR7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1142\/S0218195906002026","volume":"16","author":"K. Miura","year":"2006","unstructured":"Miura, K., Haga, H., Nishizeki, T.: Inner Rectangular Drawings of Plane Graphs. International Journal of Computational Geometry and Applications\u00a016(2-3), 249\u2013270 (2006)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11618058_37","volume-title":"Graph Drawing","author":"M.. S. Rahman","year":"2006","unstructured":"Rahman, M. S., Egi, N., Nishizeki, T.: No-bend Orthogonal Drawings of Series-Parallel Graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 409\u2013420. Springer, Heidelberg (2006)"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.7155\/jgaa.00017","volume":"3","author":"M.S. Rahman","year":"1999","unstructured":"Rahman, M.S., Nakano, S., Nishizeki, T.: A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. Journal of Graph Algorithms and Applications\u00a03, 31\u201362 (1999)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/jgaa.00074","volume":"7","author":"M.S. Rahman","year":"2003","unstructured":"Rahman, M.S., Nishizeki, T.: Orthogonal Drawings of Plane Graphs Without Bends. Journal of Graph Algorithms and Applications\u00a07, 335\u2013362 (2003)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/BF01891831","volume":"10","author":"Y. Sun","year":"1993","unstructured":"Sun, Y., Sarrafzadeh, M.: Floorplanning by Graph Dualization: L-shaped Modules. Algorithmica\u00a010, 429\u2013456 (1993)","journal-title":"Algorithmica"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R.: On Embedding a Graph in the Grid with the Minimum Number of Bends. SIAM Journal on Computing\u00a016, 421\u2013444 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR13","unstructured":"Thomassen, C.: Plane Representations of Graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 43\u201369. Academic Press, Canada (1984)"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0222035","volume":"22","author":"K. Yeap","year":"1993","unstructured":"Yeap, K., Sarrafzadeh, M.: Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules. SIAM Journal on Computing\u00a022, 500\u2013526 (1993)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T21:48:00Z","timestamp":1558734480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}