{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:54:39Z","timestamp":1725738879394},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392054"},{"type":"electronic","value":"9783642392061"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39206-1_16","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:20:16Z","timestamp":1372771216000},"page":"184-195","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Orthogonal Graph Drawing with Convex Bend Costs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bl\u00e4sius","sequence":"first","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","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.\u00a09(3), 159\u2013180 (1998)","journal-title":"Comput. Geom."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Bl\u00e4sius, T., Krug, M., Rutter, I., Wagner, D.: Orthogonal graph drawing with flexibility constraints. Algorithmica (2012), doi:10.1007\/s00453-012-9705-8","DOI":"10.1007\/s00453-012-9705-8"},{"key":"16_CR3","unstructured":"Bl\u00e4sius, T., Rutter, I., Wagner, D.: Optimal orthogonal graph drawing with convex bend costs. CoRR abs\/1204.4997 (2012), \n                    \n                      http:\/\/arxiv.org\/abs\/1204.4997"},{"issue":"6","key":"16_CR4","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 J. Comput.\u00a027(6), 1764\u20131811 (1998)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"16_CR5","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica\u00a015(4), 302\u2013318 (1996)","journal-title":"Algorithmica"},{"issue":"5","key":"16_CR6","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-Line Planarity Testing. SIAM J. Comput.\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"16_CR7","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."},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A Linear Time Implementation of SPQR-Trees. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"issue":"3","key":"16_CR9","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."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39206-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:07:19Z","timestamp":1557896839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39206-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392054","9783642392061"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39206-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}