{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:20:40Z","timestamp":1740028840246,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633075"},{"type":"electronic","value":"9783540694229"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63307-3_72","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T19:22:48Z","timestamp":1270495368000},"page":"331-344","source":"Crossref","is-referenced-by-count":15,"title":["Computing orthogonal drawings with the minimum number of bends"],"prefix":"10.1007","author":[{"given":"Paola","family":"Bertolazzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. In Proc. 2nd Annu. European Sympos. Algorithms (ESA '94), volume 855 of Lecture Notes in Computer Science, pages 24\u201335. Springer-Verlag, 1994.","DOI":"10.1007\/BFb0049394"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"F. J. Brandenburg, editor. Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021783"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"F. J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 76\u201387. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021792"},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235\u2013282, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of three graph drawing algorithms. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 306\u2013315,1995.","DOI":"10.1145\/220279.220312"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"G. Di Battista, G. Liotta, and F. Vargiu. Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs. In Proc. Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 151\u2013162. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57155-8_244"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G. Battista Di","year":"1996","unstructured":"G. Di Battista and R. Tamassia. On-line maintenance of triconnected components with SPQR-tree s. Algorithmica, 15:302\u2013318, 1996. Preprint: Technical Report CS-92-40, Comput. Sci. Dept., Brown Univ. (1992).","journal-title":"Algorithmica"},{"key":"30_CR8","unstructured":"G. Di Battista and R. Tamassia. On-line planarity testing. SIAM J. Comput., to appear. Preprint: Technical Report CS-92-39, Comput. Sci. Dept., Brown Univ. (1992)."},{"key":"30_CR9","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even. Graph Algorithms. Computer Science Press, Potomac, Maryland, 1979."},{"key":"30_CR10","series-title":"Report CS-94-10","volume-title":"On the computational complexity of upward and rectilinear planarity testing","author":"A. Garg","year":"1994","unstructured":"A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. Report CS-94-10, Comput. Sci. Dept., Brown Univ., Providence, RI, 1994."},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. Submitted to SIAM Journal on Computing, 1995.","DOI":"10.1007\/3-540-58950-3_384"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"M. Himsolt. Comparing and evaluating layout algorithms within GraphEd. J. Visual Lang. Comput., 6(3), 1995. (special issue on Graph Visualization, edited by I. F. Cruz and P. Eades).","DOI":"10.1006\/jvlc.1995.1015"},{"key":"30_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"J. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM J. Comput., 2:135\u2013158, 1973.","journal-title":"SIAM J. Comput."},{"key":"30_CR14","unstructured":"S. Jones, P. Eades, A. Moran, N. Ward, G. Delott, and R. Tamassia. A note on planar graph drawing algorithms. Technical Report 216, Department of Computer Science, University of Queensland, 1991."},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"M. J\u00fcnger and P. Mutzel. Exact and heuristic algorithms for 2-layer straightline crossing minimization. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 337\u2013348. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021817"},{"key":"30_CR16","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"K. Mehlhorn and S. N\u00e4her. LEDA: a platform for combinatorial and geometric computing. Commun. ACM, 38:96\u2013102, 1995.","journal-title":"Commun. ACM"},{"key":"30_CR17","unstructured":"T. Nishizeki and N. Chiba. Planar graphs: Theory and algorithms. Ann. Discrete Math., 32, 1988."},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"A. Papakostas and I. G. Tollis. Improved algorithms and bounds for orthogonal drawings. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 40\u201351. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_355"},{"issue":"3","key":"30_CR19","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421\u2013444, 1987.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"30_CR20","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC-18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61\u201379, 1988.","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"4","key":"30_CR21","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom., 1(4):321\u2013341, 1986.","journal-title":"Discrete Comput. Geom."},{"key":"30_CR22","unstructured":"R. Tamassia and I. G. Tollis. Efficient embedding of planar graphs in linear time. In Proc. IEEE Internat. Sympos. on Circuits and Systems, pages 495\u2013498, 1987."},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"R. Tamassia and I. G. Tollis, editors. Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63307-3_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:15:04Z","timestamp":1739999704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63307-3_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633075","9783540694229"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-63307-3_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}