{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T15:47:59Z","timestamp":1748015279107},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_28","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"296-307","source":"Crossref","is-referenced-by-count":2,"title":["A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs"],"prefix":"10.1007","author":[{"given":"Shin-ichi","family":"Nakano","sequence":"first","affiliation":[]},{"given":"Makiko","family":"Yoshikawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"28_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-57155-8_244","volume-title":"Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs","author":"G. Battista Di","year":"1993","unstructured":"G. Di Battista, G. Liotta and F. Vargiu, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs, Proc. of Workshop on Algorithms and Data structures, LNCS 709, Springer (1993) 151\u2013162."},{"key":"28_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/3-540-58950-3_384","volume-title":"On the computational complexity of upward and rectilinear planarity testing","author":"A. Garg","year":"1995","unstructured":"A. Garg and R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, Proc. of Graph Drawing\u201994, LNCS 894, Springer (1995) 286\u2013297."},{"key":"28_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-62495-3_49","volume-title":"A new minimum cost flow algorithm with applications to graph drawing","author":"A. Garg","year":"1997","unstructured":"A. Garg and R. Tamassia, A new minimum cost flow algorithm with applications to graph drawing, Proc. of Graph Drawing\u201996, LNCS 1190, Springer (1997) 201\u2013226."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, 16 (1996) 4\u201332.","journal-title":"Algorithmica"},{"key":"28_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/3-540-57899-4_69","volume-title":"Two algorithms for finding rectangular duals of planargraphs","author":"G. Kant","year":"1994","unstructured":"G. Kant and X. He, Two algorithms for finding rectangular duals of planargraphs, Proc. of WG\u201993, LNCS 790, Springer (1994) 396\u2013410."},{"key":"28_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/3-540-61332-3_142","volume-title":"Rectangular grid drawings of plane graphs","author":"M. S. Rahman","year":"1996","unstructured":"M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular grid drawings of plane graphs, Proc. of COCOON\u201996, LNCS 1090, Springer (1996) 92\u2013105. Also, Computational Geometry: Theory and Applications, 10 (1998) 203-220."},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.7155\/jgaa.00017","volume":"3","author":"M. S. Rahman","year":"1999","unstructured":"M. S. Rahman, S. Nakano and T. Nishizeki, A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs, Journal of Graph Algorithms and Applications, 3 (1999) 31\u201362.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"28_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/3-540-44968-X_9","volume-title":"Rectangular Drawings of Plane Graphs without Designated Corners","author":"M. S. Rahman","year":"2000","unstructured":"M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular Drawings of Plane Graphs without Designated Corners, Proc. of COCOON\u201900, LNCS 1858, Springer (2000) 85\u201394."},{"key":"28_CR9","doi-asserted-by":"publisher","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 (1987) 421\u2013444.","journal-title":"SIAM J. Comput."},{"key":"28_CR10","unstructured":"C. Thomassen, Plane representations of graphs, (Eds.) J.A. Bondy and U.S.R. Murty, Progress in Graph Theory, Academic Press Canada (1984) 43\u201369."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T15:54:48Z","timestamp":1548345288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}