{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:01Z","timestamp":1725564961767},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_33","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"300-308","source":"Crossref","is-referenced-by-count":2,"title":["On the Orthogonal Drawing of Outerplanar Graphs"],"prefix":"10.1007","author":[{"given":"Kumiko","family":"Nomura","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Tayu","sequence":"additional","affiliation":[]},{"given":"Shuichi","family":"Ueno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G. Battista","year":"1998","unstructured":"Battista, G., Liotta, G., Vargiu, F.: Spirality and optimal orthogonal drawings. SIAM J. Comput.\u00a027, 1764\u20131811 (1998)","journal-title":"SIAM J. Comput."},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BFb0049394","volume-title":"Algorithms - ESA \u201994","author":"T. Biedl","year":"1994","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 24\u201335. Springer, Heidelberg (1994)"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0020-0190(96)00133-0","volume":"60","author":"P. Eades","year":"1996","unstructured":"Eades, P., Strik, C., Whitesides, S.: The techniques of komolgorov and bardzin for three-dimensional orthogonal graph drawings. Information Processing Letters\u00a060, 97\u2013103 (1996)","journal-title":"Information Processing Letters"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(00)00172-4","volume":"103","author":"P. Eades","year":"2000","unstructured":"Eades, P., Symvonis, A., Whitesides, S.: Three-dimensional orthogonal graph drawing algorithms. Discrete Applied Mathmatics\u00a0103, 55\u201387 (2000)","journal-title":"Discrete Applied Mathmatics"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"1995","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput.\u00a031, 601\u2013625 (1995)","journal-title":"SIAM J. Comput."},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica\u00a016, 4\u201332 (1996)","journal-title":"Algorithmica"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0166-218X(97)00076-0","volume":"81","author":"Y. Liu","year":"1998","unstructured":"Liu, Y., Morgana, A., Simeone, B.: A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid. Discrete Applied Mathmatics\u00a081, 69\u201391 (1998)","journal-title":"Discrete Applied Mathmatics"},{"key":"33_CR8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.7155\/jgaa.00019","volume":"3","author":"A. Papakostas","year":"1999","unstructured":"Papakostas, A., Tollis, I.G.: Algorithm for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms and Applications\u00a03, 81\u2013115 (1999)","journal-title":"J. Graph Algorithms and Applications"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45848-4_31","volume-title":"Graph Drawing","author":"M.S. Rahman","year":"2001","unstructured":"Rahman, M.S., Naznin, M., Nishizeki, T.: Orthogonal drawing of plane graphs without bends. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 392\u2013406. Springer, Heidelberg (2001)"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(02)00044-0","volume":"299","author":"D.R. Wood","year":"2003","unstructured":"Wood, D.R.: Optimal three-dimensional orthogonal graph drawing in the general position model. Theoretical Computer Science\u00a0299, 151\u2013178 (2003)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:35Z","timestamp":1620012395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}