{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T04:34:19Z","timestamp":1769574859088,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319539249","type":"print"},{"value":"9783319539256","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_11","type":"book-chapter","created":{"date-parts":[[2017,2,20]],"date-time":"2017-02-20T01:12:36Z","timestamp":1487553156000},"page":"135-148","source":"Crossref","is-referenced-by-count":3,"title":["An Experimental Study on the Ply Number of Straight-Line Drawings"],"prefix":"10.1007","author":[{"given":"Felice","family":"De Luca","sequence":"first","affiliation":[]},{"given":"Emilio","family":"Di Giacomo","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-50106-2_19","volume-title":"Graph Drawing and Network Visualization","author":"P Angelini","year":"2016","unstructured":"Angelini, P., Bekos, M.A., Bruckdorfer, T., Han\u010dl, J., Kaufmann, M., Kobourov, S., Symvonis, A., Valtr, P.: Low ply drawings of trees. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 236\u2013248. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-50106-2_19"},{"issue":"5439","key":"11_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"11_CR3","unstructured":"Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks (2009). http:\/\/www.aaai.org\/ocs\/index.php\/ICWSM\/09\/paper\/view\/154"},{"issue":"6","key":"11_CR4","first-page":"651","volume":"36","author":"C Buchheim","year":"2006","unstructured":"Buchheim, C., J\u00fcnger, M., Leipert, S.: Drawing rooted trees in linear time. Softw.: Pract. Exp. 36(6), 651\u2013665 (2006)","journal-title":"Softw.: Pract. Exp."},{"issue":"1","key":"11_CR5","first-page":"1145","volume":"14","author":"L Chen","year":"2013","unstructured":"Chen, L., Buja, A.: Stress functions for nonlinear dimension reduction, proximity analysis, and graph drawing. J. Mach. Learn. Res. 14(1), 1145\u20131173 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"11_CR6","first-page":"543","volume-title":"Handbook of Graph Drawing and Visualization","author":"M Chimani","year":"2013","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, pp. 543\u2013569. CRC Press, Boca Raton (2013)"},{"issue":"03","key":"11_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"07","author":"M Chrobak","year":"1997","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Int. J. Comput. Geom. Appl. 07(03), 211\u2013223 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"11_CR8","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, Upper Saddle River (1999)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E., Didimo, W., Hong, S.H., Kaufmann, M., Kobourov, S.G., Liotta, G., Misue, K., Symvonis, A., Yen, H.C.: Low ply graph drawing. In: IISA 2015, pp. 1\u20136. IEEE (2015)","DOI":"10.1109\/IISA.2015.7388020"},{"key":"11_CR10","first-page":"35","volume-title":"Graph Visualization and Data Mining","author":"W Didimo","year":"2007","unstructured":"Didimo, W., Liotta, G.: Mining graph data. In: Cook, D.J., Holder, L.B. (eds.) Graph Visualization and Data Mining, pp. 35\u201364. Wiley, Hoboken (2007)"},{"issue":"6","key":"11_CR11","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1109\/TVCG.2009.109","volume":"15","author":"T Dwyer","year":"2009","unstructured":"Dwyer, T., Lee, B., Fisher, D., Quinn, K.I., Isenberg, P., Robertson, G.G., North, C.: A comparison of user-generated and automatic graph layouts. IEEE Trans. Vis. Comput. Graph. 15(6), 961\u2013968 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"11_CR12","first-page":"146","volume":"42","author":"P Eades","year":"1984","unstructured":"Eades, P.: A heuristics for graph drawing. Congressus Numerantium 42, 146\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Goodrich, M.T.: Studying (non-planar) road networks through an algorithmic lens. In: GIS 2008, pp. 1\u201310. ACM (2008)","DOI":"10.1145\/1463434.1463455"},{"issue":"1","key":"11_CR14","doi-asserted-by":"crossref","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 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-58950-3_393","volume-title":"Graph Drawing","author":"A Frick","year":"1995","unstructured":"Frick, A., Ludwig, A., Mehldau, H.: A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration). In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 388\u2013403. Springer, Heidelberg (1995). doi: 10.1007\/3-540-58950-3_393"},{"issue":"11","key":"11_CR16","first-page":"1129","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw.: Pract. Exp. 21(11), 1129\u20131164 (1991)","journal-title":"Softw.: Pract. Exp."},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","volume-title":"Graph Drawing","author":"ER Gansner","year":"2005","unstructured":"Gansner, E.R., Koren, Y., North, S.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 239\u2013250. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-31843-9_25"},{"key":"11_CR18","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. 3383, pp. 285\u2013295. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-31843-9_29"},{"issue":"2","key":"11_CR19","doi-asserted-by":"crossref","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. 11(2), 345\u2013369 (2007)","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using networkX. In: Varoquaux, G., Vaught, T., Millman, J. (eds.) Proceedings of the 7th Python in Science Conference, Pasadena, CA, USA, pp. 11\u201315 (2008)","DOI":"10.25080\/TCWV9851"},{"issue":"2","key":"11_CR21","doi-asserted-by":"crossref","first-page":"397","DOI":"10.7155\/jgaa.00152","volume":"11","author":"W Huang","year":"2007","unstructured":"Huang, W., Hong, S.H., Eades, P.: Effects of sociogram drawing conventions and edge crossings in social network visualization. J. Graph Algorithms Appl. 11(2), 397\u2013429 (2007)","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR22","volume-title":"Graph Drawing Software","year":"2003","unstructured":"J\u00fcnger, M., Mutzel, P. (eds.): Graph Drawing Software. Springer, Heidelberg (2003)"},{"issue":"1","key":"11_CR23","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31(1), 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"11_CR24","first-page":"383","volume-title":"Handbook of Graph Drawing and Visualization","author":"SG Kobourov","year":"2013","unstructured":"Kobourov, S.G.: Force-directed drawing algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, pp. 383\u2013408. CRC Press, Boca Raton (2013)"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-662-45803-7_20","volume-title":"Graph Drawing","author":"SG Kobourov","year":"2014","unstructured":"Kobourov, S.G., Pupyrev, S., Saket, B.: Are crossings important for drawing large graphs? In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 234\u2013245. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45803-7_20"},{"key":"11_CR26","doi-asserted-by":"crossref","DOI":"10.4135\/9781412985130","volume-title":"Multidimensional Scaling","author":"JB Kruskal","year":"1978","unstructured":"Kruskal, J.B., Wish, M.: Multidimensional Scaling. Sage Press, Thousand Oaks (1978)"},{"issue":"2","key":"11_CR27","doi-asserted-by":"crossref","first-page":"453","DOI":"10.7155\/jgaa.00154","volume":"11","author":"A Noack","year":"2007","unstructured":"Noack, A.: Energy models for graph clustering. J. Graph Algorithms Appl. 11(2), 453\u2013480 (2007)","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR28","first-page":"742","volume":"27","author":"H Pr\u00fcfer","year":"1918","unstructured":"Pr\u00fcfer, H.: Neuer beweis eines satzes\u00fcber permutationen. Arch. Math. Phys. 27, 742\u2013744 (1918)","journal-title":"Arch. Math. Phys."},{"issue":"2","key":"11_CR29","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0953-5438(00)00032-1","volume":"13","author":"HC Purchase","year":"2000","unstructured":"Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interact. Comput. 13(2), 147\u2013162 (2000)","journal-title":"Interact. Comput."},{"issue":"3","key":"11_CR30","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1016344215610","volume":"7","author":"HC Purchase","year":"2002","unstructured":"Purchase, H.C., Carrington, D.A., Allder, J.A.: Empirical evaluation of aesthetics-based graph layout. Empir. Softw. Eng. 7(3), 233\u2013255 (2002)","journal-title":"Empir. Softw. Eng."},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Trans. Softw. Eng. SE-7(2), 223\u2013228 (1981)","DOI":"10.1109\/TSE.1981.234519"},{"issue":"1","key":"11_CR32","doi-asserted-by":"crossref","first-page":"72","DOI":"10.2307\/1412159","volume":"15","author":"C Spearman","year":"1904","unstructured":"Spearman, C.: The proof and measurement of association between two things. Am. J. Psychol. 15(1), 72\u201399 (1904)","journal-title":"Am. J. Psychol."},{"key":"11_CR33","volume-title":"Handbook of Graph Drawing and Visualization","year":"2013","unstructured":"Tamassia, R. (ed.): Handbook of Graph Drawing and Visualization. CRC Press, Boca Raton (2013)"},{"issue":"7","key":"11_CR34","first-page":"685","volume":"20","author":"JQ Walker","year":"1990","unstructured":"Walker, J.Q.: A node-positioning algorithm for general trees. Softw.: Pract. Exp. 20(7), 685\u2013705 (1990)","journal-title":"Softw.: Pract. Exp."},{"issue":"2","key":"11_CR35","doi-asserted-by":"crossref","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. Inf. Vis. 1(2), 103\u2013110 (2002)","journal-title":"Inf. Vis."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T14:13:15Z","timestamp":1749996795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}