{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T08:41:10Z","timestamp":1794472870552,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642544224","type":"print"},{"value":"9783642544231","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_13","type":"book-chapter","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T23:02:27Z","timestamp":1395702147000},"page":"144-155","source":"Crossref","is-referenced-by-count":8,"title":["Smooth Orthogonal Drawings of Planar Graphs"],"prefix":"10.1007","author":[{"given":"Muhammad Jawaherul","family":"Alam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Alam, M.J., Bekos, M.A., Kaufmann, M., Kindermann, P., Kobourov, S.G., Wolff, A.: Smooth orthogonal drawings of planar graphs. Arxiv report arxiv.org\/abs\/1312.3538 (2013)","DOI":"10.1007\/978-3-642-54423-1_13"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-36763-2_14","volume-title":"Graph Drawing","author":"M.A. Bekos","year":"2013","unstructured":"Bekos, M.A., Kaufmann, M., Kobourov, S.G., Symvonis, A.: Smooth orthogonal layouts. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 150\u2013161. Springer, Heidelberg (2013)"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T. Biedl","year":"1998","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. Theory Appl.\u00a09(3), 159\u2013180 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.7155\/jgaa.00251","volume":"16","author":"C.A. Duncan","year":"2012","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Lombardi drawings of graphs. J. Graph Algorithms Appl.\u00a016(1), 85\u2013108 (2012), http:\/\/dx.doi.org\/10.7155\/jgaa.00251","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00454-012-9472-y","volume":"49","author":"C.A. Duncan","year":"2013","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Drawing trees with perfect angular resolution and polynomial area. Discrete Comput. Geom.\u00a049(2), 157\u2013182 (2013)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"13_CR6","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 J. Comput.\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"13_CR7","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(1), 4\u201332 (1996)","journal-title":"Algorithmica"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: Proc. 21st Annu. IEEE Symp. Foundat. Comput. Sci. (FOCS 1980), pp. 270\u2013281 (1980)","DOI":"10.1109\/SFCS.1980.13"},{"issue":"1-3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0166-218X(97)00076-0","volume":"81","author":"Y. Liu","year":"1998","unstructured":"Liu, Y., Morgana, A., Simeone, B.: A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid. Discrete Appl. Math.\u00a081(1-3), 69\u201391 (1998)","journal-title":"Discrete Appl. Math."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-63938-1_86","volume-title":"Graph Drawing","author":"J. Seemann","year":"1997","unstructured":"Seemann, J.: Extending the Sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams. In: Di Battista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 415\u2013424. Springer, Heidelberg (1997)"},{"issue":"3","key":"13_CR11","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 J. Comput.\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"key":"13_CR12","unstructured":"Waldherr, H.: Network Gmunden\u2013V\u00f6cklabruck\u2013Salzkammergut of the Publ. Transp. Assoc. O\u00d6VG, Austria (November 2012), http:\/\/www.ooevv.at\/uploads\/media\/OOE2_Salzkammergut_V17_END.pdf (accessed September 10, 2013)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T00:23:11Z","timestamp":1746145391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_13","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}