{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:33:34Z","timestamp":1743107614010,"version":"3.40.3"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031222023"},{"type":"electronic","value":"9783031222030"}],"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_20","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"271-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Time and\u00a0Space: An Experimental Study on\u00a0Graph Structural and\u00a0Temporal Encodings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9592-2179","authenticated-orcid":false,"given":"Velitchko","family":"Filipov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2008-3651","authenticated-orcid":false,"given":"Alessio","family":"Arleo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8337-4774","authenticated-orcid":false,"given":"Markus","family":"B\u00f6gl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4427-5703","authenticated-orcid":false,"given":"Silvia","family":"Miksch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"20_CR1","unstructured":"Surveyjs - survey and form javascript libraries. https:\/\/surveyjs.io\/. Accessed 09 Sept 2022"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Ahn, J.W., Plaisant, C., Shneiderman, B.: A task taxonomy for network evolution analysis. IEEE Trans. Vis. Comput. Graphics 20(3), 365\u2013376 (2014)","DOI":"10.1109\/TVCG.2013.238"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Archambault, D., Purchase, H., Pinaud, B.: Animation, small multiples, and the effect of mental map preservation in dynamic graphs. IEEE Trans. Vis. Comput. Graphics 17, 539-552 (2011)","DOI":"10.1109\/TVCG.2010.78"},{"key":"20_CR5","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"},{"issue":"11","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1016\/j.ijhcs.2013.08.004","volume":"71","author":"D Archambault","year":"2013","unstructured":"Archambault, D., Purchase, H.C.: The map in the mental map: experimental results in dynamic graph drawing. Int. J. Hum Comput Stud. 71(11), 1044\u20131055 (2013)","journal-title":"Int. J. Hum Comput Stud."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Archambault, D., Purchase, H.C.: Can animation support the visualisation of dynamic graphs? Inf. Sci. 330, 495\u2013509 (2016)","DOI":"10.1016\/j.ins.2015.04.017"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Arleo, A., Miksch, S., Archambault, D.: Event-based dynamic graph drawing without the agonizing pain. Computer Graphics Forum. 41, 226\u2013244 (2022). Wiley Online Library (2022)","DOI":"10.1111\/cgf.14615"},{"key":"20_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46087-0","volume-title":"Fortgeschrittene Multivariate Analysemethoden","author":"K Backhaus","year":"2015","unstructured":"Backhaus, K., Erichson, B., Weiber, R.: Fortgeschrittene Multivariate Analysemethoden. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46087-0"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks. In: Proceedings of the International AAAI Conference on Web and Social Media, vol. 3, pp. 361\u2013362 (2009)","DOI":"10.1609\/icwsm.v3i1.13937"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/3-540-45848-4_47","volume-title":"Graph Drawing","author":"M Baur","year":"2002","unstructured":"Baur, M., et al.: Visone software for visual social network analysis. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 463\u2013464. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45848-4_47"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1111\/cgf.12791","volume":"36","author":"F Beck","year":"2017","unstructured":"Beck, F., Burch, M., Diehl, S., Weiskopf, D.: A taxonomy and survey of dynamic graph visualization. Comput. Graphics Forum 36(1), 133\u2013159 (2017)","journal-title":"Comput. Graphics Forum"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Behrisch, M., Bach, B., Henry Riche, N., Schreck, T., Fekete, J.D.: Matrix reordering methods for table and network visualization. Comput. Graphics Forum 35, 693\u2013716 (2016). Wiley Online Library (2016)","DOI":"10.1111\/cgf.12935"},{"key":"20_CR14","unstructured":"Bennett, C., Ryall, J., Spalteholz, L., Gooch, A.: The aesthetics of graph visualization. In: Proceedings of the Eurographics Conference on Computational Aesthetics in Graphics, Visualization and Imaging, pp. 57\u201364. The Eurographics Association (2007)"},{"key":"20_CR15","unstructured":"Bollob\u00e1s, B., Borgs, C., Chayes, J.T., Riordan, O.: Directed scale-free graphs. SODA 3, 132\u2013139 (2003)"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1037\/h0041412","volume":"57","author":"CA Boneau","year":"1960","unstructured":"Boneau, C.A.: The effects of violations of assumptions underlying the t test. Psychol. Bull. 57(1), 49 (1960)","journal-title":"Psychol. Bull."},{"key":"20_CR17","first-page":"3","volume":"8","author":"C Bonferroni","year":"1936","unstructured":"Bonferroni, C.: Teoria statistica delle classi e calcolo delle probabilita. Pubblicazioni del R Istituto Superiore di Scienze Economiche e Commericiali di Firenze 8, 3\u201362 (1936)","journal-title":"Pubblicazioni del R Istituto Superiore di Scienze Economiche e Commericiali di Firenze"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Bortz, J.: Statistik: F\u00fcr Sozialwissenschaftler. Springer-Verlag (2013). https:\/\/doi.org\/10.1007\/978-3-642-12770-0","DOI":"10.1007\/978-3-642-12770-0"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Bostock, M., Ogievetsky, V., Heer, J.: D3 data-driven documents. IEEE Trans. Vis. Comput. Graphics 17(12), 2301\u20132309 (2011)","DOI":"10.1109\/TVCG.2011.185"},{"issue":"2","key":"20_CR20","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1111\/j.2517-6161.1964.tb00553.x","volume":"26","author":"GE Box","year":"1964","unstructured":"Box, G.E., Cox, D.R.: An analysis of transformations. J. Roy. Stat. Soc.: Ser. B (Methodol.) 26(2), 211\u2013243 (1964)","journal-title":"J. Roy. Stat. Soc.: Ser. B (Methodol.)"},{"issue":"1","key":"20_CR21","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. Inf. Vis. 2(1), 40\u201350 (2003)","journal-title":"Inf. Vis."},{"key":"20_CR22","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":"20_CR23","doi-asserted-by":"crossref","unstructured":"Collberg, C., Kobourov, S., Nagra, J., Pitts, J., Wampler, K.: A system for graph-based visualization of the evolution of software. In: Proceedings of the 2003 ACM symposium on Software visualization, pp. 77-ff (2003)","DOI":"10.1145\/774833.774844"},{"issue":"1","key":"20_CR24","doi-asserted-by":"publisher","first-page":"55","DOI":"10.7155\/jgaa.00406","volume":"21","author":"T Crnovrsanin","year":"2017","unstructured":"Crnovrsanin, T., Chu, J., Ma, K.L.: An incremental layout method for visualizing online dynamic graphs. J. Graph Algorithms Appl. 21(1), 55\u201380 (2017)","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-92931-2_2","volume-title":"Graph Drawing and Network Visualization","author":"E Di Giacomo","year":"2021","unstructured":"Di Giacomo, E., Didimo, W., Montecchiani, F., Tappini, A.: A user study on\u00a0hybrid graph visualizations. In: Purchase, H.C., Rutter, I. (eds.) GD 2021. LNCS, vol. 12868, pp. 21\u201338. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92931-2_2"},{"issue":"8","key":"20_CR26","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1109\/TVCG.2013.263","volume":"20","author":"S van den Elzen","year":"2013","unstructured":"van den Elzen, S., Holten, D., Blaas, J., van Wijk, J.J.: Dynamic network visualization withextended massive sequence views. IEEE Trans. Visual Comput. Graphics 20(8), 1087\u20131099 (2013)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"key":"20_CR27","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.: 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":"20_CR28","doi-asserted-by":"crossref","unstructured":"Erten, C., Harding, P.J., Kobourov, S.G., Wampler, K., Yee, G.: Exploring the computing literature using temporal graph visualization. In: Visualization and Data Analysis 2004, vol. 5295, pp. 45\u201356 SPIE (2004)","DOI":"10.1117\/12.539245"},{"key":"20_CR29","unstructured":"Filipov, V., Arleo, A., B\u00f6gl, M., Miksch, S.: On time and space: an experimental study on graph structural and temporal encodings (2022). arxiv:1048550\/ARXIV.2208.13716. https:\/\/arxiv.org\/abs\/2208.13716"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Filipov, V., Arleo, A., Miksch, S.: Exploratory user study on graph temporal encodings. In: 2021 IEEE 14th Pacific Visualization Symposium (PacificVis), pp. 131\u2013135. IEEE (2021)","DOI":"10.1109\/PacificVis52677.2021.00025"},{"key":"20_CR31","unstructured":"Garnier, S., Ross, N., Rudis, R., Camargo, A.P., Sciaini, M., Scherer, C.: viridis - Colorblind-Friendly Color Maps for R, r package version 0.6.2"},{"key":"20_CR32","doi-asserted-by":"crossref","unstructured":"Ghani, S., Elmqvist, N., Yi, J.S.: Perception of animated node-link diagrams for dynamic graphs. Comput. Graphics Forum 31, 1205\u20131214 (2012)","DOI":"10.1111\/j.1467-8659.2012.03113.x"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Ghoniem, M., Fekete, J., Castagliola, P.: A comparison of the readability of graphs using node-link and matrix-based representations. In: IEEE Symposium on Information Visualization, pp. 17\u201324 (2004)","DOI":"10.1109\/INFVIS.2004.1"},{"issue":"4","key":"20_CR34","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1177\/1473871611416549","volume":"10","author":"M Gleicher","year":"2011","unstructured":"Gleicher, M., Albers, D., Walker, R., Jusufi, I., Hansen, C.D., Roberts, J.C.: Visual comparison for information visualization. Inf. Vis. SAGE 10(4), 289\u2013309 (2011)","journal-title":"Inf. Vis. SAGE"},{"key":"20_CR35","unstructured":"Hagberg, A., Conway, D.: NetworkX: network analysis with python (2020)"},{"key":"20_CR36","unstructured":"Hagberg, A., Swart, P., S Chult, D.: Exploring network structure, dynamics, and function using networkx. In: Tech. rep., Los Alamos National Lab. (LANL), Los Alamos, NM (United States) (2008)"},{"issue":"7825","key":"20_CR37","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/s41586-020-2649-2","volume":"585","author":"CR Harris","year":"2020","unstructured":"Harris, C.R., et al.: Array programming with NumPy. Nature 585(7825), 357\u2013362 (2020)","journal-title":"Nature"},{"key":"20_CR38","doi-asserted-by":"publisher","unstructured":"Hedderich, J., Sachs, L.: Angewandte Statistik. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-05749-0","DOI":"10.1007\/978-3-662-05749-0"},{"key":"20_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-74800-7_24","volume-title":"Human-Computer Interaction \u2013 INTERACT 2007","author":"N Henry","year":"2007","unstructured":"Henry, N., Fekete, J.-D.: MatLink: enhanced matrix visualization for analyzing social networks. In: Baranauskas, C., Palanque, P., Abascal, J., Barbosa, S.D.J. (eds.) INTERACT 2007. LNCS, vol. 4663, pp. 288\u2013302. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74800-7_24"},{"key":"20_CR40","doi-asserted-by":"crossref","unstructured":"Javed, W., Elmqvist, N.: Exploring the design space of composite visualization. In: IEEE Pacific Visualization Symposium, pp. 1\u20138 (2012)","DOI":"10.1109\/PacificVis.2012.6183556"},{"key":"20_CR41","unstructured":"Kerracher, N., Kennedy, J., Chalmers, K.: The design space of temporal graph visualisation. In: Elmqvist, N., Hlawitschka, M., Kennedy, J. (eds.) EuroVis - Short Papers. The Eurographics Association (2014)"},{"issue":"5","key":"20_CR42","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1007\/s12650-021-00759-x","volume":"24","author":"CDG Linhares","year":"2021","unstructured":"Linhares, C.D.G., Ponciano, J.R., Paiva, J.G.S., Traven\u00e7olo, B.A.N., Rocha, L.E.C.: A comparative analysis for visualizing the temporal evolution of contact networks: a user study. J. Visual. 24(5), 1011\u20131031 (2021). https:\/\/doi.org\/10.1007\/s12650-021-00759-x","journal-title":"J. Visual."},{"key":"20_CR43","doi-asserted-by":"crossref","unstructured":"Linhares, C.D., Traven\u00e7olo, B.A., Paiva, J.G.S., Rocha, L.E.: Dynetvis: a system for visualization of dynamic networks. In: Proceedings of the Symposium on Applied Computing, pp. 187\u2013194 (2017)","DOI":"10.1145\/3019612.3019686"},{"key":"20_CR44","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.cag.2013.11.002","volume":"38","author":"S Miksch","year":"2014","unstructured":"Miksch, S., Aigner, W.: A matter of time: applying a data-users-tasks design triangle to visual analytics of time-oriented data. Comput. Graphics 38, 286\u2013290 (2014)","journal-title":"Comput. Graphics"},{"key":"20_CR45","doi-asserted-by":"crossref","unstructured":"Okoe, M., Jianu, R., Kobourov, S.: Node-link or adjacency matrices: old question, new insights. IEEE Trans. Visual. Comput. Graphics 25(10), 2940\u20132952 (2019)","DOI":"10.1109\/TVCG.2018.2865940"},{"key":"20_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-319-73915-1_23","volume-title":"Graph Drawing and Network Visualization","author":"M Okoe","year":"2018","unstructured":"Okoe, M., Jianu, R., Kobourov, S.: Revisited experimental comparison of\u00a0node-link and matrix representations. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 287\u2013302. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_23"},{"key":"20_CR47","doi-asserted-by":"publisher","unstructured":"Posten, H.O.: Robustness of the two-sample t-test. In: Robustness of statistical methods and nonparametric statistics, pp. 92\u201399 Springer (1984). https:\/\/doi.org\/10.1007\/978-94-009-6528-7_36","DOI":"10.1007\/978-94-009-6528-7_36"},{"key":"20_CR48","doi-asserted-by":"crossref","unstructured":"Purchase, H., Carrington, D., Allder, J.A.: Empirical evaluation of aesthetics-based graph layout. Empirical Softw. Eng. 7, 233\u2013255 (2002)","DOI":"10.1023\/A:1016344215610"},{"key":"20_CR49","doi-asserted-by":"crossref","unstructured":"Purchase, H.C.: The effects of graph layout. In: Proceedings of the Australasian Conference on Computer Human Interaction, p. 80 IEEE Computer Society (1998)","DOI":"10.1109\/OZCHI.1998.732199"},{"key":"20_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-70904-6_19","volume-title":"Graph Drawing","author":"HC Purchase","year":"2007","unstructured":"Purchase, H.C., Hoggan, E., G\u00f6rg, C.: How important is the mental map? \u2013 an empirical investigation of a dynamic graph layout algorithm. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 184\u2013195. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_19"},{"key":"20_CR51","doi-asserted-by":"crossref","unstructured":"Ren, D., et al.: Understanding node-link and matrix visualizations of networks: a large-scale online experiment. Netw. Sci. 7(2), 242\u2013264 (2019)","DOI":"10.1017\/nws.2019.6"},{"issue":"424","key":"20_CR52","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1080\/01621459.1993.10476408","volume":"88","author":"PJ Rousseeuw","year":"1993","unstructured":"Rousseeuw, P.J., Croux, C.: Alternatives to the median absolute deviation. J. Am. Stat. Assoc. 88(424), 1273\u20131283 (1993)","journal-title":"J. Am. Stat. Assoc."},{"key":"20_CR53","doi-asserted-by":"crossref","unstructured":"Rufiange, S., Melan\u00e7on, G.: Animatrix: a matrix-based visualization of software evolution. In: 2014 second IEEE Working Conference on Software Visualization, pp. 137\u2013146. IEEE (2014)","DOI":"10.1109\/VISSOFT.2014.30"},{"issue":"4","key":"20_CR54","first-page":"147","volume":"6","author":"E Schminder","year":"2010","unstructured":"Schminder, E., Ziegler, M., Danay, E., Beyer, L., B\u00fchner, M.: Is it really robust? reinvestigating the robustness of anova against violations of the normal distribution. Method.- Eur. Res. J. Methods Behav. Soc. Sci. 6(4), 147\u2013151 (2010)","journal-title":"Method.- Eur. Res. J. Methods Behav. Soc. Sci."},{"issue":"7","key":"20_CR55","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. Visual Comput. Graphics 26(7), 2373\u20132386 (2018)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"key":"20_CR56","unstructured":"Tufte, E.R.: The visual display of quantitative information. Quantitative Information, p. 13 (1983)"},{"key":"20_CR57","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.21105\/joss.01026","volume":"3","author":"R Vallat","year":"2018","unstructured":"Vallat, R.: Pingouin: statistics in python. J. Open Source Softw. 3, 1026 (2018)","journal-title":"J. Open Source Softw."},{"key":"20_CR58","doi-asserted-by":"crossref","unstructured":"Virtanen, P., et al.: SciPy 1.0 contributors: sciPy 1.0: fundamental algorithms for scientific computing in python. Nat. Methods 17, 261\u2013272 (2020)","DOI":"10.1038\/s41592-020-0772-5"},{"key":"20_CR59","series-title":"Springer-Lehrbuch","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56588-9","volume-title":"Basiswissen Medizinische Statistik","author":"C Wei\u00df","year":"2019","unstructured":"Wei\u00df, C.: Basiswissen Medizinische Statistik. S, Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-56588-9"},{"issue":"4","key":"20_CR60","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.visinf.2018.12.006","volume":"2","author":"V Yoghourdjian","year":"2018","unstructured":"Yoghourdjian, V., et al.: Exploring the limits of complexity: a survey of empirical studies on graph visualisation. Vis. Inform. 2(4), 264\u2013282 (2018)","journal-title":"Vis. Inform."}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T11:41:11Z","timestamp":1728733271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}