{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:57Z","timestamp":1725552177296},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_23","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T04:56:50Z","timestamp":1137733010000},"page":"251-261","source":"Crossref","is-referenced-by-count":3,"title":["Hierarchical Layouts of Directed Graphs in Three Dimensions"],"prefix":"10.1007","author":[{"given":"Seok-Hee","family":"Hong","sequence":"first","affiliation":[]},{"given":"Nikola S.","family":"Nikolov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45848-4_3","volume-title":"Graph Drawing","author":"U. Brandes","year":"2002","unstructured":"Brandes, U., K\u00f6pf, B.: Fast and simple horizontal coordinate assignment. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 31\u201344. Springer, Heidelberg (2002)"},{"key":"23_CR2","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications\u00a07, 303\u2013316 (1997)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"4","key":"23_CR4","first-page":"424","volume":"13","author":"P. Eades","year":"1990","unstructured":"Eades, P., Sugiyama, K.: How to draw a directed graph. Journal of Information Processing\u00a013(4), 424\u2013437 (1990)","journal-title":"Journal of Information Processing"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-62495-3_48","volume-title":"Graph Drawing","author":"A. Garg","year":"1997","unstructured":"Garg, A., Tamassia, R.: GIOTTO: A system for visualizing hierarchical structures in 3D. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 193\u2013200. Springer, Heidelberg (1997)"},{"key":"23_CR6","unstructured":"Hong, S.-H., Nikolov, N.S.: Layered drawings of directed graphs in three dimensions. In: Hong, S.-H. (ed.) Information Visualisation 2005: Asia-Pacific Symposium on Information Visualisation (APVIS 2005), vol.\u00a045, pp. 69\u201374. CRPIT (2005)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Nikolov, N.S., Tarassov, A.: Graph layering by promotion of nodes. In: Special issue of Discrete Applied Mathematics associated with the IV ALIO\/EURO Workshop on Applied Combinatorial Optimization (to appear)","DOI":"10.1016\/j.dam.2005.05.023"},{"key":"23_CR8","unstructured":"Ostry, D.: Some three-dimensional graph drawing algorithms. Master\u2019s thesis, University of Newcastle (1996)"},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transaction on Systems, Man, and Cybernetics\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Transaction on Systems, Man, and Cybernetics"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Ware, C., Franck, G.: Viewing a graph in a virtual reality display is three times as good as a 2D diagram. In: IEEE Conference on Visual Languages, pp. 182\u2013183 (1994)","DOI":"10.1109\/VL.1994.363621"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:12:12Z","timestamp":1619493132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11618058_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}