{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:13:46Z","timestamp":1725495226059},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001584"},{"type":"electronic","value":"9783540361510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36151-0_14","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T12:14:14Z","timestamp":1195215254000},"page":"142-149","source":"Crossref","is-referenced-by-count":3,"title":["Orthogonal 3D Shapes of Theta Graphs"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1002\/(SICI)1097-0118(199801)27:1<17::AID-JGT4>3.0.CO;2-J","volume":"27","author":"D. S. Archdeacon","year":"1998","unstructured":"D. S. Archdeacon and J. \u0160ir\u00e1\u0148. Characterizing planarity using theta graphs. J. Graph Theory, 27:17\u201320, 1998.","journal-title":"J. Graph Theory"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"J. Brown, C. Hickman, A. Sokal, and D. Wagner. On the chromatic roots of generalized theta graphs. J. of Combinatorial Theory, Series B, to appear.","DOI":"10.1006\/jctb.2001.2057"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"I. Bru\u03b2 and A. Frick. Fast interactive 3-D graph visualization. In F. J. Brandenburg,editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Comput. Sci., pages 99\u2013110. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021794"},{"key":"14_CR4","first-page":"433","volume":"3","author":"G. Chartrand","year":"1967","unstructured":"G. Chartrand and F. Harary. Planar permutation graphs. Ann. Inst. H. Poincar\u00e9, Sect B, 3:433\u2013438, 1967.","journal-title":"Ann. Inst. H. Poincar\u00e9, Sect B"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"I. F. Cruz and J. P. Twarog. 3D graph drawing with simulated annealing. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Comput. Sci., pages 162\u2013165. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021800"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"G. Di Battista, G. Liotta, A. Lubiw, and S. Whitesides. Embedding problems for paths with direction constrained edges. In Annual International Computing and Combinatorics Conference, (COCOON 2000), volume 1858 of Lecture Notes Comput. Sci., pages 64\u201373. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-44968-X_7"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"G. Di Battista, G. Liotta, A. Lubiw, and S. Whitesides. Orthogonal drawings of cycles in 3d space. In J. Marks, editor, Graph Drawing (Proc. GD\u2019 00), volume 1984 of Lecture Notes Comput. Sci. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-44541-2_26"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"G. Di Battista, G. Liotta, A. Lubiw, and S. Whitesides. Embedding problems for paths with direction constrained edges. J. of Theor. Comp. Sci., 2002. to appear.","DOI":"10.1016\/S0304-3975(01)00408-X"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"E. Di Giacomo, G. Liotta, and M. Patrignani. On orthogonal 3d shapes oftheta graphs. Tech. Report RT-DIA-71-2002, Dept. of Computer Sci., Univ. di Roma Tre, 2002. http:\/\/web.dia.uniroma3.it\/research\/ .","DOI":"10.1007\/3-540-36151-0_14"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"D. Dodson. COMAIDE: Information visualization using cooperative 3D diagram layout. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Comput. Sci., pages 190\u2013201. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021803"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/1097-0118(200010)35:2<89::AID-JGT3>3.0.CO;2-A","volume":"35","author":"D. Eichhorn","year":"2000","unstructured":"D. Eichhorn, D. Mubayi, K. O\u2019Bryant, and D. B. West. Edge-bandwidth oftheta graphs. J. Graph Theory, 35:89\u201398, 2000.","journal-title":"J. Graph Theory"},{"key":"14_CR13","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary. Graph Theory. Addison-Wesley, Reading, Mass., 1969."},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1137\/S0895480197330758","volume":"12","author":"T. Jiang","year":"1999","unstructured":"T. Jiang, D. Mubayi, A. Shastri, and D. B. West. Edge-bandwidth ofgraphs. SIAM Journal on Discrete Mathematics, 12(3):307\u2013316, 1999.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"14_CR15","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. Journal of Graph Algorithms and Applications, 3(4):81\u2013115, 1999.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"G. Peck and A. Shastri. Bandwidth oftheta graphs with short paths. Discrete Mathematics, 103, 1992.","DOI":"10.1016\/0012-365X(92)90268-K"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0012-365X(96)00341-X","volume":"174","author":"I. Sciriha","year":"1997","unstructured":"I. Sciriha and S. Fiorini. On the characteristic polynomial ofhomeomorphic images ofa graph. Discrete Mathematics, 174:293\u2013308, 1997.","journal-title":"Discrete Mathematics"},{"issue":"3","key":"14_CR18","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(3):421\u2013444, 1987.","journal-title":"SIAM J. Comput."},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/0214027","volume":"14","author":"G. Vijayan","year":"1985","unstructured":"G. Vijayan and A. Wigderson. Rectilinear graphs and their embeddings. SIAM J. Comput., 14:355\u2013372, 1985.","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\/3-540-36151-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:32:08Z","timestamp":1556969528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36151-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001584","9783540361510"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36151-0_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}