{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:43:02Z","timestamp":1742964182438,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030732158"},{"type":"electronic","value":"9783030732165"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73216-5_23","type":"book-chapter","created":{"date-parts":[[2021,4,5]],"date-time":"2021-04-05T23:04:59Z","timestamp":1617663899000},"page":"336-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Maximum (L,\u00a0K)-Lasting Cores in\u00a0Temporal Social Networks"],"prefix":"10.1007","author":[{"given":"Wei-Chun","family":"Hung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chih-Ying","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,6]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical Informatics","author":"J Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 598\u2013612. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45995-2_51"},{"issue":"6","key":"23_CR2","doi-asserted-by":"publisher","first-page":"574","DOI":"10.14778\/2168651.2168658","volume":"5","author":"A Angel","year":"2012","unstructured":"Angel, A., Sarkas, N., Koudas, N., Srivastava, D.: Dense subgraph maintenance under streaming edge weight updates for real-time story identification. Proc. VLDB Endowment 5(6), 574\u2013585 (2012)","journal-title":"Proc. VLDB Endowment"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B Balasundaram","year":"2011","unstructured":"Balasundaram, B., Butenko, S., Hicks, I.V.: Clique relaxations in social network analysis: the maximum k-plex problem. Oper. Res. 59(1), 133\u2013142 (2011)","journal-title":"Oper. Res."},{"key":"23_CR4","doi-asserted-by":"publisher","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Handbook of Combinatorial Optimization, pp. 1\u201374. Springer (1999). https:\/\/doi.org\/10.1007\/978-1-4757-3023-4_1","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Chang, L.: Efficient maximum clique computation over large sparse graphs. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 529\u2013538. ACM (2019)","DOI":"10.1145\/3292500.3330986"},{"issue":"7","key":"23_CR6","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1109\/TKDE.2010.271","volume":"24","author":"J Chen","year":"2010","unstructured":"Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection. IEEE Trans. Knowl. Data Eng. 24(7), 1216\u20131230 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"12","key":"23_CR7","doi-asserted-by":"publisher","first-page":"2364","DOI":"10.1109\/TKDE.2018.2875911","volume":"31","author":"Y-L Chen","year":"2018","unstructured":"Chen, Y.-L., Yang, D.-N., Shen, C.-Y., Lee, W.-C., Chen, M.-S.: On efficient processing of group and subsequent queries for social activity planning. IEEE Trans. Knowl. Data Eng. 31(12), 2364\u20132378 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M.T.: Efficient core decomposition in massive networks. In: 2011 IEEE 27th International Conference on Data Engineering, pp. 51\u201362. IEEE (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Conte, A., De Matteis, T., De Sensi, D., Grossi, R., Marino, A., Versari, L.: D2k: scalable community detection in massive networks via small-diameter k-plexes. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1272\u20131281. ACM (2018)","DOI":"10.1145\/3219819.3220093"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: Proceedings of the 16th International Conference on World Wide Web, pp. 461\u2013470. ACM (2007)","DOI":"10.1145\/1242572.1242635"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Epasto, A., Lattanzi, S., Sozio, M.: Efficient densest subgraph computation in evolving graphs. In: Proceedings of the 24th International Conference on World Wide Web, pp. 300\u2013310. International World Wide Web Conferences Steering Committee (2015)","DOI":"10.1145\/2736277.2741638"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Galimberti, E., Barrat, A., Bonchi, F., Cattuto, C., Gullo, F.: Mining (maximal) span-cores from temporal networks. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 107\u2013116. ACM (2018)","DOI":"10.1145\/3269206.3271767"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Galimberti, E., Bonchi, F., Gullo, F.: Core decomposition and densest subgraph in multilayer networks. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 1807\u20131816. ACM (2017)","DOI":"10.1145\/3132847.3132993"},{"issue":"2","key":"23_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.14778\/3282495.3282497","volume":"12","author":"B Ghosh","year":"2018","unstructured":"Ghosh, B., Ali, M.E., Choudhury, F.M., Apon, S.H., Sellis, T., Li, J.: The flexible socio spatial group queries. Proc. VLDB Endowment 12(2), 99\u2013111 (2018)","journal-title":"Proc. VLDB Endowment"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Himmel, A.-S., Molter, H., Niedermeier, R., Sorge, M.: Enumerating maximal cliques in temporal graphs. In: Proceedings of the 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 337\u2013344. IEEE Press (2016)","DOI":"10.1109\/ASONAM.2016.7752255"},{"issue":"3","key":"23_CR16","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1109\/TCSS.2018.2859580","volume":"5","author":"B-Y Hsu","year":"2018","unstructured":"Hsu, B.-Y., Lan, Y.-F., Shen, C.-Y.: On automatic formation of effective therapy groups in social networks. IEEE Trans. Comput. Soc. Syst. 5(3), 713\u2013726 (2018)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Hsu, B.-Y., Shen, C.-Y.: On extracting social-aware diversity-optimized groups in social networks. In: 2018 IEEE Global Communications Conference (GLOBECOM), pp. 206\u2013212. IEEE (2018)","DOI":"10.1109\/GLOCOM.2018.8648030"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Hsu, B.-Y., Shen, C.-Y.: Willingness maximization for ego network data extraction in online social networks. In: Proceedings of the 29th ACM International Conference on Information and Knowledge Management, pp. 515\u2013524 (2020)","DOI":"10.1145\/3340531.3411867"},{"issue":"5","key":"23_CR19","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1007\/s10618-020-00709-5","volume":"34","author":"B-Y Hsu","year":"2020","unstructured":"Hsu, B.-Y., Tu, C.-L., Chang, M.-Y., Shen, C.-Y.: Crawlsn: community-aware data acquisition with maximum willingness in online social networks. Data Mining Knowl. Disc. 34(5), 1589\u20131620 (2020)","journal-title":"Data Mining Knowl. Disc."},{"issue":"suppl\u20131","key":"23_CR20","doi-asserted-by":"publisher","first-page":"i213","DOI":"10.1093\/bioinformatics\/bti1049","volume":"21","author":"H Hu","year":"2005","unstructured":"Hu, H., Yan, X., Huang, Y., Han, J., Zhou, X.J.: Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics 21(suppl\u20131), i213\u2013i221 (2005)","journal-title":"Bioinformatics"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Hu, S., Wu, X., Chan, T.: Maintaining densest subsets efficiently in evolving hypergraphs. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 929\u2013938. ACM (2017)","DOI":"10.1145\/3132847.3132907"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1311\u20131322. ACM (2014)","DOI":"10.1145\/2588555.2610495"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-319-23525-7_39","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"V Jethava","year":"2015","unstructured":"Jethava, V., Beerenwinkel, N.: Finding dense subgraphs in relational graphs. In: Appice, A., Rodrigues, P.P., Santos Costa, V., Gama, J., Jorge, A., Soares, C. (eds.) ECML PKDD 2015. LNCS (LNAI), vol. 9285, pp. 641\u2013654. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23525-7_39"},{"issue":"5","key":"23_CR24","doi-asserted-by":"publisher","first-page":"509","DOI":"10.14778\/2735479.2735484","volume":"8","author":"R-H Li","year":"2015","unstructured":"Li, R.-H., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. Proc. VLDB Endowment 8(5), 509\u2013520 (2015)","journal-title":"Proc. VLDB Endowment"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Li, R.-H., Su, J., Qin, L., Yu, J.X., Dai, Q.: Persistent community search in temporal networks. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 797\u2013808. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00077"},{"key":"23_CR26","doi-asserted-by":"publisher","unstructured":"Luenberger, D.G., Ye, Y., et al.: Linear and Nonlinear Programming, vol. 2. Springer (1984). https:\/\/doi.org\/10.1007\/978-3-319-18842-3","DOI":"10.1007\/978-3-319-18842-3"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Pei, J., Jiang, D., Zhang, A.: On mining cross-graph quasi-cliques. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 228\u2013238. ACM (2005)","DOI":"10.1145\/1081870.1081898"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Rozenshtein, P., Bonchi, F., Gionis, A., Sozio, M., Tatti, N.: Finding events in temporal networks: segmentation meets densest-subgraph discovery. In: 2018 IEEE International Conference on Data Mining (ICDM), pp. 397\u2013406. IEEE (2018)","DOI":"10.1109\/ICDM.2018.00055"},{"issue":"3","key":"23_CR30","first-page":"27","volume":"11","author":"P Rozenshtein","year":"2017","unstructured":"Rozenshtein, P., Tatti, N., Gionis, A.: Finding dynamic dense subgraphs. ACM Trans. Knowl. Disc. Data (TKDD) 11(3), 27 (2017)","journal-title":"ACM Trans. Knowl. Disc. Data (TKDD)"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S-V., Das, A., Tirthapura, S.: Enumerating top-k quasi-cliques. In: 2018 IEEE International Conference on Big Data (Big Data), pp. 1107\u20131112. IEEE (2018)","DOI":"10.1109\/BigData.2018.8622352"},{"issue":"6","key":"23_CR32","doi-asserted-by":"publisher","first-page":"433","DOI":"10.14778\/2536336.2536344","volume":"6","author":"AE Sar\u00edy\u00fcce","year":"2013","unstructured":"Sar\u00edy\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K.-L., \u00c7ataly\u00fcrek, \u00dc.V.: Streaming algorithms for k-core decomposition. Proc. VLDB Endowment 6(6), 433\u2013444 (2013)","journal-title":"Proc. VLDB Endowment"},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"Shen, C.-Y., Fotsing, C.K., Yang, D.-N., Chen, Y.-S., Lee, W.-C.: On organizing online soirees with live multi-streaming. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32 (2018)","DOI":"10.1609\/aaai.v32i1.11310"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Shen, C.-Y., Huang, L.-H., Yang, D.-N., Shuai, H.-H., Lee, W.-C., Chen, M.-S.: On finding socially tenuous groups for online social networks. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 415\u2013424. ACM (2017)","DOI":"10.1145\/3097983.3097995"},{"key":"23_CR35","unstructured":"Shen, C.-Y., Shuai, H.-H., Hsu, K.-F., Chen, M.-S.: Task-optimized group search for social internet of things. In: EDBT, pp. 108\u2013119 (2017)"},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Shen, C.-Y., et al.: Forming online support groups for internet and behavior related addictions. In: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, pp. 163\u2013172 (2015)","DOI":"10.1145\/2806416.2806423"},{"key":"23_CR37","doi-asserted-by":"crossref","unstructured":"Shen, C.-Y., et al.: On extracting socially tenuous groups for online social networks with k-triangles. IEEE Tran. Knowl. Data Engineering (2020)","DOI":"10.1109\/TKDE.2020.3025911"},{"issue":"1","key":"23_CR38","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1109\/TKDE.2015.2468726","volume":"28","author":"C-Y Shen","year":"2015","unstructured":"Shen, C.-Y., Yang, D.-N., Huang, L.-H., Lee, W.-C., Chen, M.-S.: Socio-spatial group queries for impromptu activity planning. IEEE Trans. Knowl. Data Eng. 28(1), 196\u2013210 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"23_CR39","doi-asserted-by":"crossref","unstructured":"Shen, C.-Y., Yang, D.-N., Lee, W.-C., Chen, M.-S.: Activity organization for friend-making optimization in online social networks. IEEE Trans. Knowl. Data Eng. (2020)","DOI":"10.1109\/TKDE.2020.2980516"},{"issue":"9","key":"23_CR40","doi-asserted-by":"publisher","first-page":"812","DOI":"10.14778\/2311906.2311909","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. Proc. VLDB Endowment 5(9), 812\u2013823 (2012)","journal-title":"Proc. VLDB Endowment"},{"key":"23_CR41","doi-asserted-by":"crossref","unstructured":"Wen, D., Qin, L., Zhang, Y., Chang, L., Chen, L.: Enumerating k-vertex connected components in large graphs. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 52\u201363. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00014"},{"key":"23_CR42","doi-asserted-by":"crossref","unstructured":"Wu, H., et al.: Core decomposition in large temporal graphs. In: 2015 IEEE International Conference on Big Data (Big Data), pp. 649\u2013658. IEEE (2015)","DOI":"10.1109\/BigData.2015.7363809"},{"key":"23_CR43","doi-asserted-by":"crossref","unstructured":"Yang, B., Wen, D., Qin, L., Zhang, Y., Chang, L., Li, R.-H.: Index-based optimal algorithm for computing k-cores in large uncertain graphs. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 64\u201375. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00015"},{"key":"23_CR44","doi-asserted-by":"crossref","unstructured":"Yang, D.-N., Shen, C.-Y., Lee, W.-C., Chen, M.-S.: On socio-spatial group query for location-based social networks. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 949\u2013957 (2012)","DOI":"10.1145\/2339530.2339679"},{"key":"23_CR45","doi-asserted-by":"crossref","unstructured":"Zhang, C., Zhang, Y., Zhang, W., Qin, L., Yang, J.: Efficient maximal spatial clique enumeration. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 878\u2013889. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00083"},{"issue":"10","key":"23_CR46","doi-asserted-by":"publisher","first-page":"998","DOI":"10.14778\/3115404.3115406","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: When engagement meets similarity: efficient (k, r)-core computation on social networks. Proc. VLDB Endowment 10(10), 998\u20131009 (2017)","journal-title":"Proc. VLDB Endowment"},{"key":"23_CR47","doi-asserted-by":"crossref","unstructured":"Zhu, R., Zou, Z., Li, J.: Diversified coherent core search on multi-layer graphs. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 701\u2013712. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00069"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications. DASFAA 2021 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73216-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T12:27:00Z","timestamp":1671798420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-73216-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030732158","9783030732165"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73216-5_23","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":"6 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"11 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dm.iis.sinica.edu.tw\/DASFAA2021\/index.html","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"490","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":"98","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":"33","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":"20% - 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":"4","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","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":"Due to the Corona pandemic this event was held virtually.","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)"}}]}}