{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:14:39Z","timestamp":1760440479894},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_37","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T04:56:50Z","timestamp":1137733010000},"page":"409-420","source":"Crossref","is-referenced-by-count":10,"title":["No-bend Orthogonal Drawings of Series-Parallel Graphs"],"prefix":"10.1007","author":[{"given":"Md. Saidur","family":"Rahman","sequence":"first","affiliation":[]},{"given":"Noritsugu","family":"Egi","sequence":"additional","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-24595-7_55","volume-title":"Graph Drawing","author":"F. Brandenburg","year":"2004","unstructured":"Brandenburg, F., Eppstein, D., Goodrich, M.T., Kobourov, S., Liotta, G., Mutzel, P.: Selected open problems in graph drawings. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 515\u2013539. Springer, Heidelberg (2004)"},{"issue":"6","key":"37_CR2","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G. Battista Di","year":"1998","unstructured":"Di Battista, G., Liotta, G., Vargiu, F.: Spirality and optimal orthogonal drawings. SIAM J. Comput.\u00a027(6), 1764\u20131811 (1998)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"37_CR3","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput.\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/3-540-46648-7_4","volume-title":"Graph Drawing","author":"A. Garg","year":"1999","unstructured":"Garg, A., Liotta, G.: Almost bend-optimal planar orthogonal drawings of biconnected degree-3 planar graphs in quadratic time. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 38\u201348. Springer, Heidelberg (1999)"},{"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 J. Comput.\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"key":"37_CR6","doi-asserted-by":"crossref","DOI":"10.1142\/5648","volume-title":"Planar Graph Drawing","author":"T. Nishizeki","year":"2004","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Rahman, M.S., Egi, N., Nishizeki, T.: No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs. IEICE Trans. Inf. & Syst. E88-D(1), 23\u201330 (2005)","DOI":"10.1093\/ietisy\/E88-D.1.23"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-36379-3_32","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.S. Rahman","year":"2002","unstructured":"Rahman, M.S., Nishizeki, T.: Bend-minimum orthogonal drawings of plane 3-graphs. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 367\u2013378. Springer, Heidelberg (2002)"},{"issue":"4","key":"37_CR9","first-page":"335","volume":"7","author":"M.S. Rahman","year":"2003","unstructured":"Rahman, M.S., Naznin, M., Nishizeki, T.: Orthogonal drawings of plane graphs without bends. Journal of Graph Alg. and Appl.\u00a07(4), 335\u2013362 (2003)","journal-title":"Journal of Graph Alg. and Appl."},{"issue":"4","key":"37_CR10","first-page":"31","volume":"3","author":"M.S. Rahman","year":"1999","unstructured":"Rahman, M.S., Nakano, S., Nishizeki, T.: A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs. Journal of Graph Alg. and Appl.\u00a03(4), 31\u201362 (1999), \n                    \n                      http:\/\/www.cs.brown.edu\/publications\/jgaa\/","journal-title":"Journal of Graph Alg. and Appl."},{"key":"37_CR11","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 J. Comput.\u00a016, 421\u2013444 (1987)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:12:19Z","timestamp":1619493139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11618058_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}