{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:06:09Z","timestamp":1766365569857,"version":"3.48.0"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030929305"},{"type":"electronic","value":"9783030929312"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92931-2_2","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"21-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A User Study on\u00a0Hybrid Graph Visualizations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9794-1928","authenticated-orcid":false,"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-6059","authenticated-orcid":false,"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9192-2067","authenticated-orcid":false,"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"key":"2_CR1","unstructured":"CiteVis: Visualizing citations among InfoVis conference papers. http:\/\/www.cc.gatech.edu\/gvu\/ii\/citevis"},{"key":"2_CR2","unstructured":"NodeTrix Javascript. https:\/\/github.com\/IRT-SystemX\/nodetrix"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Abuthawabeh, A., Beck, F., Zeckzer, D., Diehl, S.: Finding structures in multi-type code couplings with node-link and matrix visualizations. In: VISSOFT, pp. 1\u201310. IEEE Computer Society (2013)","DOI":"10.1109\/VISSOFT.2013.6650530"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Alper, B., Bach, B., Riche, N.H., Isenberg, T., Fekete, J.: Weighted graph comparison techniques for brain connectivity analysis. In: CHI, pp. 483\u2013492. ACM (2013)","DOI":"10.1145\/2470654.2470724"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Amar, R.A., Eagan, J., Stasko, J.T.: Low-level components of analytic activity in information visualization. In: IEEE Symposium on Information Visualization (InfoVis 2005), 23\u201325 October 2005, Minneapolis, MN, USA, pp. 111\u2013117 (2005). https:\/\/doi.org\/10.1109\/INFVIS.2005.1532136","DOI":"10.1109\/INFVIS.2005.1532136"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-981-15-6533-5_12","volume-title":"Beyond Planar Graphs","author":"P Angelini","year":"2020","unstructured":"Angelini, P., Da Lozzo, G.: Beyond clustered planar graphs. In: Hong, S.-H., Tokuyama, T. (eds.) Beyond Planar Graphs, pp. 211\u2013235. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5_12"},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"731","DOI":"10.7155\/jgaa.00437","volume":"21","author":"P Angelini","year":"2017","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Intersection-link representations of graphs. J. Graph Algorithms Appl. 21(4), 731\u2013755 (2017). https:\/\/doi.org\/10.7155\/jgaa.00437","journal-title":"J. Graph Algorithms Appl."},{"issue":"8","key":"2_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.3390\/a13080194","volume":"13","author":"P Angelini","year":"2020","unstructured":"Angelini, P., et al.: Graph planarity by replacing cliques with paths. Algorithms 13(8), 194 (2020). https:\/\/doi.org\/10.3390\/a13080194","journal-title":"Algorithms"},{"key":"2_CR9","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.3016055","author":"L Angori","year":"2020","unstructured":"Angori, L., Didimo, W., Montecchiani, F., Pagliuca, D., Tappini, A.: Hybrid graph visualizations with ChordLink: algorithms, experiments, and applications. IEEE Trans. Vis. Comput. Graph. (2020). https:\/\/doi.org\/10.1109\/TVCG.2020.3016055","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-030-35802-0_22","volume-title":"Graph Drawing and Network Visualization","author":"L Angori","year":"2019","unstructured":"Angori, L., Didimo, W., Montecchiani, F., Pagliuca, D., Tappini, A.: ChordLink: a new hybrid visualization model. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 276\u2013290. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_22"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.4018\/ijswis.2013100102","volume":"9","author":"B Bach","year":"2013","unstructured":"Bach, B., Pietriga, E., Liccardi, I.: Visualizing populated ontologies with OntoTrix. Int. J. Semant.Web Inf. Syst. 9(4), 17\u201340 (2013). https:\/\/doi.org\/10.4018\/ijswis.2013100102","journal-title":"Int. J. Semant.Web Inf. Syst."},{"issue":"11","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1109\/TVCG.2010.265","volume":"17","author":"V Batagelj","year":"2011","unstructured":"Batagelj, V., Brandenburg, F., Didimo, W., Liotta, G., Palladino, P., Patrignani, M.: Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. IEEE Trans. Vis. Comput. Graph. 17(11), 1587\u20131598 (2011). https:\/\/doi.org\/10.1109\/TVCG.2010.265","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"2_CR13","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. Graph. Forum 36(1), 133\u2013159 (2017)","journal-title":"Comput. Graph. Forum"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1002\/widm.1178","volume":"6","author":"P Bedi","year":"2016","unstructured":"Bedi, P., Sharma, C.: Community detection in social networks. Wiley Interdisc. Rev. Data Min. Knowl. Discov. 6(3), 115\u2013135 (2016). https:\/\/doi.org\/10.1002\/widm.1178","journal-title":"Wiley Interdisc. Rev. Data Min. Knowl. Discov."},{"key":"2_CR15","unstructured":"Besa Vial, J.J., Da Lozzo, G., Goodrich, M.T.: Computing k-modal embeddings of planar digraphs. In: ESA. LIPIcs, vol. 144, pp. 19:1\u201319:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"12","key":"2_CR16","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). https:\/\/doi.org\/10.1109\/TVCG.2011.185","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"4173","DOI":"10.1109\/ACCESS.2020.3047616","volume":"9","author":"M Burch","year":"2021","unstructured":"Burch, M., Huang, W., Wakefield, M., Purchase, H.C., Weiskopf, D., Hua, J.: The state of the art in empirical user evaluation of graph visualizations. IEEE Access 9, 4173\u20134198 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2020.3047616","journal-title":"IEEE Access"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-11650-1_17","volume-title":"Smart Graphics","author":"J Christensen","year":"2014","unstructured":"Christensen, J., Bae, J.H., Watson, B., Rappa, M.: Understanding which graph depictions are best for viewers. In: Christie, M., Li, T.-Y. (eds.) SG 2014. LNCS, vol. 8698, pp. 174\u2013177. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11650-1_17"},{"key":"2_CR19","series-title":"Wiley Series in Probability and Mathematical Statistics","volume-title":"Practical Nonparametric Statistics","author":"WJ Conover","year":"1980","unstructured":"Conover, W.J.: Practical Nonparametric Statistics. Wiley Series in Probability and Mathematical Statistics, Wiley, Chichester (1980)"},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.7155\/jgaa.00461","volume":"22","author":"G Da Lozzo","year":"2018","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M.: Computing NodeTrix representations of clustered graphs. J. Graph Algorithms Appl. 22(2), 139\u2013176 (2018). https:\/\/doi.org\/10.7155\/jgaa.00461","journal-title":"J. Graph Algorithms Appl."},{"key":"2_CR21","unstructured":"Di Giacomo, E., Didimo, W., Montecchiani, F., Tappini, A.: A user study on hybrid graph visualizations. CoRR abs\/2108.10270 (2021). http:\/\/arxiv.org\/abs\/2108.10270"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Di Giacomo, E., Lenhart, W.J., Liotta, G., Randolph, T.W., Tappini, A.: (k, p)-planarity: a relaxation of hybrid planarity. In: WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, 27 February \u2013 2 March 2019, Proceedings, pp. 148\u2013159 (2019). https:\/\/doi.org\/10.1007\/978-3-030-10564-8_12","DOI":"10.1007\/978-3-030-10564-8_12"},{"issue":"9","key":"2_CR23","doi-asserted-by":"publisher","first-page":"3464","DOI":"10.1007\/s00453-019-00585-6","volume":"81","author":"E Di Giacomo","year":"2019","unstructured":"Di Giacomo, E., Liotta, G., Patrignani, M., Rutter, I., Tappini, A.: NodeTrix planarity testing with small clusters. Algorithmica 81(9), 3464\u20133493 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00585-6","journal-title":"Algorithmica"},{"issue":"1","key":"2_CR24","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1111\/cgf.13266","volume":"37","author":"W Didimo","year":"2018","unstructured":"Didimo, W., Kornaropoulos, E.M., Montecchiani, F., Tollis, I.G.: A visualization framework and user studies for overloaded orthogonal drawings. Comput. Graph. Forum 37(1), 288\u2013300 (2018)","journal-title":"Comput. Graph. Forum"},{"issue":"4","key":"2_CR25","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.jvlc.2014.01.002","volume":"25","author":"W Didimo","year":"2014","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: Network visualization for financial crime detection. J. Vis. Lang. Comput. 25(4), 433\u2013451 (2014). https:\/\/doi.org\/10.1016\/j.jvlc.2014.01.002","journal-title":"J. Vis. Lang. Comput."},{"issue":"9","key":"2_CR26","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1111\/ele.12320","volume":"17","author":"RE van Dijk","year":"2014","unstructured":"van Dijk, R.E., Kaden, J.C., Arg\u00fcelles-Tic\u00f3, A., Dawson, D.A., Burke, T., Hatchwell, B.J.: Cooperative investment in public goods is kin directed in communal nests of social birds. Ecol. Lett. 17(9), 1141\u20131148 (2014). https:\/\/doi.org\/10.1111\/ele.12320","journal-title":"Ecol. Lett."},{"issue":"3","key":"2_CR27","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.989932","volume":"35","author":"GW Flake","year":"2002","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L., Coetzee, F.: Self-organization and identification of web communities. IEEE Comput. 35(3), 66\u201371 (2002). https:\/\/doi.org\/10.1109\/2.989932","journal-title":"IEEE Comput."},{"issue":"3\u20135","key":"2_CR28","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010). https:\/\/doi.org\/10.1016\/j.physrep.2009.11.002","journal-title":"Phys. Rep."},{"issue":"2","key":"2_CR29","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1057\/palgrave.ivs.9500092","volume":"4","author":"M Ghoniem","year":"2005","unstructured":"Ghoniem, M., Fekete, J., Castagliola, P.: On the readability of graphs using node-link and matrix-based representations: a controlled experiment and statistical analysis. Inf. Vis. 4(2), 114\u2013135 (2005). https:\/\/doi.org\/10.1057\/palgrave.ivs.9500092","journal-title":"Inf. Vis."},{"issue":"12","key":"2_CR30","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99(12), 7821\u20137826 (2002). https:\/\/doi.org\/10.1073\/pnas.122653799","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"12","key":"2_CR31","doi-asserted-by":"publisher","first-page":"2334","DOI":"10.1109\/TVCG.2011.213","volume":"17","author":"S Hadlak","year":"2011","unstructured":"Hadlak, S., Schulz, H., Schumann, H.: In situ exploration of large dynamic networks. IEEE Trans. Vis. Comput. Graph. 17(12), 2334\u20132343 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"6","key":"2_CR32","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1109\/TVCG.2008.141","volume":"14","author":"N Henry","year":"2008","unstructured":"Henry, N., Bezerianos, A., Fekete, J.: Improving the readability of clustered social networks using node duplication. IEEE Trans. Vis. Comput. Graph. 14(6), 1317\u20131324 (2008). https:\/\/doi.org\/10.1109\/TVCG.2008.141","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"2_CR33","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, Part II. LNCS, vol. 4663, pp. 288\u2013302. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74800-7_24"},{"issue":"6","key":"2_CR34","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1109\/TVCG.2007.70582","volume":"13","author":"N Henry","year":"2007","unstructured":"Henry, N., Fekete, J., McGuffin, M.J.: NodeTrix: a hybrid visualization of social networks. IEEE Trans. Vis. Comput. Graph. 13(6), 1302\u20131309 (2007). https:\/\/doi.org\/10.1109\/TVCG.2007.70582","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"2_CR35","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1057\/palgrave.ivs.9500116","volume":"5","author":"R Keller","year":"2006","unstructured":"Keller, R., Eckert, C.M., Clarkson, P.J.: Matrices or node-link diagrams: which visual representation is better for visualising connectivity models? Inf. Vis. 5(1), 62\u201376 (2006). https:\/\/doi.org\/10.1057\/palgrave.ivs.9500116","journal-title":"Inf. Vis."},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Lee, B., Plaisant, C., Parr, C.S., Fekete, J., Henry, N.: Task taxonomy for graph visualization. In: Proceedings of the 2006 AVI Workshop on BEyond time and errors: novel evaluation methods for information visualization, BELIV 2006, Venice, Italy, 23 May 2006, pp. 1\u20135 (2006). https:\/\/doi.org\/10.1145\/1168149.1168168","DOI":"10.1145\/1168149.1168168"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Ley, M.: The DBLP computer science bibliography: evolution, research issues, perspectives. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 1\u201310. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45735-6_1. https:\/\/dblp.uni-trier.de","DOI":"10.1007\/3-540-45735-6_1"},{"key":"2_CR38","unstructured":"Liotta, G., Rutter, I., Tappini, A.: Graph planarity testing with hierarchical embedding constraints. CoRR abs\/1904.12596 (2019). http:\/\/arxiv.org\/abs\/1904.12596"},{"key":"2_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-030-38919-2_51","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science","author":"G Liotta","year":"2020","unstructured":"Liotta, G., Rutter, I., Tappini, A.: Simultaneous FPQ-ordering and hybrid planarity testing. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 617\u2013626. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_51"},{"key":"2_CR40","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2021.05.012","volume":"874","author":"G Liotta","year":"2021","unstructured":"Liotta, G., Rutter, I., Tappini, A.: Simultaneous FPQ-ordering and hybrid planarity testing. Theoret. Comput. Sci. 874, 59\u201379 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.05.012","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"2_CR41","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least square quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-09042-9_5","volume-title":"Computational Intelligence Methods for Bioinformatics and Biostatistics","author":"H Mahmoud","year":"2014","unstructured":"Mahmoud, H., Masulli, F., Rovetta, S., Russo, G.: Community detection in protein-protein interaction networks using spectral and graph approaches. In: Formenti, E., Tagliaferri, R., Wit, E. (eds.) CIBB 2013 2013. LNCS, vol. 8452, pp. 62\u201375. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09042-9_5"},{"issue":"21","key":"2_CR43","doi-asserted-by":"publisher","first-page":"11980","DOI":"10.1073\/pnas.2133841100","volume":"100","author":"S Mangan","year":"2003","unstructured":"Mangan, S., Alon, U.: Structure and function of the feed-forward loop network motif. Proc. Natl. Acad. Sci. 100(21), 11980\u201311985 (2003). https:\/\/doi.org\/10.1073\/pnas.2133841100","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2_CR44","doi-asserted-by":"publisher","unstructured":"Melancon, G.: Just how dense are dense graphs in the real world? A methodological note. In: Proceedings of the 2006 AVI Workshop on BEyond Time and Errors: Novel Evaluation Methods for Information Visualization, BELIV 2006, pp. 1\u20137. Association for Computing Machinery, New York (2006). https:\/\/doi.org\/10.1145\/1168149.1168167","DOI":"10.1145\/1168149.1168167"},{"issue":"3","key":"2_CR45","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1111\/cgf.12657","volume":"34","author":"M Okoe","year":"2015","unstructured":"Okoe, M., Jianu, R.: GraphUnit: evaluating interactive graph visualizations using crowdsourcing. Comput. Graph. Forum 34(3), 451\u2013460 (2015)","journal-title":"Comput. Graph. Forum"},{"issue":"10","key":"2_CR46","doi-asserted-by":"publisher","first-page":"2940","DOI":"10.1109\/TVCG.2018.2865940","volume":"25","author":"M Okoe","year":"2019","unstructured":"Okoe, M., Jianu, R., Kobourov, S.G.: Node-link or adjacency matrices: Old question, new insights. IEEE Trans. Vis. Comput. Graph. 25(10), 2940\u20132952 (2019). https:\/\/doi.org\/10.1109\/TVCG.2018.2865940","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"2","key":"2_CR47","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1140\/epjb\/e2004-00128-7","volume":"38","author":"J-P Onnela","year":"2004","unstructured":"Onnela, J.-P., Kaski, K., Kert\u00e9sz, J.: Clustering and information in correlation based financial networks. Eur. Phys. J. B 38(2), 353\u2013362 (2004). https:\/\/doi.org\/10.1140\/epjb\/e2004-00128-7","journal-title":"Eur. Phys. J. B"},{"issue":"1082\u20131097","key":"2_CR48","first-page":"1164","volume":"56","author":"MA Porter","year":"2009","unstructured":"Porter, M.A., Onnela, J.P., Mucha, P.J.: Communities in networks. Not. Am. Math. Soc. 56(1082\u20131097), 1164\u20131166 (2009)","journal-title":"Not. Am. Math. Soc."},{"issue":"6","key":"2_CR49","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1006\/jvlc.1998.0093","volume":"9","author":"HC Purchase","year":"1998","unstructured":"Purchase, H.C.: Performance of layout algorithms: comprehension, not computation. J. Vis. Lang. Comput. 9(6), 647\u2013657 (1998). https:\/\/doi.org\/10.1006\/jvlc.1998.0093","journal-title":"J. Vis. Lang. Comput."},{"key":"2_CR50","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511844522","volume-title":"Experimental Human-Computer Interaction - A Practical Guide with Visual Examples","author":"HC Purchase","year":"2012","unstructured":"Purchase, H.C.: Experimental Human-Computer Interaction - A Practical Guide with Visual Examples. Cambridge University Press, Cambridge (2012)"},{"key":"2_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-36763-2_40","volume-title":"Graph Drawing","author":"HC Purchase","year":"2013","unstructured":"Purchase, H.C., Hamer, J., N\u00f6llenburg, M., Kobourov, S.G.: On the usability of Lombardi graph drawings. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 451\u2013462. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_40"},{"key":"2_CR52","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"12","key":"2_CR53","doi-asserted-by":"publisher","first-page":"2556","DOI":"10.1109\/TVCG.2013.149","volume":"19","author":"S Rufiange","year":"2013","unstructured":"Rufiange, S., McGuffin, M.J.: DiffAni: visualizing dynamic graphs with a hybrid of difference maps and animation. IEEE Trans. Vis. Comput. Graph. 19(12), 2556\u20132565 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"12","key":"2_CR54","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TVCG.2014.2346422","volume":"20","author":"B Saket","year":"2014","unstructured":"Saket, B., Simonetto, P., Kobourov, S.G., B\u00f6rner, K.: Node, node-link, and node-link-group diagrams: an evaluation. IEEE Trans. Vis. Comput. Graph. 20(12), 2231\u20132240 (2014). https:\/\/doi.org\/10.1109\/TVCG.2014.2346422","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"2_CR55","doi-asserted-by":"publisher","DOI":"10.1201\/9780203910894","volume-title":"Testing for Normality","author":"HC Thode","year":"2002","unstructured":"Thode, H.C.: Testing for Normality. Marcel Dekker, New York (2002)"},{"key":"2_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-14922-1_42","volume-title":"Advanced Intelligent Computing Theories and Applications","author":"H Wu","year":"2010","unstructured":"Wu, H., He, J., Pei, Y., Long, X.: Finding research community in collaboration network with expertise profiling. In: Huang, D.-S., Zhao, Z., Bevilacqua, V., Figueroa, J.C. (eds.) ICIC 2010. LNCS, vol. 6215, pp. 337\u2013344. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14922-1_42"},{"issue":"1","key":"2_CR57","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TVCG.2016.2598472","volume":"23","author":"X Yang","year":"2017","unstructured":"Yang, X., Shi, L., Daianu, M., Tong, H., Liu, Q., Thompson, P.M.: Blockwise human brain network visual comparison using NodeTrix representation. IEEE Trans. Vis. Comput. Graph. 23(1), 181\u2013190 (2017). https:\/\/doi.org\/10.1109\/TVCG.2016.2598472","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"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-030-92931-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:48Z","timestamp":1766365308000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 December 2021","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo.inf.uni-tuebingen.de\/gd2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"74","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":"23","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":"5","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":"31% - 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.02","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":"8.6","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}