{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:26Z","timestamp":1725487286416},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_27","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"284-295","source":"Crossref","is-referenced-by-count":6,"title":["Three-Dimensional Orthogonal Graph Drawing with Optimal Volume"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[]},{"given":"Torsten","family":"Thiele","sequence":"additional","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01759038","volume":"6","author":"A. Aggarwal","year":"1991","unstructured":"A. Aggarwal, M. Klawe, and P. Shor. Multilayer grid embeddings for VLSI. Algorithmica, 6(1):129\u2013151, 1991.","journal-title":"Algorithmica"},{"key":"27_CR2","unstructured":"N. Alon and J. Spencer. The Probabilistic Method. John Wiley & Sons, 1992."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"T. Biedl. Three approaches to 3D-orthogonal box-drawings. In Whitesides [17], pages 30\u201343.","DOI":"10.1007\/3-540-37623-2_3"},{"key":"27_CR4","series-title":"Technical Report","volume-title":"Cross-coloring: improving the technique by Kolmogorov and Barzdin","author":"T. Biedl","year":"2000","unstructured":"T. Biedl and T. Chan. Cross-coloring: improving the technique by Kolmogorov and Barzdin. Technical Report CS-2000-13. Department of Computer Science, University of Waterloo, Canada, 2000."},{"issue":"4","key":"27_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.7155\/jgaa.00018","volume":"3","author":"T. Biedl","year":"1999","unstructured":"T. Biedl, T. Shermer, S. Whitesides, and S. Wismath. Bounds for orthogonal 3-D graph drawing. J. Graph Alg. Appl., 3(4):63\u201379, 1999.","journal-title":"J. Graph Alg. Appl."},{"key":"27_CR6","series-title":"Technical Report","volume-title":"Three-Dimensional Orthogonal Graph Drawing with Optimal Volume","author":"T. Biedl","year":"2000","unstructured":"T. Biedl, T. Thiele and D. R. Wood. Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. Technical Report CS-2000-12. Department of Computer Science, University of Waterloo, Canada, 2000."},{"key":"27_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-46648-7_5","volume-title":"Graph Drawing","author":"M. Closson","year":"1999","unstructured":"M. Closson, S. Gartshore, J. Johansen, and S. K. Wismath. Fully dynamic 3-dimensional orthogonal graph drawing. In Kratochv\u00edl [14], pages 49\u201358."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"G. Di Battista, M. Patrignani, and F. Vargiu. A split&push approach to 3D orthogonal drawing. In Whitesides [17], pages 87\u2013101.","DOI":"10.1007\/3-540-37623-2_7"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","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 Kolmogorov and Bardzin for three-dimensional orthogonal graph drawings. Information Processing Letters, 60(2):97\u2013103, 1996.","journal-title":"Information Processing Letters"},{"issue":"1\u20133","key":"27_CR10","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(1\u20133):55\u201387, 2000.","journal-title":"Discrete Applied Math."},{"issue":"40","key":"27_CR11","first-page":"123","volume":"11","author":"\u00c9. K. K. Fogel","year":"1950","unstructured":"\u00c9. K. Fogel. An elementary proof of formulae of de la Vall\u00e9e Poussin (In Russian). Latvijas PSR Zinatnu Akad. Vestis, 11(40):123\u2013130, 1950.","journal-title":"Latvijas PSR Zinatnu Akad. Vestis"},{"issue":"6","key":"27_CR12","first-page":"58","volume":"14","author":"K. Hagihara","year":"1983","unstructured":"K. Hagihara, N. Tokura, and N. Suzuki. Graph embedding on a three-dimensional model. Systems-Comput.-Controls, 14(6):58\u201366, 1983.","journal-title":"Systems-Comput.-Controls"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"D. Kleitman and M. Krieger. An optimal bound for two dimensional bin packing. In 16th Annual Symposium on Foundations of Computer Science (FOCS\u201975), pages 163\u2013168. IEEE, 1975.","DOI":"10.1109\/SFCS.1975.6"},{"key":"27_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Symposium on Graph Drawing 99","year":"1999","unstructured":"J. Kratochv\u00edl, editor. Symposium on Graph Drawing 99, volume 1731 of Lecture Notes in Computer Science. Springer-Verlag, 1999."},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261\u2013277, 1988.","journal-title":"Combinatorica"},{"issue":"4","key":"27_CR16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.7155\/jgaa.00019","volume":"3","author":"A. Papakostas","year":"1999","unstructured":"A. Papakostas and I. Tollis. Incremental orthogonal graph drawing in three dimensions. J. Graph Alg. Appl., 3(4):81\u2013115, 1999.","journal-title":"J. Graph Alg. Appl."},{"key":"27_CR17","series-title":"Lect Notes Comput Sci","volume-title":"Symposium on Graph Drawing 98","year":"1998","unstructured":"S. Whitesides, editor. Symposium on Graph Drawing 98, volume 1547 of Lecture Notes in Computer Science. Springer-Verlag, 1998."},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"D. R. Wood. An algorithm for three-dimensional orthogonal graph drawing. In Whitesides [17], pages 332\u2013346.","DOI":"10.1007\/3-540-37623-2_25"},{"key":"27_CR19","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-46648-7_32","volume-title":"Graph Drawing","author":"David R. Wood","year":"1999","unstructured":"D. R. Wood. Multi-dimensional orthogonal graph drawing with small boxes. In Kratochv\u00edl [14], pages 311\u2013322."},{"key":"27_CR20","unstructured":"D. R. Wood. A new algorithm and open problems in three-dimensional orthogonal graph drawing. In R. Raman and J. Simpson, editors, Proc. Australasian Workshop on Combinatorial Algorithms (AWOCA\u201999), pages 157\u2013167. Curtin University of Technology, Perth, 1999."}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:19:34Z","timestamp":1556680774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}