{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:30:58Z","timestamp":1770539458157,"version":"3.49.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030687656","type":"print"},{"value":"9783030687663","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-68766-3_36","type":"book-chapter","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T09:11:53Z","timestamp":1613293913000},"page":"466-481","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The Turing Test for Graph Drawing Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6994-4446","authenticated-orcid":false,"given":"Helen C.","family":"Purchase","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4978-8479","authenticated-orcid":false,"given":"Daniel","family":"Archambault","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4089-673X","authenticated-orcid":false,"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1028-0010","authenticated-orcid":false,"given":"Hsiang-Yun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,14]]},"reference":[{"key":"36_CR1","unstructured":"Bipartite 3-regular undirected graph (2019). http:\/\/reference.wolfram.com\/language\/ref\/GraphData.html. Accessed 8 Aug 2019"},{"key":"36_CR2","unstructured":"Block graph. https:\/\/en.wikipedia.org\/wiki\/Block_graph (2019). Accessed 8 Aug 2019"},{"key":"36_CR3","unstructured":"Fullerene graphs. https:\/\/commons.wikimedia.org\/wiki\/Fullerene_graphs\/ (2019). Accessed 8 Aug 2019"},{"key":"36_CR4","unstructured":"$$G_2$$. http:\/\/haikuanalytics.com\/portfolio\/ (2019). Accessed 8 Aug 2019"},{"key":"36_CR5","unstructured":"K-tree. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.71.3875 (2019). Accessed 8 Aug 2019"},{"key":"36_CR6","unstructured":"Planar graph. https:\/\/arxiv.org\/pdf\/1707.08833.pdf (2019), page 18. Accessed 8 Aug 2019"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Allender, S., et al.: A community based systems diagram of obesity causes. PLoS ONE 10(7), e0129683 (2015). https:\/\/doi.org\/10.1371\/journal.pone.0129683","DOI":"10.1371\/journal.pone.0129683"},{"key":"36_CR8","doi-asserted-by":"publisher","unstructured":"Bartel, G., Gutwenger, C., Klein, K., Mutzel, P.: An experimental evaluation of multilevel layout methods. In: Brandes, U., Cornelsen, S. (eds.) Proceedings of Graph Drawing (GD 2010). LNCS, vol. 6502, pp. 80\u201391 (2011). https:\/\/doi.org\/10.1007\/978-3-642-18469-7_8","DOI":"10.1007\/978-3-642-18469-7_8"},{"key":"36_CR9","doi-asserted-by":"publisher","unstructured":"Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) Graph-Theoretic Concepts in Computer Science (WG 2004). LNCS, vol. 3353, pp. 332\u2013343. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30559-0_28","DOI":"10.1007\/978-3-540-30559-0_28"},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T Biedl","year":"1998","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. Theory Appl. 9(3), 159\u2013180 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(97)00026-6","journal-title":"Comput. Geom. Theory Appl."},{"issue":"6","key":"36_CR11","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1142\/S0218195900000310","volume":"10","author":"TC Biedl","year":"2000","unstructured":"Biedl, T.C., Madden, B.P., Tollis, I.G.: The three-phase method: a unified approach to orthogonal graph drawing. Int. J. Comput. Geom. Appl. 10(6), 553\u2013580 (2000). https:\/\/doi.org\/10.1142\/S0218195900000310","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"36_CR12","doi-asserted-by":"publisher","unstructured":"Brandes, U., Pich, C.: Eigensolver methods for progressive multidimensional scaling of large data. In: Proceedings of Graph Drawing. LNCS, vol. 4372, pp. 42\u201353. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_6","DOI":"10.1007\/978-3-540-70904-6_6"},{"key":"36_CR13","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. 1st edn. Prentice Hall, Upper Saddle River (1998)"},{"issue":"6","key":"36_CR14","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TVCG.2009.109","volume":"15","author":"T Dwyer","year":"2009","unstructured":"Dwyer, T., et al.: A comparison of user-generated and automatic graph layouts. IEEE Trans. Vis. Comput. Graph. 15(6), 961\u2013968 (2009). https:\/\/doi.org\/10.1109\/TVCG.2009.109","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"36_CR15","first-page":"149","volume":"42","author":"P Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 149\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"key":"36_CR16","doi-asserted-by":"publisher","unstructured":"Eiglsperger, M., Fekete, S.P., Klau, G.W.: Orthogonal graph drawing. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs: Methods and Models, LNCS, vol. 2025, chap. 6, pp. 121\u2013171. Springer-Verlag (2001). https:\/\/doi.org\/10.1007\/3-540-44969-8_6","DOI":"10.1007\/3-540-44969-8_6"},{"key":"36_CR17","doi-asserted-by":"publisher","unstructured":"Ellson, J., Gansner, E.R., Koutsofios, E., North, S.C., Woodhull, G.: Graphviz - open source graph drawing tools. In: Proceedings of Graph Drawing (GD 2001). LNCS, vol. 2265, pp. 483\u2013484 (2002). https:\/\/doi.org\/10.1007\/3-540-45848-4_57","DOI":"10.1007\/3-540-45848-4_57"},{"key":"36_CR18","doi-asserted-by":"publisher","unstructured":"Frishman, Y., Tal, A.: Online dynamic graph drawing. IEEE Trans. Vis. Comput. Graph. 14(4), 727\u2013740 (2008). https:\/\/doi.org\/10.1109\/TVCG.2008.11","DOI":"10.1109\/TVCG.2008.11"},{"key":"36_CR19","doi-asserted-by":"publisher","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force directed placement. Softw. Pract. Experience 21, 1129\u20131164 (1991). https:\/\/doi.org\/10.1002\/spe.4380211102","DOI":"10.1002\/spe.4380211102"},{"key":"36_CR20","doi-asserted-by":"publisher","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Algorithms and area bounds for nonplanar orthogonal drawings. In: Di Battista, G. (ed.) Proceedings of Graph Drawing (GD1997). LNCS, vol. 1353, pp. 134\u2013145. Springer (1997). https:\/\/doi.org\/10.1007\/3-540-63938-1_57","DOI":"10.1007\/3-540-63938-1_57"},{"issue":"3","key":"36_CR21","doi-asserted-by":"publisher","first-page":"203","DOI":"10.7155\/jgaa.00052","volume":"6","author":"P Gajer","year":"2002","unstructured":"Gajer, P., Kobourov, S.: GRIP: graph dRawing with intelligent placement. J. Graph Algorithms Appl. 6(3), 203\u2013224 (2002). https:\/\/doi.org\/10.7155\/jgaa.00052","journal-title":"J. Graph Algorithms Appl."},{"key":"36_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-319-03841-4_24","volume-title":"Graph Drawing","author":"ER Gansner","year":"2013","unstructured":"Gansner, E.R., Hu, Y., Krishnan, S.: COAST: a convex optimization approach to stress-based embedding. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 268\u2013279. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_24"},{"key":"36_CR23","doi-asserted-by":"publisher","unstructured":"Gansner, E.R., Hu, Y., North, S.: A maxent-stress model for graph layout. IEEE Trans. Vis. Comput. Graph. 19(6), 927\u2013940 (2013). https:\/\/doi.org\/10.1109\/TVCG.2012.299","DOI":"10.1109\/TVCG.2012.299"},{"key":"36_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70904-6_37","volume-title":"Graph Drawing","author":"ER Gansner","year":"2007","unstructured":"Gansner, E.R., Koren, Y.: Improved circular layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 386\u2013398. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_37"},{"issue":"3\u20134","key":"36_CR25","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1177\/1473871612455749","volume":"12","author":"H Gibson","year":"2013","unstructured":"Gibson, H., Faith, J., Vickers, P.: A survey of two-dimensional graph layout techniques for information visualisation. Inf. Vis. 12(3\u20134), 324\u2013357 (2013). https:\/\/doi.org\/10.1177\/1473871612455749","journal-title":"Inf. Vis."},{"issue":"1","key":"36_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(00)00389-9","volume":"113","author":"R Hadany","year":"2001","unstructured":"Hadany, R., Harel, D.: A multi-scale algorithm for drawing graphs nicely. Discrete Appl. Math. 113(1), 3\u201321 (2001). https:\/\/doi.org\/10.1016\/S0166-218X(00)00389-9","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"36_CR27","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TVCG.2008.155","volume":"14","author":"F van Ham","year":"2008","unstructured":"van Ham, F., Rogowitz, B.E.: Perceptual organization in user-generated graph layouts. IEEE Trans. Vis. Comput. Graph. 14(6), 1333\u20131339 (2008). https:\/\/doi.org\/10.1109\/TVCG.2008.155","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"36_CR28","doi-asserted-by":"publisher","unstructured":"Harel, D., Koren, Y.: A fast multi-scale method for drawing large graphs. J. Graph Algorithms Appl. 6, 179\u2013202 (2002). https:\/\/doi.org\/10.7155\/jgaa.00051","DOI":"10.7155\/jgaa.00051"},{"issue":"1","key":"36_CR29","first-page":"37","volume":"10","author":"Y Hu","year":"2006","unstructured":"Hu, Y.: Efficient, high-quality force-directed graph drawing. Math. J. 10(1), 37\u201371 (2006)","journal-title":"Math. J."},{"key":"36_CR30","doi-asserted-by":"publisher","unstructured":"Isenberg, T., Neumann, P., Carpendale, S., Sousa, M.C., Jorge, J.A.: Non-photorealistic rendering in context: an observational study. In: Non-Photorealistic Animation and Rendering (NPAR 2006), pp. 115\u2013126. ACM (2006). https:\/\/doi.org\/10.1145\/1124728.1124747","DOI":"10.1145\/1124728.1124747"},{"issue":"1","key":"36_CR31","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31(1), 7\u201315 (1989). https:\/\/doi.org\/10.1016\/0020-0190(89)90102-6","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"36_CR32","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/TVCG.2015.2467451","volume":"22","author":"S Kieffer","year":"2016","unstructured":"Kieffer, S., Dwyer, T., Marriott, K., Wybrow, M.: HOLA: human-like orthogonal network layout. IEEE Trans. Vis. Comput. Graph. 22(1), 349\u2013358 (2016). https:\/\/doi.org\/10.1109\/TVCG.2015.2467451","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"36_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-73915-1_19","volume-title":"Graph Drawing and Network Visualization","author":"J Klawitter","year":"2018","unstructured":"Klawitter, J., Mchedlidze, T., N\u00f6llenburg, M.: Experimental evaluation of book drawing algorithms. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 224\u2013238. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_19"},{"key":"36_CR34","doi-asserted-by":"publisher","unstructured":"Koren, Y., Carmel, L., Harel, D.: ACE: A fast multiscale eigenvectors computation for drawing huge graphs. In: Proceedings of IEEE Symposium on Information Visualization, pp. 137\u2013144. IEEE (2002). https:\/\/doi.org\/10.1109\/INFVIS.2002.1173159","DOI":"10.1109\/INFVIS.2002.1173159"},{"key":"36_CR35","unstructured":"Kruskal, J.B., Seery, J.B.: Designing network diagrams. In: General Conference on Social Graphics, vol. 49, p. 22 (1980)"},{"key":"36_CR36","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B., Wish, M.: Multidimensional Scaling. Sage Press, Thousand Oak (1978)","DOI":"10.4135\/9781412985130"},{"issue":"1","key":"36_CR37","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/12.46286","volume":"39","author":"S Masuda","year":"1990","unstructured":"Masuda, S., Nakajima, K., Kashiwabara, T., Fujisawa, T.: Crossing minimization in linear embeddings of graphs. IEEE Trans. Comput. 39(1), 124\u2013127 (1990). https:\/\/doi.org\/10.1109\/12.46286","journal-title":"IEEE Trans. Comput."},{"key":"36_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BFb0021827","volume-title":"Graph Drawing","author":"HC Purchase","year":"1996","unstructured":"Purchase, H.C., Cohen, R.F., James, M.: Validating graph drawing aesthetics. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 435\u2013446. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021827"},{"key":"36_CR39","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"},{"issue":"1","key":"36_CR40","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TVCG.2010.269","volume":"18","author":"HC Purchase","year":"2012","unstructured":"Purchase, H.C., Pilcher, C., Plimmer, B.: Graph drawing aesthetics created by users, not algorithms. IEEE Trans. Vis. Comput. Graph. 18(1), 81\u201392 (2012). https:\/\/doi.org\/10.1109\/TVCG.2010.269","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"36_CR41","unstructured":"Six, J.M., Tollis, I.G.: Circular drawing algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, chap. 9, pp. 285\u2013315. CRC Press, Boca Raton (2013)"},{"issue":"3","key":"36_CR42","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421\u2013444 (1987). https:\/\/doi.org\/10.1137\/0216030","journal-title":"SIAM J. Comput."},{"key":"36_CR43","doi-asserted-by":"publisher","unstructured":"Torgerson, W.S.: Multidimensional scaling: I. theory and method. Psychometrika 17(4), 401\u2013419 (1952). https:\/\/doi.org\/10.1007\/BF02288916","DOI":"10.1007\/BF02288916"},{"issue":"236","key":"36_CR44","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1093\/mind\/LIX.236.433","volume":"59","author":"A Turing","year":"1950","unstructured":"Turing, A.: Computing machinery and intelligence. Mind 59(236), 433\u2013460 (1950). https:\/\/doi.org\/10.1093\/mind\/LIX.236.433","journal-title":"Mind"},{"key":"36_CR45","doi-asserted-by":"publisher","unstructured":"Wang, Y., et al.: Revisiting stress majorization as a unified framework for interactive constrained graph visualization. IEEE Trans. Vis. Comput. Graph. 24(1), 489\u2013499 (2018). https:\/\/doi.org\/10.1109\/TVCG.2017.2745919","DOI":"10.1109\/TVCG.2017.2745919"},{"key":"36_CR46","doi-asserted-by":"publisher","unstructured":"Wiese, R., Eiglsperger, M., Kaufmann, M.: yFiles: visualization and automatic layout of graphs. In: Proceedings of Graph Drawing (GD 2001), pp. 453\u2013454. LNCS (2002). https:\/\/doi.org\/10.1007\/978-3-642-18638-7_8","DOI":"10.1007\/978-3-642-18638-7_8"},{"key":"36_CR47","doi-asserted-by":"publisher","unstructured":"Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452\u2013473 (1977). https:\/\/doi.org\/10.1086\/jar.33.4.3629752, https:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Newman\/karate.html","DOI":"10.1086\/jar.33.4.3629752"}],"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-68766-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T23:03:43Z","timestamp":1739401423000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68766-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030687656","9783030687663"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68766-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 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":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2020.cs.ubc.ca\/","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":"82","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":"29","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":"9","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":"35% - 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":"3","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":"The conference was held virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}