{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:39Z","timestamp":1725512019426},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709039"},{"type":"electronic","value":"9783540709046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70904-6_33","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T15:44:43Z","timestamp":1179416683000},"page":"343-354","source":"Crossref","is-referenced-by-count":6,"title":["A New Approximation Algorithm for Bend Minimization in the Kandinsky Model"],"prefix":"10.1007","author":[{"given":"Wilhelm","family":"Barth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Canan","family":"Y\u0131ld\u0131z","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"AGD User Manual (1999), \n                    \n                      http:\/\/www.ads.tuwien.ac.at\/AGD\/","key":"33_CR1"},{"key":"33_CR2","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"},{"issue":"4","key":"33_CR3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"12","author":"C. Batini","year":"1986","unstructured":"Batini, C., Nardelli, E., Tamassia, R.: A Layout Algorithm for Data Flow Diagrams. IEEE Trans. Softw. Eng (SE)\u00a012(4), 538\u2013546 (1986)","journal-title":"IEEE Trans. Softw. Eng. (SE)"},{"key":"33_CR4","first-page":"306","volume-title":"Proc. 11th Ann. ACM Symp. Comput. Geom.","author":"G. Battista Di","year":"1995","unstructured":"Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An Experimental Comparison of Three Graph Drawing Algorithms. In: Proc. 11th Ann. ACM Symp. Comput. Geom., pp. 306\u2013315. ACM Press, New York (1995)"},{"issue":"8","key":"33_CR5","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/12.868028","volume":"49","author":"P. Bertolazzi","year":"2000","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEE Trans. Comput.\u00a049(8), 826\u2013840 (2000)","journal-title":"IEEE Trans. Comput."},{"unstructured":"Eiglsperger, M.: Automatic Layout of UML Calss Diagrams: A Topology-Shape-Metrics Approach. PhD thesis, Eberhard-Karls-Universit\u00e4t zu T\u00fcbingen (2003)","key":"33_CR6"},{"key":"33_CR7","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)"},{"unstructured":"F\u00f6\u00dfmeier, U.: Orthogonale Visualisierungstechnicken f\u00fcr Graphen. PhD thesis, Eberhard-Karls-Universit\u00e4 t zu T\u00fcbingen (1997)","key":"33_CR8"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-63938-1_57","volume-title":"Graph Drawing","author":"U. F\u00f6\u00dfmeier","year":"1997","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 134\u2013145. Springer, Heidelberg (1997)"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-62495-3_49","volume-title":"Graph Drawing","author":"A. Garg","year":"1997","unstructured":"Garg, A., Tamassia, R.: A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 201\u2013216. Springer, Heidelberg (1997)"},{"unstructured":"ILOG CPLEX 8.1: \n                    \n                      http:\/\/www.ilog.com\/products\/cplex\/","key":"33_CR11"},{"issue":"3","key":"33_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(3), 421\u2013444 (1987)","journal-title":"SIAM Journal on Computing"},{"unstructured":"Yildiz, C.: Knickminimales Orthogonales Zeichnen Planarer Graphen im Kandinsky Modell. PhD thesis, Vienna University of Technology (2006)","key":"33_CR13"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:32Z","timestamp":1605762692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709039","9783540709046"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_33","relation":{},"subject":[]}}