{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:19:04Z","timestamp":1758824344699},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_15","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"165-176","source":"Crossref","is-referenced-by-count":19,"title":["Topology-Driven Force-Directed Algorithms"],"prefix":"10.1007","author":[{"given":"Walter","family":"Didimo","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Salvatore A.","family":"Romeo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","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.\u00a07, 303\u2013325 (1997)","journal-title":"Comput. Geom."},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-46648-7_36","volume-title":"Graph Drawing","author":"F. Bertault","year":"1999","unstructured":"Bertault, F.: A force-directed algorithm that preserves edge crossing properties. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 351\u2013358. Springer, Heidelberg (1999)"},{"issue":"8","key":"15_CR3","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/12.868028","volume":"49","author":"P. Bertolazzi","year":"2000","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEE Trans. on Computers\u00a049(8), 826\u2013840 (2000)","journal-title":"IEEE Trans. on Computers"},{"key":"15_CR4","volume-title":"Graph Drawing","author":"G. Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Upper Saddle River (1999)"},{"key":"15_CR5","first-page":"193","volume-title":"PacificVis","author":"W. Didimo","year":"2010","unstructured":"Didimo, W., Liotta, G., Romeo, S.A.: Graph visualization techniques for conceptual web site traffic analysis. In: PacificVis, pp. 193\u2013200. IEEE, Los Alamitos (2010)"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.7155\/jgaa.00068","volume":"7","author":"W. Didimo","year":"2003","unstructured":"Didimo, W., Pizzonia, M.: Upward embeddings and orientations of undirected planar graphs. J. Graph Algorithms Appl.\u00a07(2), 221\u2013241 (2003)","journal-title":"J. Graph Algorithms Appl."},{"key":"15_CR7","unstructured":"Dunne, C., Shneiderman, B.: Improving graph drawing readability by incorporating readability metrics: A software tool for network analysts. Technical report (2009)"},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1111\/j.1467-8659.2009.01449.x","volume":"28","author":"T. Dwyer","year":"2009","unstructured":"Dwyer, T.: Scalable, versatile and simple constrained graph layout. Comput. Graph. Forum\u00a028(3), 991\u2013998 (2009)","journal-title":"Comput. Graph. Forum."},{"issue":"6","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/TVCG.2008.130","volume":"14","author":"T. Dwyer","year":"2008","unstructured":"Dwyer, T., Marriott, K., Schreiber, F., Stuckey, P.J., Woodward, M., Wybrow, M.: Exploration of networks using overview+detail with constraint-based cooperative layout. IEEE Trans. Vis. Comput. Graph.\u00a014(6), 1293\u20131300 (2008)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-00219-9_22","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2009","unstructured":"Dwyer, T., Marriott, K., Wybrow, M.: Topology preserving constrained graph layout. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 230\u2013241. Springer, Heidelberg (2009)"},{"key":"15_CR11","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congressus Numerantium\u00a042, 149\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-31843-9_46","volume-title":"Graph Drawing","author":"B. Finkel","year":"2005","unstructured":"Finkel, B., Tamassia, R.: Curvilinear graph drawing using the force-directed method. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 448\u2013453. Springer, Heidelberg (2005)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Graph Drawing","author":"U. F\u00f6\u00dfmeier","year":"1996","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 254\u2013266. Springer, Heidelberg (1996)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-62495-3_49","volume-title":"Graph Drawing","author":"A. Garg","year":"1997","unstructured":"Garg, A., Tamassia, R.: A new minimum cost flow algorithm with applications to graph drawing. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 201\u2013216. Springer, Heidelberg (1997)"},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00453-004-1128-8","volume":"41","author":"C. Gutwenger","year":"2005","unstructured":"Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. Algorithmica\u00a041(4), 289\u2013308 (2005)","journal-title":"Algorithmica"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-31843-9_29","volume-title":"Graph Drawing","author":"S. Hachul","year":"2005","unstructured":"Hachul, S., J\u00fcnger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 285\u2013295. Springer, Heidelberg (2005)"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"345","DOI":"10.7155\/jgaa.00150","volume":"11","author":"S. Hachul","year":"2007","unstructured":"Hachul, S., J\u00fcnger, M.: Large-graph layout algorithms at work: An experimental study. J. Graph Algorithms Appl.\u00a011(2), 345\u2013369 (2007)","journal-title":"J. Graph Algorithms Appl."},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Huang, W.: Using eye tracking to investigate graph layout effects. In: APVIS, pp. 97\u2013100 (2007)","DOI":"10.1109\/APVIS.2007.329282"},{"key":"15_CR19","first-page":"41","volume-title":"PacificVis","author":"W. Huang","year":"2008","unstructured":"Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: PacificVis, pp. 41\u201346. IEEE, Los Alamitos (2008)"},{"volume-title":"Drawing Graphs","year":"2001","key":"15_CR20","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. Springer, Heidelberg (2001)"},{"key":"15_CR21","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":"3","key":"15_CR22","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1016344215610","volume":"7","author":"H.C. Purchase","year":"2002","unstructured":"Purchase, H.C., Carrington, D.A., Allder, J.-A.: Empirical evaluation of aesthetics-based graph layout. Empirical Software Engineering\u00a07(3), 233\u2013255 (2002)","journal-title":"Empirical Software Engineering"},{"issue":"3","key":"15_CR23","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"15_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C. Ware","year":"2002","unstructured":"Ware, C., Purchase, H.C., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Information Visualization\u00a01(2), 103\u2013110 (2002)","journal-title":"Information Visualization"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:33:46Z","timestamp":1558424026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}