{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:47Z","timestamp":1725512027955},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709039"},{"type":"electronic","value":"9783540709046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70904-6_34","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T11:44:43Z","timestamp":1179402283000},"page":"355-366","source":"Crossref","is-referenced-by-count":2,"title":["Radial Drawings of Graphs: Geometric Constraints and Trade-Offs"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Bachmaier, C., Brandenburg, F.J., Forster, M.: Track planarity testing and embedding. In: Proc. of SOFSEM\u201904, vol. 2, pp. 3\u201317 (2004)","key":"34_CR1"},{"issue":"1","key":"34_CR2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.7155\/jgaa.00100","volume":"9","author":"C. Bachmaier","year":"2005","unstructured":"Bachmaier, C., Brandenburg, F.J., Forster, M.: Radial level planarity testing and embedding in linear time. JGAA\u00a09(1), 53\u201397 (2005)","journal-title":"JGAA"},{"issue":"2","key":"34_CR3","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 Trans. on Vis. and Comp. Graph.\u00a09(2), 241\u2013253 (2003)","journal-title":"IEEE Trans. on Vis. and Comp. Graph."},{"key":"34_CR4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-642-18638-7_15","volume-title":"Graph Drawing Software","author":"U. Brandes","year":"2004","unstructured":"Brandes, U., Wagner, D.: Visone - analysis and visualization of social networks. In: J\u00fcnger, M., Mutzel, P. (eds.) Graph Drawing Software, pp. 321\u2013340. Springer, Heidelberg (2004)"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010, 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"34_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","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)"},{"issue":"3","key":"34_CR7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.7155\/jgaa.00114","volume":"9","author":"E. Giacomo Di","year":"2005","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Computing radial drawings on the minimum number of circles. JGAA\u00a09(3), 365\u2013389 (2005)","journal-title":"JGAA"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2004.04.002","volume":"30","author":"E. Giacomo Di","year":"2005","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Curve-constrained drawings of planar graphs. Computational Geometry\u00a030, 1\u201323 (2005)","journal-title":"Computational Geometry"},{"key":"34_CR9","volume-title":"Atlas of Cyberspace","author":"M. Dodge","year":"2001","unstructured":"Dodge, M., Kitchin, R.: Atlas of Cyberspace. Addison-Wesley, Reading (2001)"},{"key":"34_CR10","volume-title":"Evolution of Networks, From Biological Nets to the Internet and WWW","author":"S.N. Dorogstev","year":"2003","unstructured":"Dorogstev, S.N., Mendes, J.F.F.: Evolution of Networks, From Biological Nets to the Internet and WWW. Oxford University Press, Oxford (2003)"},{"key":"34_CR11","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":"34_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M. Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. Journal of Graph Algorithms and Applications\u00a06(1), 115\u2013129 (2002)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J. Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graph and Combinatorics\u00a017, 717\u2013728 (2001)","journal-title":"Graph and Combinatorics"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing","author":"H.C. Purchase","year":"1997","unstructured":"Purchase, H.C.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 248\u2013261. Springer, Heidelberg (1997)"},{"issue":"2","key":"34_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0953-5438(00)00032-1","volume":"13","author":"H.C. Purchase","year":"2000","unstructured":"Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interacting with Computers\u00a013(2), 147\u2013162 (2000)","journal-title":"Interacting with Computers"},{"key":"34_CR16","volume-title":"Graph Drawing and Applications","author":"K. Sugiyama","year":"2002","unstructured":"Sugiyama, K.: Graph Drawing and Applications. World Scientific, Singapore (2002)"},{"issue":"2","key":"34_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0304-3975(98)00272-2","volume":"217","author":"R. Tamassia","year":"1999","unstructured":"Tamassia, R.: Advances in the theory and practice of graph drawing. Theoretical Computer Science\u00a0217(2), 235\u2013254 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"34_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"Tamassia, R., Di Battista, G., Batini, C.: Automatic graph drawing and readability of diagrams. IEEE Trans. Syst., Man and Cyber (SMC)\u00a018(1), 61\u201379 (1988)","journal-title":"IEEE Trans. Syst., Man and Cyber. (SMC)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T14:27:59Z","timestamp":1550327279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709039","9783540709046"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}