{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T23:06:08Z","timestamp":1775257568093,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540709039","type":"print"},{"value":"9783540709046","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70904-6_37","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T15:44:43Z","timestamp":1179416683000},"page":"386-398","source":"Crossref","is-referenced-by-count":59,"title":["Improved Circular Layouts"],"prefix":"10.1007","author":[{"given":"Emden R.","family":"Gansner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehuda","family":"Koren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/978-3-540-30559-0_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Baur","year":"2004","unstructured":"Baur, M., Brandes, U.: Crossing Reduction in Circular Layouts. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 332\u2013343. Springer, Heidelberg (2004)"},{"key":"37_CR2","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. Comput. Geom. Theory Appl.\u00a07, 303\u2013325 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Graph Drawing","author":"M. Dickerson","year":"2004","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.: Confluent drawings: Visualizing Non-Planar Diagrams in a Planar Way. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 1\u201312. Springer, Heidelberg (2004)"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/3-540-62495-3_40","volume-title":"Graph Drawing","author":"U. Do\u011frus\u00f6z","year":"1997","unstructured":"Do\u011frus\u00f6z, U., Madden, B., Madden, P.: Circular layout in the Graph Layout Toolkit. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 92\u2013100. Springer, Heidelberg (1997)"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/351827.351829","volume":"5","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. Journal of Experimental Algorithmics\u00a05, 1\u201323 (2000)","journal-title":"Journal of Experimental Algorithmics"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/978-3-540-24749-4_35","volume-title":"STACS 2004","author":"M.K. Ganapathy","year":"2004","unstructured":"Ganapathy, M.K., Lodha, S.: On Minimum Circular Arrangement. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 394\u2013405. Springer, Heidelberg (2004)"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","volume-title":"Graph Drawing","author":"E.R. Gansner","year":"2005","unstructured":"Gansner, E.R., Koren, Y., North, S.: Graph Drawing by Stress Majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 239\u2013250. Springer, Heidelberg (2005)"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1002\/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N","volume":"30","author":"E.R. Gansner","year":"2000","unstructured":"Gansner, E.R., North, S.: An Open Graph Visualization system and its Applications to Software Engineering. Software - Practice & Experience\u00a030, 1203\u20131233 (2000), also, \n                    \n                      www.graphviz.org","journal-title":"Software - Practice & Experience"},{"key":"37_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP Completeness. Freeman, New York (1979)"},{"key":"37_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","volume":"17","author":"K.M. Hall","year":"1970","unstructured":"Hall, K.M.: An r-dimensional Quadratic Placement Algorithm. Management Science\u00a017, 219\u2013229 (1970)","journal-title":"Management Science"},{"key":"37_CR11","unstructured":"Holten, D., van Wijk, J.J.: Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data. In: Proc. IEEE Information Visualization (InfoVis\u201906), IEEE Computer Society Press, Los Alamitos ( to appear)"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Kar, G., Madden, B., Gilbert, R.S.: Heuristic Layout Algorithms for Network Management Presentation Services. IEEE Network, 29\u201336 (1988)","DOI":"10.1109\/65.10027"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/3-540-36151-0_2","volume-title":"Graph Drawing","author":"M. Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Maintaining the Mental Map for Circular Drawings. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 12\u201322. Springer, Heidelberg (2002)"},{"key":"37_CR14","first-page":"1129","volume-title":"Proc. IEEE INFOCOM 2002","author":"V. Liberatore","year":"2002","unstructured":"Liberatore, V.: Multicast Scheduling for List Requests. In: Proc. IEEE INFOCOM 2002, pp. 1129\u20131137. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"37_CR15","first-page":"292","volume-title":"Proc. IEEE International Symposium on Circuits and Systems","author":"S. Masuda","year":"1987","unstructured":"Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T.: On the NP-Completeness of a Computer Network Layout Problem. In: Proc. IEEE International Symposium on Circuits and Systems, pp. 292\u2013295. IEEE Computer Society Press, Los Alamitos (1987)"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Newbery, F.J.: Edge Concentration: A Method for Clustering Directed Graphs. In: Proc. 2nd Intl. Workshop Software Configuration Management, pp. 76\u201385 (1989)","DOI":"10.1145\/72910.73350"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Six, J.M., Tollis, I.G.: Circular Drawings of Biconnected Graphs. In: Proc. Algorithms Engineering and Experimentation (ALENEX\u201999), pp. 57\u201373 (1999)","DOI":"10.1007\/3-540-48518-X_4"},{"key":"37_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-46648-7_11","volume-title":"Graph Drawing","author":"J.M. Six","year":"1999","unstructured":"Six, J.M., Tollis, I.G.: A Framework for Circular Drawings of Networks. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 107\u2013116. Springer, Heidelberg (1999)"},{"key":"37_CR19","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 Systems. IEEE Trans. Systems, Man, and Cybernetics\u00a011, 109\u2013125 (1981)","journal-title":"IEEE Trans. Systems, Man, and Cybernetics"},{"key":"37_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/978-3-540-30547-7_47","volume-title":"Biological and Medical Data Analysis","author":"A. Symeonidis","year":"2004","unstructured":"Symeonidis, A., Tollis, I.G.: Visualization of Biological Information with Circular Drawings. In: Barreiro, J.M., Mart\u00edn-S\u00e1nchez, F., Maojo, V., Sanz, F. (eds.) ISBMDA 2004. LNCS, vol.\u00a03337, pp. 468\u2013478. Springer, Heidelberg (2004)"},{"key":"37_CR21","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to Draw a Graph. Proc. London Mathematical Society\u00a013, 743\u2013768 (1963)","journal-title":"Proc. London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:33Z","timestamp":1605762693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709039","9783540709046"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_37","relation":{},"subject":[]}}