{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T03:57:28Z","timestamp":1769572648945,"version":"3.49.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030358013","type":"print"},{"value":"9783030358020","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_22","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"276-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["ChordLink: A New Hybrid Visualization Model"],"prefix":"10.1007","author":[{"given":"Lorenzo","family":"Angori","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-6059","authenticated-orcid":false,"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"given":"Daniele","family":"Pagliuca","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9192-2067","authenticated-orcid":false,"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"4","key":"22_CR1","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."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Angori, L., Didimo, W., Montecchiani, F., Pagliuca, D., Tappini, A.: ChordLink: a new hybrid visualization model. CoRR abs\/1908.08412 (2019). http:\/\/arxiv.org\/abs\/1908.08412","DOI":"10.1007\/978-3-030-35802-0_22"},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Argyriou, E.N., Symvonis, A., Vassiliou, V.: A fraud detection visualization system utilizing radial drawings and heat-maps. In: Laramee, R.S., Kerren, A., Braz, J. (eds.) IVAPP 2014, pp. 153\u2013160. SciTePress (2014). https:\/\/doi.org\/10.5220\/0004735501530160","DOI":"10.5220\/0004735501530160"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.future.2018.04.067","volume":"87","author":"A Arleo","year":"2018","unstructured":"Arleo, A., Didimo, W., Liotta, G., Montecchiani, F.: Profiling distributed graph processing systems through visual analytics. Future Gener. Comput. Syst. 87, 43\u201357 (2018). https:\/\/doi.org\/10.1016\/j.future.2018.04.067","journal-title":"Future Gener. Comput. Syst."},{"issue":"11","key":"22_CR5","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":"3","key":"22_CR6","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 Interdiscip. Rev. Data Min. Knowl. Discov. 6(3), 115\u2013135 (2016). https:\/\/doi.org\/10.1002\/widm.1178","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"issue":"12","key":"22_CR7","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."},{"issue":"2","key":"22_CR8","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":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-030-10564-8_12","volume-title":"WALCOM: Algorithms and Computation","author":"E Di Giacomo","year":"2019","unstructured":"Di Giacomo, E., Lenhart, W.J., Liotta, G., Randolph, T.W., Tappini, A.: (k,\u00a0p)-planarity: a relaxation of hybrid planarity. In: Das, G.K., Mandal, P.S., Mukhopadhyaya, K., Nakano, S. (eds.) WALCOM 2019. LNCS, vol. 11355, pp. 148\u2013159. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10564-8_12"},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Di Giacomo, E., Liotta, G., Patrignani, M., Rutter, I., Tappini, A.: NodeTrix planarity testing with small clusters. Algorithmica (2019). https:\/\/doi.org\/10.1007\/s00453-019-00585-6","DOI":"10.1007\/s00453-019-00585-6"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.dss.2018.03.008","volume":"110","author":"W Didimo","year":"2018","unstructured":"Didimo, W., Giamminonni, L., Liotta, G., Montecchiani, F., Pagliuca, D.: A visual analytics system to support tax evasion discovery. Decis. Support Syst. 110, 71\u201383 (2018). https:\/\/doi.org\/10.1016\/j.dss.2018.03.008","journal-title":"Decis. Support Syst."},{"issue":"4","key":"22_CR12","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."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.ins.2013.09.048","volume":"260","author":"W Didimo","year":"2014","unstructured":"Didimo, W., Montecchiani, F.: Fast layout computation of clustered networks: algorithmic advances and experimental analysis. Inf. Sci. 260, 185\u2013199 (2014). https:\/\/doi.org\/10.1016\/j.ins.2013.09.048","journal-title":"Inf. Sci."},{"issue":"7","key":"22_CR14","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1016\/j.ins.2008.11.017","volume":"179","author":"U Dogrus\u00f6z","year":"2009","unstructured":"Dogrus\u00f6z, U., Giral, E., Cetintas, A., Civril, A., Demir, E.: A layout algorithm for undirected compound graphs. Inf. Sci. 179(7), 980\u2013994 (2009). https:\/\/doi.org\/10.1016\/j.ins.2008.11.017","journal-title":"Inf. Sci."},{"key":"22_CR15","unstructured":"Fekete, J.D., Wang, D., Dang, N., Aris, A., Plaisant, C. (eds.): Overlaying graph links on treemaps. In: IEEE Symposium on Information Visualization Conference Compendium (demonstration) (2003)"},{"issue":"3","key":"22_CR16","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":"22_CR17","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."},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-319-04178-0_3","volume-title":"Citizen in Sensor Networks","author":"L Gabrielli","year":"2014","unstructured":"Gabrielli, L., Rinzivillo, S., Ronzano, F., Villatoro, D.: From tweets to semantic trajectories: mining anomalous urban mobility patterns. In: Nin, J., Villatoro, D. (eds.) CitiSens 2013. LNCS (LNAI), vol. 8313, pp. 26\u201335. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04178-0_3"},{"issue":"2","key":"22_CR19","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. Visual. 4(2), 114\u2013135 (2005)","journal-title":"Inf. Visual."},{"issue":"12","key":"22_CR20","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":"5","key":"22_CR21","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/42411.42414","volume":"31","author":"D Harel","year":"1988","unstructured":"Harel, D.: On visual formalisms. Commun. ACM 31(5), 514\u2013530 (1988). https:\/\/doi.org\/10.1145\/42411.42414","journal-title":"Commun. ACM"},{"issue":"6","key":"22_CR22","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."},{"key":"22_CR23","unstructured":"Himsolt, M.: GML: a portable graph file format (technical report Universit\u00e4t Passau) (2010)"},{"issue":"4","key":"22_CR24","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1093\/bioinformatics\/btg033","volume":"19","author":"P Holme","year":"2003","unstructured":"Holme, P., Huss, M., Jeong, H.: Subnetwork hierarchies of biochemical pathways. Bioinformatics 19(4), 532\u2013538 (2003). https:\/\/doi.org\/10.1093\/bioinformatics\/btg033","journal-title":"Bioinformatics"},{"issue":"5","key":"22_CR25","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TVCG.2006.147","volume":"12","author":"D Holten","year":"2006","unstructured":"Holten, D.: Hierarchical edge bundles: visualization of adjacency relations in hierarchical data. IEEE Trans. Vis. Comput. Graph. 12(5), 741\u2013748 (2006). https:\/\/doi.org\/10.1109\/TVCG.2006.147","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"4","key":"22_CR26","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.jvlc.2014.03.001","volume":"25","author":"W Huang","year":"2014","unstructured":"Huang, W., Eades, P., Hong, S.: Larger crossing angles make graphs easier to read. J. Vis. Lang. Comput. 25(4), 452\u2013465 (2014). https:\/\/doi.org\/10.1016\/j.jvlc.2014.03.001","journal-title":"J. Vis. Lang. Comput."},{"issue":"2","key":"22_CR27","doi-asserted-by":"publisher","first-page":"397","DOI":"10.7155\/jgaa.00152","volume":"11","author":"W Huang","year":"2007","unstructured":"Huang, W., Hong, S., Eades, P.: Effects of sociogram drawing conventions and edge crossings in social network visualization. J. Graph Algorithms Appl. 11(2), 397\u2013429 (2007). https:\/\/doi.org\/10.7155\/jgaa.00152","journal-title":"J. Graph Algorithms Appl."},{"key":"22_CR28","series-title":"Lecture Notes in ComputerScience","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44969-8","volume-title":"Drawing Graphs, Methods and Models (The Bookgrow out of a Dagstuhl Seminar, April 1999)","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs, Methods and Models (The Bookgrow out of a Dagstuhl Seminar, April 1999). LNCS, vol. 2025. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44969-8"},{"key":"22_CR29","doi-asserted-by":"publisher","unstructured":"Krzywinski, M., Schein, J., Birol, I., Connors, J., Gascoyne, R., Horsman, D., Jones, S.J., Marra, M.A.: Circos: an information aesthetic for comparative genomics. Genome Res. 19(9), 1639\u20131645 (2009). https:\/\/doi.org\/10.1101\/gr.092759.109","DOI":"10.1101\/gr.092759.109"},{"key":"22_CR30","unstructured":"Ley, M.: The DBLP computer science bibliography. https:\/\/dblp.uni-trier.de"},{"key":"22_CR31","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"},{"key":"22_CR32","doi-asserted-by":"publisher","unstructured":"Muelder, C., Ma, K.: A treemap based method for rapid layout of large graphs. In: PacificVis, pp. 231\u2013238. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/PACIFICVIS.2008.4475481","DOI":"10.1109\/PACIFICVIS.2008.4475481"},{"issue":"2","key":"22_CR33","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1140\/epjb\/e2004-00128-7","volume":"38","author":"J Onnela","year":"2004","unstructured":"Onnela, J., Kaski, K., Kert\u00e9sz, J.: Clustering and information in correlationbased financial networks. Eur. Phys. J. B-Condens. Matter Complex Syst. 38(2), 353\u2013362 (2004). https:\/\/doi.org\/10.1140\/epjb\/e2004-00128-7","journal-title":"Eur. Phys. J. B-Condens. Matter Complex Syst."},{"issue":"1082\u20131097","key":"22_CR34","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":"2","key":"22_CR35","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0953-5438(00)00032-1","volume":"13","author":"HC Purchase","year":"2000","unstructured":"Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interact. Comput. 13(2), 147\u2013162 (2000). https:\/\/doi.org\/10.1016\/S0953-5438(00)00032-1","journal-title":"Interact. Comput."},{"issue":"3","key":"22_CR36","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1016344215610","volume":"7","author":"HC Purchase","year":"2002","unstructured":"Purchase, H.C., Carrington, D.A., Allder, J.: Empirical evaluation of aesthetics-based graph layout. Empir. Softw. Eng. 7(3), 233\u2013255 (2002)","journal-title":"Empir. Softw. Eng."},{"key":"22_CR37","doi-asserted-by":"publisher","unstructured":"Shneiderman, B.: The eyes have it: a task by data type taxonomy for information visualizations. In: Proceedings of the 1996 IEEE Symposium on Visual Languages, Boulder, Colorado, USA, 3\u20136 September 1996, pp. 336\u2013343 (1996). https:\/\/doi.org\/10.1109\/VL.1996.545307","DOI":"10.1109\/VL.1996.545307"},{"key":"22_CR38","doi-asserted-by":"publisher","unstructured":"Sindre, G., Gulla, B., Jokstad, H.G.: Onion graphs: asthetics and layout. In: VL, pp. 287\u2013291. IEEE Computer Society (1993). https:\/\/doi.org\/10.1109\/VL.1993.269613","DOI":"10.1109\/VL.1993.269613"},{"key":"22_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-24595-7_13","volume-title":"Graph Drawing","author":"JM Six","year":"2004","unstructured":"Six, J.M., Tollis, I.Y.G.: A framework for user-grouped circular drawings. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 135\u2013146. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_13"},{"key":"22_CR40","doi-asserted-by":"publisher","unstructured":"Sugiyama, K.: Graph Drawing and Applications for Software and Knowledge Engineers, Series on Software Engineering and Knowledge Engineering, vol. 11. World Scientific (2002). https:\/\/doi.org\/10.1142\/4902","DOI":"10.1142\/4902"},{"issue":"2","key":"22_CR41","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C Ware","year":"2002","unstructured":"Ware, C., Purchase, H.C., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Inf. Visual. 1(2), 103\u2013110 (2002). https:\/\/doi.org\/10.1057\/palgrave.ivs.9500013","journal-title":"Inf. Visual."},{"key":"22_CR42","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"},{"key":"22_CR43","doi-asserted-by":"publisher","unstructured":"Zhao, S., McGuffin, M.J., Chignell, M.H.: Elastic hierarchies: Combining treemaps and node-link diagrams. In: INFOVIS, pp. 57\u201364. IEEE Computer Society (2005). https:\/\/doi.org\/10.1109\/INFVIS.2005.1532129","DOI":"10.1109\/INFVIS.2005.1532129"}],"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-35802-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:04:22Z","timestamp":1701133462000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","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":"113","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":"34","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":"8","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":"30% - 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.11","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":"12.55","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"}]}}