{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:40Z","timestamp":1725761140457},"publisher-location":"Cham","reference-count":10,"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_37","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T00:28:55Z","timestamp":1385944135000},"page":"424-435","source":"Crossref","is-referenced-by-count":2,"title":["Slanted Orthogonal Drawings"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Krug","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"N\u00e4her","sequence":"additional","affiliation":[]},{"given":"Vincenzo","family":"Roselli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BFb0049394","volume-title":"Algorithms - ESA \u201994","author":"T.C. Biedl","year":"1994","unstructured":"Biedl, T.C., Kant, G.: A better heuristic for orthogonal graph drawings. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 24\u201335. Springer, Heidelberg (1994)"},{"issue":"3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"635","DOI":"10.7155\/jgaa.00265","volume":"16","author":"S. Cornelsen","year":"2012","unstructured":"Cornelsen, S., Karrenbauer, A.: Accelerated bend minimization. Journal of Graph Algorithms Applications\u00a016(3), 635\u2013650 (2012)","journal-title":"Journal of Graph Algorithms Applications"},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-37623-2_10","volume-title":"Graph Drawing","author":"U. F\u00f6\u00dfmeier","year":"1999","unstructured":"F\u00f6\u00dfmeier, U., He\u00df, C., Kaufmann, M.: On improving orthogonal drawings: The 4M-algorithm. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 125\u2013137. Springer, Heidelberg (1999)"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Graph Drawing","author":"U. F\u00f6\u00dfmeier","year":"1996","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 254\u2013266. Springer, Heidelberg (1996)"},{"issue":"2","key":"37_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 of Computing\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM Journal of Computing"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: 21st Symposium on Foundations of Computer Science, vol.\u00a01547, pp. 270\u2013281. IEEE (1980)","DOI":"10.1109\/SFCS.1980.13"},{"issue":"5","key":"37_CR7","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1109\/TVCG.2010.81","volume":"17","author":"M. N\u00f6llenburg","year":"2011","unstructured":"N\u00f6llenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans. Vis. Comput. Graph.\u00a017(5), 626\u2013641 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"37_CR8","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 of Computing\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM Journal of Computing"},{"issue":"9","key":"37_CR9","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R. Tamassia","year":"1989","unstructured":"Tamassia, R., Tollis, I.G.: Planar grid embedding in linear time. IEEE Transactions on Circuits and Systems\u00a036(9), 1230\u20131234 (1989)","journal-title":"IEEE Transactions on Circuits and Systems"},{"issue":"2","key":"37_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"L.G. Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Transaction on Computers\u00a030(2), 135\u2013140 (1981)","journal-title":"IEEE Transaction on Computers"}],"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_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T21:54:58Z","timestamp":1558734898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}