{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T15:10:48Z","timestamp":1782313848808,"version":"3.54.5"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319739144","type":"print"},{"value":"9783319739151","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_31","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"394-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Drawing Dynamic Graphs Without Timeslices"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Simonetto","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Archambault","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"31_CR1","unstructured":"Citevis citation datafile. http:\/\/www.cc.gatech.edu\/gvu\/ii\/citevis\/infovis-citation-data.txt. Accessed 28 Aug 2017"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-642-36763-2_42","volume-title":"Graph Drawing","author":"D Archambault","year":"2013","unstructured":"Archambault, D., Purchase, H.C.: Mental map preservation helps user orientation in dynamic graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 475\u2013486. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_42"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.ins.2015.04.017","volume":"330","author":"D Archambault","year":"2016","unstructured":"Archambault, D., Purchase, H.C.: Can animation support the visualization of dynamic graphs? Inf. Sci. 330, 495\u2013509 (2016)","journal-title":"Inf. Sci."},{"issue":"4","key":"31_CR4","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TVCG.2010.78","volume":"17","author":"D Archambault","year":"2011","unstructured":"Archambault, D., Purchase, H.C., Pinaud, B.: Animation, small multiples, and the effect of mental map preservation in dynamic graphs. IEEE Trans. Vis. Comput. Graph. 17(4), 539\u2013552 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Bach, B., Dragicevic, P., Archambault, D., Hurter, C., Carpendale, S.: A descriptive framework for temporal data visualizations based on generalized space-time cubes. In: Computer Graphics Forum (2016)","DOI":"10.1111\/cgf.12804"},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/TVCG.2015.2467851","volume":"22","author":"B Bach","year":"2016","unstructured":"Bach, B., Shi, C., Heulot, N., Madhyastha, T., Grabowski, T., Dragicevic, P.: Time curves: folding time to visualize patterns of temporal evolution in data. IEEE Trans. Vis. Comput. Graphics (InfoVis 2015) 22(1), 559\u2013568 (2016)","journal-title":"IEEE Trans. Vis. Comput. Graphics (InfoVis 2015)"},{"key":"31_CR7","unstructured":"Beck, F., Burch, M., Diehl, S., Weiskopf, D.: The state of the art in visualizing dynamic graphs. In: Borgo, R., Maciejewski, R., Viola, I. (eds.) EuroVis - STARSs. The Eurographics Association (2014)"},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1057\/palgrave.ivs.9500037","volume":"2","author":"U Brandes","year":"2003","unstructured":"Brandes, U., Corman, S.R.: Visual unrolling of network evolution and the analysis of dynamic discourse. Inform. Vis. 2(1), 40\u201350 (2003)","journal-title":"Inform. Vis."},{"key":"31_CR9","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":"31_CR10","series-title":"Mathematics and Visualization","doi-asserted-by":"publisher","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.: Analysis and visualization of social networks. In: J\u00fcnger, M., Mutzel, P. (eds.) Graph Drawing Software. Mathematics and Visualization, pp. 321\u2013340. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-642-18638-7_15"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BFb0021794","volume-title":"Graph Drawing","author":"I Bru\u00df","year":"1996","unstructured":"Bru\u00df, I., Frick, A.: Fast interactive 3-D graph visualization. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 99\u2013110. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021794"},{"issue":"12","key":"31_CR12","doi-asserted-by":"publisher","first-page":"2344","DOI":"10.1109\/TVCG.2011.226","volume":"17","author":"M Burch","year":"2011","unstructured":"Burch, M., Vehlow, C., Beck, F., Diehl, S., Weiskopf, D.: Parallel edge splatting for scalable dynamic graph visualization. IEEE Trans Vis. Comput. Graphics (InfoVis 2011) 17(12), 2344\u20132353 (2011)","journal-title":"IEEE Trans Vis. Comput. Graphics (InfoVis 2011)"},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/TVCG.2016.2599107","volume":"23","author":"M Cordeil","year":"2017","unstructured":"Cordeil, M., Dwyer, T., Klein, K., Laha, B., Marriott, K., Thomas, B.H.: Immersive collaborative analysis of network connectivity: CAVE-style or head-mounted display? IEEE Trans. Vis. Comput. Graphics (InfoVis 2016) 23(1), 441\u2013450 (2017)","journal-title":"IEEE Trans. Vis. Comput. Graphics (InfoVis 2016)"},{"key":"31_CR14","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":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BFb0021800","volume-title":"Graph Drawing","author":"IF Cruz","year":"1996","unstructured":"Cruz, I.F., Twarog, J.P.: 3D graph drawing with simulated annealing. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 162\u2013165. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021800"},{"issue":"4","key":"31_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R Davidson","year":"1996","unstructured":"Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Trans. Graphics 15(4), 301\u2013331 (1996)","journal-title":"ACM Trans. Graphics"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-36151-0_3","volume-title":"Graph Drawing","author":"S Diehl","year":"2002","unstructured":"Diehl, S., G\u00f6rg, C.: Graphs, they are changing. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 23\u201331. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36151-0_3"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Diehl, S., G\u00f6rg, C., Kerren, A.: Preserving the mental map using foresighted layout. In Eurographics\/IEEE VGTC Symposium on Visualization (VisSym 2001), pp. 175\u2013184 (2001)","DOI":"10.1007\/978-3-7091-6215-6_19"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Dwyer, T., Eades, P.: Visualising a fund manager flow graph with columns and worms. In: Proceedings of the International Conference on Information Visualisation (IV 2002), pp. 147\u2013152 (2002)","DOI":"10.1109\/IV.2002.1028770"},{"key":"31_CR20","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":"31_CR21","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"},{"issue":"1","key":"31_CR22","first-page":"47","volume":"10","author":"M Farrugia","year":"2011","unstructured":"Farrugia, M., Quigley, A.: Effective temporal graph layout: a comparative study of animation versus static display methods. J. Inform. Vis. 10(1), 47\u201364 (2011)","journal-title":"J. Inform. Vis."},{"key":"31_CR23","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"},{"key":"31_CR24","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). https:\/\/doi.org\/10.1007\/3-540-58950-3_393"},{"issue":"4","key":"31_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. Graphics 14(4), 727\u2013740 (2008)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"31_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-44541-2_21","volume-title":"Graph Drawing","author":"P Gajer","year":"2001","unstructured":"Gajer, P., Kobourov, S.G.: GRIP: graph drawing with intelligent placement. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 222\u2013228. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44541-2_21"},{"issue":"6","key":"31_CR27","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/TVCG.2012.299","volume":"19","author":"ER Gansner","year":"2013","unstructured":"Gansner, E.R., Hu, Y.: A maxent-stress model for graph layout. IEEE Trans. Vis. Comput. Graphics 19(6), 927\u2013940 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"8","key":"31_CR28","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1109\/TVCG.2011.142","volume":"18","author":"TE Gorochowski","year":"2012","unstructured":"Gorochowski, T.E., Di Bernardo, M., Grierson, C.S.: Using aging to visually uncover evolutionary processes on networks. IEEE Trans. Vis. Comput. Graphics 18(8), 1343\u20131352 (2012)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"31_CR29","doi-asserted-by":"crossref","unstructured":"Grayson, S., Wade, K., Meaney, G., Greene, D.: Sensibility of different sliding windows in constructing co-occurrence networks from literature. In: Bozic, B., Mendel-Gleason, G., Debruyne, C., O\u2019Sullivan, D. (eds.) Proceedings of 2nd International Workshop on Computational History and Data-Driven Humanities, pp. 65\u201377 (2016)","DOI":"10.1007\/978-3-319-46224-0_7"},{"key":"31_CR30","unstructured":"Groh, G., Hanstein, H., W\u00f6rndl, W.: Interactively visualizing dynamic social networks with DySoN. In: Workshop on Visual Interfaces to the Social and the Semantic Web (VISSW 2009), February 2009"},{"key":"31_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":"31_CR32","doi-asserted-by":"crossref","unstructured":"Itoh, M., Yoshinaga, N., Toyoda, M., Kitsuregawa, M.: Analysis and visualization of temporal changes in bloggers\u2019 activities and interests. In: IEEE Pacific Visualization Symposium (PacificVis 2012), pp. 57\u201364 (2012)","DOI":"10.1109\/PacificVis.2012.6183574"},{"key":"31_CR33","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). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_20"},{"key":"31_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-44969-8_7","volume-title":"Drawing Graphs","author":"B Landgraf","year":"2001","unstructured":"Landgraf, B.: 3D graph drawing. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol. 2025, pp. 172\u2013192. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44969-8_7"},{"issue":"2","key":"31_CR35","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1037\/0096-1523.31.2.235","volume":"31","author":"G Liu","year":"2005","unstructured":"Liu, G., Austen, E.L., Booth, K.S., Fisher, B.D., Argue, R., Rempel, M.I., Enns, J.T.: Multiple-object tracking is based on scene, not retinal, coordinates. J. Exp. Psychol. Hum. Percept. Perform. 31(2), 235\u2013247 (2005)","journal-title":"J. Exp. Psychol. Hum. Percept. Perform."},{"key":"31_CR36","doi-asserted-by":"crossref","unstructured":"Liu, Q., Hu, Y., Shi, L., Mu, X., Zhang, Y., Tang, J.: EgoNetCloud: event-based egocentric dynamic network visualization. In: Proceedings of the IEEE Conference on Visual Analytics Science and Technology (VAST 2015), pp. 65\u201372. IEEE Computer Society (2015)","DOI":"10.1109\/VAST.2015.7347632"},{"issue":"2","key":"31_CR37","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. Visual Lang. Comput. 6(2), 183\u2013210 (1995)","journal-title":"J. Visual Lang. Comput."},{"key":"31_CR38","unstructured":"Munzner, T.: H3: laying out large directed graphs in 3D hyperbolic space. In: Proceedings of the IEEE Symposium on Information Visualization (InfoVis 1997), pp. 2\u201310, 1997"},{"key":"31_CR39","doi-asserted-by":"publisher","DOI":"10.1037\/13156-000","volume-title":"The Acquaintance Process","author":"TM Newcomb","year":"1961","unstructured":"Newcomb, T.M.: The Acquaintance Process. New York, Holt, Reinhard & Winston (1961)"},{"key":"31_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-50106-2_2","volume-title":"Graph Drawing and Network Visualization","author":"M Ortmann","year":"2016","unstructured":"Ortmann, M., Klimenta, M., Brandes, U.: A sparse stress model. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 18\u201332. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_2"},{"issue":"3","key":"31_CR41","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/jvlc.1998.0086","volume":"9","author":"G Parker","year":"1998","unstructured":"Parker, G., Franck, G., Ware, C.: Visualization of large nested graphs in 3D: navigation and interaction. J. Visual Lang. Comput. 9(3), 299\u2013317 (1998)","journal-title":"J. Visual Lang. Comput."},{"issue":"3","key":"31_CR42","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1163\/156856888X00122","volume":"3","author":"ZW Pylyshyn","year":"1988","unstructured":"Pylyshyn, Z.W., Storm, R.W.: Tracking multiple independant targets: Evidence for a parallel tracking mechanism. Spat. Vis. 3(3), 179\u2013197 (1988)","journal-title":"Spat. Vis."},{"key":"31_CR43","unstructured":"Rauber, P.E., Falc\u00e3o, A.X., Telea, A.C.: Visualizing time-dependent data using dynamic t-SNE. In: Bertini, E., Elmqvist, N., Wischgoll, T. (eds.) EuroVis 2016, Short Papers. Eurographics Association (2016)"},{"key":"31_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-36763-2_43","volume-title":"Graph Drawing","author":"A Sallaberry","year":"2013","unstructured":"Sallaberry, A., Muelder, C., Ma, K.-L.: Clustering, visualizing, and navigating for large dynamic graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 487\u2013498. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_43"},{"issue":"5","key":"31_CR45","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/TVCG.2006.166","volume":"12","author":"B Shneiderman","year":"2006","unstructured":"Shneiderman, B., Aris, A.: Network visualization by semantic substrates. IEEE Trans. Vis. Comput. Graphics (InfoVis 2006) 12(5), 733\u2013740 (2006)","journal-title":"IEEE Trans. Vis. Comput. Graphics (InfoVis 2006)"},{"issue":"3","key":"31_CR46","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1111\/j.1467-8659.2011.01956.x","volume":"30","author":"P Simonetto","year":"2011","unstructured":"Simonetto, P., Archambault, D., Auber, D., Bourqui, R.: ImPrEd: an improved force-directed algorithm that prevents nodes from crossing edges. Comput. Graphics Forum (EuroVis 2011) 30(3), 1071\u20131080 (2011)","journal-title":"Comput. Graphics Forum (EuroVis 2011)"},{"issue":"1","key":"31_CR47","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1109\/TVCG.2015.2467992","volume":"22","author":"P Simonetto","year":"2016","unstructured":"Simonetto, P., Archambault, D., Scheidegger, C.: A simple approach for boundary improvement of Euler diagrams. IEEE Trans. Vis. Comput. Graphics (InfoVis 2015) 22(1), 678\u2013687 (2016)","journal-title":"IEEE Trans. Vis. Comput. Graphics (InfoVis 2015)"},{"issue":"4","key":"31_CR48","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/ijhc.2002.1017","volume":"57","author":"B Tversky","year":"2002","unstructured":"Tversky, B., Morrison, J., Betrancourt, M.: Animation: can it facilitate? Int. J. Hum Comput Stud. 57(4), 247\u2013262 (2002)","journal-title":"Int. J. Hum Comput Stud."},{"issue":"8","key":"31_CR49","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1109\/TVCG.2013.263","volume":"20","author":"S van den Elzen","year":"2014","unstructured":"van den Elzen, S., Holten, D., Blaas, J., van Wijk, J.J.: Dynamic network visualization with extended massive sequence views. IEEE Trans. Vis. Comput. Graphics 20(8), 1087\u20131099 (2014)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"1","key":"31_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TVCG.2015.2468078","volume":"22","author":"S van den Elzen","year":"2016","unstructured":"van den Elzen, S., Holten, D., Blaas, J., van Wijk, J.J.: Reducing snapshots to points: a visual analytics approach to dynamic network exploration. IEEE Trans. Vis. Comput. Graphics 22(1), 1\u201310 (2016)","journal-title":"IEEE Trans. Vis. Comput. Graphics"}],"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-319-73915-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T23:09:19Z","timestamp":1751238559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","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":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}