{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:31Z","timestamp":1725487291967},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_29","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:01:32Z","timestamp":1184587292000},"page":"308-320","source":"Crossref","is-referenced-by-count":2,"title":["Refinement of Three-Dimensional Orthogonal Graph Drawings"],"prefix":"10.1007","author":[{"given":"Benjamin Y. S.","family":"Lynn","sequence":"first","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"29_CR1","unstructured":"T. Biedl and T. Chan. Cross-coloring: improving the technique by Kolmogorov and Barzdin. Technical Report CS-2000-13, University of Waterloo, Canada, 2000."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"M. Closson, S. Gartshore, J. Johansen, and S. K. Wismath.Fully dynamic 3-dimensional orthogonal graph drawing. In Kratochvil [8], pages 49\u201358.","DOI":"10.1007\/3-540-46648-7_5"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"G. Di Battista, M. Patrignani, and F. Vargiu. A split&push approach to 3D orthogonal drawing. In Whitesides [12], pages 87\u2013101.","DOI":"10.1007\/3-540-37623-2_7"},{"issue":"2","key":"29_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0020-0190(96)00133-0","volume":"60","author":"P. Eades","year":"1996","unstructured":"P. Eades, C. Stirk, and S. Whitesides. The techniques of Komolgorov and Bardzin for three dimensional orthogonal graph drawings. Inform. Proc. Lett., 60(2):97\u2013103, 1996.","journal-title":"Inform. Proc. Lett."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(00)00172-4","volume":"103","author":"P. Eades","year":"2000","unstructured":"P. Eades, A. Symvonis, and S. Whitesides. Three dimensional orthogonal graph drawing algorithms. Discrete Applied Math., 103:55\u201387, 2000.","journal-title":"Discrete Applied Math."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"U. F\u00f6\u03b2meier, C. He\u03b2, and M. Kaufmann. On improving orthogonal drawings: the 4M-algorithm. In Whitesides [12], pages 125\u2013137.","DOI":"10.1007\/3-540-37623-2_10"},{"key":"29_CR7","first-page":"261","volume":"8","author":"A. N. Kolmogorov","year":"1967","unstructured":"A. N. Kolmogorov and Ya. M. Barzdin. On the realization of nets in 3-dimensional space. Problems in Cybernetics, 8:261\u2013268, March 1967.","journal-title":"Problems in Cybernetics"},{"key":"29_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Proc. Graph Drawing: 7th International Symp. (GD\u201999)","year":"1999","unstructured":"J. Kratochvil, editor. Proc. Graph Drawing: 7th International Symp. (GD\u201999), volume 1731 of Lecture Notes in Comput. Sci., Springer, 1999."},{"issue":"4","key":"29_CR9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.7155\/jgaa.00019","volume":"3","author":"A. Papakostas","year":"1999","unstructured":"A. Papakostas and I. G. Tollis. Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81\u2013115, 1999.","journal-title":"J. Graph Algorithms Appl."},{"key":"29_CR10","series-title":"Lect Notes Comput Sci","first-page":"284","volume-title":"3DCube: a tool for three dimensional graph drawing","author":"M. Patrignani","year":"1998","unstructured":"M. Patrignani and F. Vargiu. 3DCube: a tool for three dimensional graph drawing. In G. Di Battista, editor, Proc. Graph Drawing: 5th International Symp. (GD\u201997), volume 1353 of Lecture Notes in Comput. Sci., pages 284\u2013290, Springer, 1998."},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"J. M. Six, K. G. Kakoulis, and I. G. Tollis. Refinement of orthogonal graph drawings. In Whitesides [12], pages 302\u2013315.","DOI":"10.1007\/3-540-37623-2_23"},{"key":"29_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proc. Graph Drawing: 6th International Symp. (GD\u201998)","year":"1998","unstructured":"S. Whitesides, editor. Proc. Graph Drawing: 6th International Symp. (GD\u201998), volume 1547 of Lecture Notes in Comput. Sci., Springer, 1998."},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"D. R. Wood. An algorithm for three-dimensional orthogonal graph drawing. In Whitesides [12], pages 332\u2013346.","DOI":"10.1007\/3-540-37623-2_25"},{"key":"29_CR14","unstructured":"D. R. Wood. Three-Dimensional Orthogonal Graph Drawing. PhD thesis, School of Computer Science and Software Engineering, Monash University, Australia, 2000."}],"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_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:19:43Z","timestamp":1556666383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}