{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:53:57Z","timestamp":1742385237450},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_41","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"401-410","source":"Crossref","is-referenced-by-count":4,"title":["Radial Coordinate Assignment for Level Graphs"],"prefix":"10.1007","author":[{"given":"Christian","family":"Bachmaier","sequence":"first","affiliation":[]},{"given":"Florian","family":"Fischer","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Forster","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Bachmaier, C., Brandenburg, F.J., Forster, M.: Radial level planarity testing and embedding in linear time. Journal of Graph Algorithms and Applications (2005), To appear. Preprint under \n                    \n                      http:\/\/www.infosun.fmi.uni-passau.de\/~chris\/","DOI":"10.7155\/jgaa.00100"},{"issue":"2","key":"41_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1109\/TVCG.2003.1196010","volume":"9","author":"U. Brandes","year":"2003","unstructured":"Brandes, U., Kenis, P., Wagner, D.: Communicating centrality in policy network drawings. IEEE Transact. Vis. Comput. Graph.\u00a09(2), 241\u2013253 (2003)","journal-title":"IEEE Transact. Vis. Comput. Graph."},{"key":"41_CR3","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":"41_CR4","first-page":"10","volume":"5","author":"P. Eades","year":"1992","unstructured":"Eades, P.: Drawing free trees. Bulletin of the Institute of Combinatorics and its Applications\u00a05, 10\u201336 (1992)","journal-title":"Bulletin of the Institute of Combinatorics and its Applications"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/3-540-62495-3_42","volume-title":"Graph Drawing","author":"P. Eades","year":"1997","unstructured":"Eades, P., Feng, Q.-W., Lin, X.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 113\u2013128. Springer, Heidelberg (1997)"},{"key":"41_CR6","unstructured":"Gravisto. Graph Visualization Toolkit. University of Passau, \n                    \n                      http:\/\/www.gravisto.org\/"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"issue":"1","key":"41_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/21.87050","volume":"18","author":"M.G. Reggiani","year":"1988","unstructured":"Reggiani, M.G., Marchetti, F.E.: A proposed method for representing hierarchies. IEEE Transact. Systems, Man, and Cyb.\u00a018(1), 2\u20138 (1988)","journal-title":"IEEE Transact. Systems, Man, and Cyb."},{"issue":"2","key":"41_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 Trans. Systems, Man, and Cyb.\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Systems, Man, and Cyb."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T07:33:11Z","timestamp":1553153591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11533719_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}