{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T08:26:25Z","timestamp":1769588785118,"version":"3.49.0"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031222023","type":"print"},{"value":"9783031222030","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-22203-0_23","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"319-335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Visualizing Evolving Trees"],"prefix":"10.1007","author":[{"given":"Kathryn","family":"Gray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0457-8091","authenticated-orcid":false,"given":"Mingwei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6830-9053","authenticated-orcid":false,"given":"Reyan","family":"Ahmed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0477-2724","authenticated-orcid":false,"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-68766-3_1","volume-title":"Graph Drawing and Network Visualization","author":"R Ahmed","year":"2020","unstructured":"Ahmed, R., De Luca, F., Devkota, S., Kobourov, S., Li, M.: Graph drawing via gradient descent, $$(GD)^2$$. In: GD 2020. LNCS, vol. 12590, pp. 3\u201317. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_1"},{"issue":"4","key":"23_CR2","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TVCG.2010.78","volume":"17","author":"D Archambault","year":"2010","unstructured":"Archambault, D., Purchase, H., Pinaud, B.: Animation, small multiples, and the effect of mental map preservation in dynamic graphs. IEEE Trans. Visual Comput. Graphics 17(4), 539\u2013552 (2010)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"issue":"3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1111\/cgf.12615","volume":"34","author":"B Bach","year":"2015","unstructured":"Bach, B., Henry-Riche, N., Dwyer, T., Madhyastha, T., Fekete, J.D., Grabowski, T.: Small multipiles: piling time to explore temporal patterns in dynamic networks. Comput. Graph. Forum 34(3), 31\u201340 (2015)","journal-title":"Comput. Graph. Forum"},{"issue":"5","key":"23_CR4","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/TVCG.2013.254","volume":"20","author":"B Bach","year":"2013","unstructured":"Bach, B., Pietriga, E., Fekete, J.D.: Graphdiaries: animated transitions and temporal navigation for dynamic networks. IEEE Trans. Vis. Comput. Graph. 20(5), 740\u2013754 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TVCG.2007.1000","volume":"13","author":"C Bachmaier","year":"2007","unstructured":"Bachmaier, C.: A radial adaptation of the sugiyama framework for visualizing hierarchical information. IEEE Trans. Vis. Comput. Graph. 13(3), 583\u2013594 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Bachmaier, C., Brandes, U., Schlieper, B.: Drawing phylogenetic trees. In: International Symposium on Algorithms and Computation, pp. 1110\u20131121 (2005)","DOI":"10.1007\/11602613_110"},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.jocs.2010.07.002","volume":"1","author":"D Balcan","year":"2010","unstructured":"Balcan, D., Gon\u00e7alves, B., Hu, H., Ramasco, J.J., Colizza, V., Vespignani, A.: Modeling the spatial spread of infectious diseases: the global epidemic and mobility computational model. J. Comput. Sci. 1(3), 132\u2013145 (2010)","journal-title":"J. Comput. Sci."},{"issue":"6096","key":"23_CR8","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J Barnes","year":"1986","unstructured":"Barnes, J., Hut, P.: A hierarchical o(n log n) force-calculation algorithm. Nature 324(6096), 446\u2013449 (1986)","journal-title":"Nature"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-07959-2_21","volume-title":"Experimental Algorithms","author":"L Barth","year":"2014","unstructured":"Barth, L., Kobourov, S.G., Pupyrev, S.: Experimental comparison of semantic word clouds. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 247\u2013258. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07959-2_21"},{"key":"23_CR10","unstructured":"Beck, F., Burch, M., Diehl, S., Weiskopf, D.: The state of the art in visualizing dynamic graphs. In: 16th Eurographics Conference on Visualization, (EuroVis). Eurographics Association (2014)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Beck, F., Burch, M., Diehl, S., Weiskopf, D.: A taxonomy and survey of dynamic graph visualization. In: Computer Graphics Forum. vol. 36(1), pp. 133\u2013159. Wiley Online Library (2017)","DOI":"10.1111\/cgf.12791"},{"issue":"12","key":"23_CR12","doi-asserted-by":"publisher","first-page":"2301","DOI":"10.1109\/TVCG.2011.185","volume":"17","author":"M Bostock","year":"2011","unstructured":"Bostock, M., Ogievetsky, V., Heer, J.: D$$^3$$ data-driven documents. IEEE Trans. Vis. Comput. Graph. 17(12), 2301\u20132309 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-25878-7_11","volume-title":"Graph Drawing","author":"U Brandes","year":"2012","unstructured":"Brandes, U., Mader, M.: A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 99\u2013110. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25878-7_11"},{"key":"23_CR14","unstructured":"Burch, M., M\u00fcller, C., Reina, G., Schmauder, H., Greis, M., Weiskopf, D.: Visualizing dynamic call graphs. In: Vision, Modeling, and Visualization (VMV), pp. 207\u2013214 (2012)"},{"issue":"5","key":"23_CR15","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539792235724","volume":"24","author":"RF Cohen","year":"1995","unstructured":"Cohen, R.F., Di Battista, G., Tamassia, R., Tollis, I.G.: Dynamic graph drawings: trees, series-parallel digraphs, and planar ST-digraphs. SIAM J. Comput. 24(5), 970\u20131001 (1995)","journal-title":"SIAM J. Comput."},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Cohen, R.F., Di Battista, G., Tamassia, R., Tollis, I.G., Bertolazzi, P.: A framework for dynamic graph drawing. In: Proceedings of the Eighth Annual Symposium on Computational Geometry, pp. 261\u2013270 (1992)","DOI":"10.1145\/142675.142728"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-319-27261-0_2","volume-title":"Graph Drawing and Network Visualization","author":"T Crnovrsanin","year":"2015","unstructured":"Crnovrsanin, T., Chu, J., Ma, K.-L.: An incremental layout method for visualizing online dynamic graphs. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 16\u201329. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_2"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Diehl, S., G\u00f6rg, C.: Graphs, they are changing. In: 10th International Symposium on Graph Drawing (GD), pp. 23\u201331 (2002)","DOI":"10.1007\/3-540-36151-0_3"},{"key":"23_CR19","unstructured":"Diehl, S., G\u00f6rg, C., Kerren, A.: Foresighted graph layout. Technical Report, University of Saarland (2000)"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Diehl, S., G\u00f6rg, C., Kerren, A.: Preserving the mental map using foresighted layout. In: Proceedings of Joint Eurographics - IEEE TCVG Symposium on Visualization (VisSym) (2001)","DOI":"10.1007\/978-3-7091-6215-6_19"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. (ed.) GD 1996. LNCS, vol. 1190, pp. 92\u2013100. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62495-3_40"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-24595-7_9","volume-title":"Graph Drawing","author":"C Erten","year":"2004","unstructured":"Erten, C., Harding, P.J., Kobourov, S.G., Wampler, K., Yee, G.: GraphAEL: Graph animations with evolving layouts. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 98\u2013110. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_9"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-540-24595-7_41","volume-title":"Graph Drawing","author":"C Erten","year":"2004","unstructured":"Erten, C., Kobourov, S.G., Le, V., Navabi, A.: Simultaneous graph drawing: layout algorithms and visualization schemes. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 437\u2013449. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_41"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-540-31843-9_47","volume-title":"Graph Drawing","author":"D Forrester","year":"2005","unstructured":"Forrester, D., Kobourov, S.G., Navabi, A., Wampler, K., Yee, G.V.: Graphael: a system for generalized force-directed layouts. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 454\u2013464. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_47"},{"issue":"4","key":"23_CR25","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1109\/TVCG.2008.11","volume":"14","author":"Y Frishman","year":"2008","unstructured":"Frishman, Y., Tal, A.: Online dynamic graph drawing. IEEE Trans. Vis. Comput. Graph. 14(4), 727\u2013740 (2008)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"23_CR26","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). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_25"},{"issue":"3","key":"23_CR27","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"ER Gansner","year":"1993","unstructured":"Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.P.: A technique for drawing directed graphs. IEEE Trans. Software Eng. 19(3), 214\u2013230 (1993)","journal-title":"IEEE Trans. Software Eng."},{"issue":"2","key":"23_CR28","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s13278-010-0002-8","volume":"1","author":"F Gilbert","year":"2011","unstructured":"Gilbert, F., Simonetto, P., Zaidi, F., Jourdan, F., Bourqui, R.: Communities and hierarchical structures in dynamic social networks: analysis and visualization. Soc. Netw. Anal. Min. 1(2), 83\u201395 (2011)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"8","key":"23_CR29","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1109\/TVCG.2011.142","volume":"18","author":"TE Gorochowski","year":"2011","unstructured":"Gorochowski, T.E., di Bernardo, M., Grierson, C.S.: Using aging to visually uncover evolutionary processes on networks. IEEE Trans. Vis. Comput. Graph. 18(8), 1343\u20131352 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"23_CR30","doi-asserted-by":"publisher","unstructured":"Gray, K., Li, M., Ahmed, R., Kobourov, S.: Visualizing evolving trees (2021). https:\/\/doi.org\/10.48550\/ARXIV.2106.08843, https:\/\/arxiv.org\/abs\/2106.08843","DOI":"10.48550\/ARXIV.2106.08843"},{"key":"23_CR31","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). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_29"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Hu, Y., Koren, Y.: Extending the spring-electrical model to overcome warping effects. In: 2009 IEEE Pacific Visualization Symposium, pp. 129\u2013136. IEEE (2009)","DOI":"10.1109\/PACIFICVIS.2009.4906847"},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Mutzel, P.: 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. In: Graph Algorithms and Applications I, pp. 3\u201327. World Scientific (2002)","DOI":"10.1142\/9789812777638_0001"},{"issue":"6","key":"23_CR34","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/65.10027","volume":"2","author":"G Kar","year":"1988","unstructured":"Kar, G., Madden, B., Gilbert, R.: Heuristic layout algorithms for network management presentation services. IEEE Network 2(6), 29\u201336 (1988)","journal-title":"IEEE Network"},{"key":"23_CR35","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. 2528, pp. 12\u201322. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36151-0_2"},{"key":"23_CR36","unstructured":"Keller, M.T.: Math genealogy project. https:\/\/genealogy.math.ndsu.nodak.edu\/"},{"key":"23_CR37","unstructured":"Maddison, D., Schulz, K., Lenards, A., Maddison, W.: Tree of life web project. http:\/\/tolweb.org\/tree\/"},{"issue":"2","key":"23_CR38","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Vis. Lang. Comput. 6(2), 183\u2013210 (1995)","journal-title":"J. Vis. Lang. Comput."},{"issue":"4","key":"23_CR39","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/52.56447","volume":"7","author":"S Moen","year":"1990","unstructured":"Moen, S.: Drawing dynamic trees. IEEE Softw. 7(4), 21\u201328 (1990)","journal-title":"IEEE Softw."},{"key":"23_CR40","unstructured":"Nguyen, Q.H.: INKA: an ink-based model of graph visualization. CoRR abs\/1801.07008 (2018)"},{"key":"23_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BFb0021824","volume-title":"Graph Drawing","author":"SC North","year":"1996","unstructured":"North, S.C.: Incremental layout in DynaDAG. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 409\u2013418. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021824"},{"key":"23_CR42","unstructured":"Pavlo, A., Homan, C., Schull, J.: A parent-centered radial layout algorithm for interactive graph visualization and animation. arXiv preprint cs\/0606007 (2006)"},{"key":"23_CR43","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 Purchase","year":"1997","unstructured":"Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248\u2013261. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63938-1_67"},{"key":"23_CR44","doi-asserted-by":"crossref","unstructured":"Simonetto, P., Archambault, D., Auber, D., Bourqui, R.: Impred: an improved force-directed algorithm that prevents nodes from crossing edges. In: Computer Graphics Forum, vol. 30(3), pp. 1071\u20131080. Wiley Online Library (2011)","DOI":"10.1111\/j.1467-8659.2011.01956.x"},{"issue":"7","key":"23_CR45","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1109\/TVCG.2018.2886901","volume":"26","author":"P Simonetto","year":"2018","unstructured":"Simonetto, P., Archambault, D., Kobourov, S.: Event-based dynamic graph visualisation. IEEE Trans. Vis. Comput. Graph. 26(7), 2373\u20132386 (2018)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"23_CR46","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":"JM Six","year":"1999","unstructured":"Six, J.M., Tollis, I.G.: A framework for circular drawings of networks. In: Kratochv\u00edyl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 107\u2013116. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46648-7_11"},{"key":"23_CR47","doi-asserted-by":"crossref","unstructured":"Skambath, M., Tantau, T.: Offline drawing of dynamic trees: algorithmics and document integration. CoRR abs\/1608.08385 (2016)","DOI":"10.1007\/978-3-319-50106-2_44"},{"issue":"2","key":"23_CR48","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. Syst. Man Cybern. 11(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"23_CR49","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-319-10377-8_13","volume-title":"Measuring Scholarly Impact","author":"NJ van Eck","year":"2014","unstructured":"van Eck, N.J., Waltman, L.: Visualizing bibliometric networks. In: Ding, Y., Rousseau, R., Wolfram, D. (eds.) Measuring Scholarly Impact, pp. 285\u2013320. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10377-8_13"},{"key":"23_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-45848-4_42","volume-title":"Graph Drawing","author":"R Wiese","year":"2002","unstructured":"Wiese, R., Eiglsperger, M., Kaufmann, M.: yFiles: visualization and automatic layout of graphs. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 453\u2013454. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45848-4_42"},{"key":"23_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1007\/978-3-540-24688-6_126","volume-title":"Computational Science - ICCS 2004","author":"D Workman","year":"2004","unstructured":"Workman, D., Bernard, M., Pothoven, S.: An incremental editor for dynamic hierarchical drawing of trees. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3038, pp. 986\u2013995. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24688-6_126"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22203-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T11:41:04Z","timestamp":1728733264000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.01","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.03","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}