{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:54Z","timestamp":1725524634702},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_9","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T13:03:51Z","timestamp":1233752631000},"page":"78-89","source":"Crossref","is-referenced-by-count":9,"title":["The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing"],"prefix":"10.1007","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/0219037","volume":"19","author":"F. Annexstein","year":"1990","unstructured":"Annexstein, F., Baumslag, M., Rosenberg, A.L.: Group action graphs and parallel architectures. SIAM J. Comput.\u00a019(3), 544\u2013569 (1990)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.7155\/jgaa.00018","volume":"3","author":"T. Biedl","year":"1999","unstructured":"Biedl, T., Shermer, T.C., Whitesides, S., Wismath, S.K.: Bounds for orthogonal 3-D graph drawing. J. Graph Alg. Appl.\u00a03(4), 63\u201379 (1999)","journal-title":"J. Graph Alg. Appl."},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00453-005-1148-z","volume":"44","author":"T. Biedl","year":"2006","unstructured":"Biedl, T., Thiele, T., Wood, D.R.: Three-dimensional orthogonal graph drawing with optimal volume. Algorithmica\u00a044(3), 233\u2013255 (2006)","journal-title":"Algorithmica"},{"key":"9_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2540-9","volume-title":"The Foundations of Topological Graph Theory","author":"C.P. Bonnington","year":"1995","unstructured":"Bonnington, C.P., Little, C.H.C.: The Foundations of Topological Graph Theory. Springer, Heidelberg (1995)"},{"issue":"1-2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(99)00287-X","volume":"255","author":"T. Calamoneri","year":"2001","unstructured":"Calamoneri, T., Massini, A.: Optimal three-dimensional layout of interconnection networks. Theor. Comput. Sci.\u00a0255(1-2), 263\u2013279 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00033","volume":"5","author":"M. Closson","year":"2001","unstructured":"Closson, M., Gartshore, S., Johansen, J.R., Wismath, S.K.: Fully dynamic 3-dimensional orthogonal graph drawing. J. Graph Alg. Appl.\u00a05(2), 1\u201334 (2001)","journal-title":"J. Graph Alg. Appl."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Craft, D.L., White, A.T.: 3-maps. Discrete Math. (2008)","DOI":"10.1016\/j.disc.2008.06.009"},{"issue":"2","key":"9_CR8","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., Stirk, C., Whitesides, S.: The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings. Inf. Proc. Lett.\u00a060(2), 97\u2013103 (1996)","journal-title":"Inf. Proc. Lett."},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-62495-3_44","volume-title":"Graph Drawing","author":"P. Eades","year":"1997","unstructured":"Eades, P., Symvonis, A., Whitesides, S.: Two algorithms for three dimensional orthogonal graph drawing. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 139\u2013154. Springer, Heidelberg (1997)"},{"key":"9_CR10","unstructured":"Eppstein, D.: Dynamic generators of topologically embedded graphs. In: Proc. 14th Symp. Discrete Algorithms, pp. 599\u2013608. ACM and SIAM (January 2003)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Isometric diamond subgraphs. In: Proc. 16th Int. Symp. Graph Drawing (2008)","DOI":"10.1007\/978-3-642-00219-9_37"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"Even, S., Tarjan, R.E.: Computing an st-numbering. Theor. Comput. Sci.\u00a02(3), 339\u2013344 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0132025","volume":"32","author":"P. Gaiha","year":"1977","unstructured":"Gaiha, P., Gupta, S.K.: Adjacent vertices on a permutohedron. SIAM J. Appl. Math.\u00a032(2), 323\u2013327 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Kochol, M.: 3-regular non 3-edge-colorable graphs with polyhedral embeddings in orientable surfaces. In: Proc. 16th Int. Symp. Graph Drawing (2008)","DOI":"10.1007\/978-3-642-00219-9_31"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.7155\/jgaa.00019","volume":"3","author":"A. Papakostas","year":"1999","unstructured":"Papakostas, A., Tollis, I.G.: Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Alg. Appl.\u00a03(4), 81\u2013115 (1999)","journal-title":"J. Graph Alg. Appl."},{"issue":"5","key":"9_CR16","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F.P. Preparata","year":"1981","unstructured":"Preparata, F.P., Vuillemin, J.: The cube-connected cycles: a versatile network for parallel computation. Commun. ACM\u00a024(5), 300\u2013309 (1981)","journal-title":"Commun. ACM"},{"key":"9_CR17","unstructured":"Royle, G., Conder, M., McKay, B., Dobscanyi, P.: Cubic symmetric graphs (The Foster Census). Web page (2001), http:\/\/people.csse.uwa.edu.au\/gordon\/remote\/foster\/"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-37623-2_25","volume-title":"Graph Drawing","author":"D.R. Wood","year":"1999","unstructured":"Wood, D.R.: An algorithm for three-dimensional orthogonal graph drawing. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 332\u2013346. Springer, Heidelberg (1999)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-45848-4_25","volume-title":"Graph Drawing","author":"D.R. Wood","year":"2002","unstructured":"Wood, D.R.: Bounded degree book embeddings and three-dimensional orthogonal graph drawing. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 312\u2013327. Springer, Heidelberg (2002)"},{"issue":"1-3","key":"9_CR20","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. Theor. Comput. Sci.\u00a0299(1-3), 151\u2013178 (2003)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T20:06:47Z","timestamp":1558123607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}