{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:03Z","timestamp":1746115863251,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_33","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"361-372","source":"Crossref","is-referenced-by-count":0,"title":["Square-Orthogonal Drawing with Few Bends per Edge"],"prefix":"10.1007","author":[{"given":"Yu-An","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"33_CR1","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/12.868028","volume":"49","author":"P. Bertolazzi","year":"2000","unstructured":"Bertolazzi, P., Battista, G.D., Didimo, W.: Computing orthogonal drawings with minimum number of bends. IEEE Trans. on Computers\u00a049(8), 826\u2013840 (2000)","journal-title":"IEEE Trans. on Computers"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T.C. Biedl","year":"1998","unstructured":"Biedl, T.C., Kant, G.: A better heuristic for orthogonal graph drawings. Computational Geometry: Theory and Applications\u00a09, 159\u2013180 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-63397-9_4","volume-title":"Algorithms - ESA \u201997","author":"T.C. Biedl","year":"1997","unstructured":"Biedl, T.C., Kaufmann, M.: Area-efficient static and incremental graph drawings. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol.\u00a01284, pp. 37\u201352. Springer, Heidelberg (1997)"},{"unstructured":"Biedl, T.C., Madden, B.P., Tollis, I.G.: Drawing high-degree graphs with small grid-size. Technical Report 37\u201396, RUTCOR, Rutgers University (November 1996)","key":"33_CR4"},{"doi-asserted-by":"crossref","unstructured":"Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Leighton, F.T., Symvonis, A., Welzl, E., Woeginger, G.J.: Drawing graphs in the plane with high resolution. In: Proceedings IEEE Symposium on FOCS, pp. 86-95 (1990)","key":"#cr-split#-33_CR5.1","DOI":"10.1109\/FSCS.1990.89527"},{"doi-asserted-by":"crossref","unstructured":"SIAM Journal on Computing 22(5), 1035-1052 (1993)","key":"#cr-split#-33_CR5.2","DOI":"10.1137\/0222063"},{"key":"33_CR6","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_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)"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/jagm.2001.1161","volume":"40","author":"X. He","year":"2001","unstructured":"He, X.: A simple linear time algorithm for proper box rectangular drawings of plane graphs. Journal of Algorithms\u00a040(1), 82\u2013101 (2001)","journal-title":"Journal of Algorithms"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-62495-3_60","volume-title":"Graph Drawing","author":"A. Papakostas","year":"1997","unstructured":"Papakostas, A., Tollis, I.G.: A pairing technique for area-efficient orthogonal drawings. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 355\u2013370. Springer, Heidelberg (1997)"},{"issue":"1-2","key":"33_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0925-7721(97)00017-5","volume":"9","author":"A. Papakostas","year":"1998","unstructured":"Papakostas, A., Tollis, I.G.: Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications\u00a09(1-2), 83\u2013110 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"33_CR11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s004539910006","volume":"26","author":"A. Papakostas","year":"2000","unstructured":"Papakostas, A., Tollis, I.G.: Efficient orthogonal drawings of high degree graphs. Algorithmica\u00a026(1), 100\u2013125 (2000)","journal-title":"Algorithmica"},{"issue":"1","key":"33_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0166-218X(94)00020-E","volume":"63","author":"M. Schaffter","year":"1995","unstructured":"Schaffter, M.: Drawing graphs on rectangular grids. Discrete Applied Math.\u00a063(1), 75\u201389 (1995)","journal-title":"Discrete Applied Math."},{"issue":"3","key":"33_CR13","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"},{"doi-asserted-by":"crossref","unstructured":"Tamassia, R.: Planar orthogonal drawings of graphs. In: Proc. of the IEEE International Symposium on Circuits and Systems, pp. 319\u2013322 (1990)","key":"33_CR14","DOI":"10.1109\/ISCAS.1990.112025"},{"issue":"2","key":"33_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"L. Valiant","year":"1981","unstructured":"Valiant, L.: Universality considerations in VLSI circuits. IEEE Trans. on Computers\u00a030(2), 135\u2013140 (1981)","journal-title":"IEEE Trans. on Computers"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:26:27Z","timestamp":1746008787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}