{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:49:19Z","timestamp":1760168959268,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147203"},{"type":"electronic","value":"9783031147210"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_18","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"247-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Obtaining Smoothly Navigable Approximation Sets in\u00a0Bi-objective Multi-modal Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2813-015X","authenticated-orcid":false,"given":"Renzo J.","family":"Scholman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4599-0733","authenticated-orcid":false,"given":"Anton","family":"Bouter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6720-4380","authenticated-orcid":false,"given":"Leah R. M.","family":"Dickhoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4261-7511","authenticated-orcid":false,"given":"Tanja","family":"Alderliesten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4186-6666","authenticated-orcid":false,"given":"Peter A. N.","family":"Bosman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1162\/evco\\_a_00182","volume":"25","author":"A Ahrari","year":"2017","unstructured":"Ahrari, A., Deb, K., Preuss, M.: Multimodal optimization by covariance matrix self-adaptation evolution strategy with repelling subpopulations. Evol. Comput. 25(3), 439\u2013471 (2017). https:\/\/doi.org\/10.1162\/evco_a_00182","journal-title":"Evol. Comput."},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Theory of the hypervolume indicator: Optimal $$\\mu $$-distributions and the choice of the reference point. In: Proceedings of the Tenth ACM SIGEVO Workshop on Foundations of Genertic Algorithms (FOGA 2009), pp. 87\u2013102. Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1527125.1527138","DOI":"10.1145\/1527125.1527138"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Auger, A., Hansen, N.: A restart CMA evolution strategy with increasing population size. In: 2005 IEEE Congress on Evolutionary Computation. vol. 2, pp. 1769\u20131776. IEEE, New York, NY, USA (2005). https:\/\/doi.org\/10.1109\/CEC.2005.1554902","DOI":"10.1109\/CEC.2005.1554902"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/J.TCS.2012.05.036","volume":"456","author":"R Berghammer","year":"2012","unstructured":"Berghammer, R., Friedrich, T., Neumann, F.: Convergence of set-based multi-objective optimization, indicators and deteriorative cycles. Theor. Comput. Sci. 456, 2\u201317 (2012). https:\/\/doi.org\/10.1016\/J.TCS.2012.05.036","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653\u20131669 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2006.08.008","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Bosman, P.A.N.: The anticipated mean shift and cluster registration in mixture-based EDAs for multi-objective optimization. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (GECCO 2010), pp. 351\u2013358. Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1830483.1830549","DOI":"10.1145\/1830483.1830549"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Bouter, A., Alderliesten, T., Witteveen, C., Bosman, P.A.N.: Exploiting linkage information in real-valued optimization with the real-valued gene-pool optimal mixing evolutionary algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2017), pp. 705\u2013712. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3071178.3071272","DOI":"10.1145\/3071178.3071272"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Bouter, A., Luong, N.H., Witteveen, C., Alderliesten, T., Bosman, P.A.N.: The multi-objective real-valued gene-pool optimal mixing evolutionary algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2017). pp. 537\u2013544. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3071178.3071274","DOI":"10.1145\/3071178.3071274"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186(2), 311\u2013338 (2000). https:\/\/doi.org\/10.1016\/S0045-7825(99)00389-8","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"18_CR11","volume-title":"Multi-Objective Optimization Using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley & Sons Inc, USA (2001)"},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.ejor.2006.06.042","volume":"185","author":"K Deb","year":"2008","unstructured":"Deb, K., Tiwari, S.: Omni-optimizer: a generic evolutionary algorithm for single and multi-objective optimization. Eur. J. Oper. Res. 185(3), 1062\u20131087 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2006.06.042","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/3-540-36970-8_37","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M Fleischer","year":"2003","unstructured":"Fleischer, M.: The measure of pareto optima applications to multi-objective metaheuristics. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) EMO 2003. LNCS, vol. 2632, pp. 519\u2013533. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36970-8_37"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"105489","DOI":"10.1016\/j.cor.2021.105489","volume":"136","author":"C Grimme","year":"2021","unstructured":"Grimme, C., et al.: Peeking beyond peaks: challenges and research potentials of continuous multimodal multi-objective optimization. Comput. Oper. Res. 136, 105489 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105489","journal-title":"Comput. Oper. Res."},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1162\/EVCO\\_a\\_00188","volume":"24","author":"AP Guerreiro","year":"2016","unstructured":"Guerreiro, A.P., Fonseca, C.M., Paquete, L.: Greedy hypervolume subset selection in low dimensions. Evol. Comput. 24, 521\u2013544 (2016). https:\/\/doi.org\/10.1162\/EVCO_a_00188","journal-title":"Evol. Comput."},{"key":"18_CR16","unstructured":"Harik, G.R., Lobo, F.G.: A parameter-less genetic algorithm. In: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation (GECCO 1999), vol. 1, pp. 258\u2013265. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1999)"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.2007.15.1.1","volume":"15","author":"C Igel","year":"2007","unstructured":"Igel, C., Hansen, N., Roth, S.: Covariance matrix adaptation for multi-objective optimization. Evol. Comput. 15, 1\u201328 (2007). https:\/\/doi.org\/10.1162\/evco.2007.15.1.1","journal-title":"Evol. Comput."},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Kobayashi, K., Hamada, N., Sannai, A., Tanaka, A., Bannai, K., Sugiyama, M.: B\u00e9zier simplex fitting: describing Pareto fronts of simplicial problems with small samples in multi-objective optimization. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, the 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, pp. 2304\u20132313. AAAI press, Palo Alto, CA, USA (Jan 2019)","DOI":"10.1609\/aaai.v33i01.33012304"},{"issue":"4","key":"18_CR19","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/TEVC.2016.2638437","volume":"21","author":"X Li","year":"2017","unstructured":"Li, X., Epitropakis, M.G., Deb, K., Engelbrecht, A.: Seeking multiple solutions: an updated survey on niching methods and their applications. IEEE Trans. Evol. Comput. 21(4), 518\u2013538 (2017). https:\/\/doi.org\/10.1109\/TEVC.2016.2638437","journal-title":"IEEE Trans. Evol. Comput."},{"key":"18_CR20","unstructured":"Liang, J., Qu, B., Gong, D., Yue, C.: Problem definitions and evaluation criteria for the CEC 2019 special session on multimodal multiobjective optimization. Technical Report (Nov 2018)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.swevo.2017.12.003","volume":"40","author":"NH Luong","year":"2018","unstructured":"Luong, N.H., Alderliesten, T., Bel, A., Niatsetski, Y., Bosman, P.A.N.: Application and benchmarking of multi-objective evolutionary algorithms on high-dose-rate brachytherapy planning for prostate cancer treatment. Swarm Evol. Comput. 40, 37\u201352 (2018). https:\/\/doi.org\/10.1016\/j.swevo.2017.12.003","journal-title":"Swarm Evol. Comput."},{"key":"18_CR22","unstructured":"Mahfoud, S.W.: Niching Methods for Genetic Algorithms. Ph.D. Thesis, University of Illinois at Urbana-Champaign, USA (1996), uMI Order No. GAX95-43663"},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Maree, S.C., Alderliesten, T., Bosman, P.A.N.: Real-valued evolutionary multi-modal multi-objective optimization by hill-valley clustering. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2019), pp. 568\u2013576. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3321707.3321759","DOI":"10.1145\/3321707.3321759"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Maree, S.C., Alderliesten, T., Bosman, P.A.N.: Ensuring smoothly navigable approximation sets by B\u00e9zier curve parameterizations in evolutionary bi-objective optimization. In: Parallel Problem Solving from Nature - PPSN XVI. pp. 215\u2013228. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-58115-2_15"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Maree, S.C., Alderliesten, T., Bosman, P.A.N.: Uncrowded hypervolume-based multi-objective optimization with gene-pool optimal mixing. Evol. Comput. 1\u201324 (2021). https:\/\/doi.org\/10.1162\/evco_a_00303","DOI":"10.1162\/evco_a_00303"},{"key":"18_CR26","doi-asserted-by":"publisher","unstructured":"Maree, S.C., Alderliesten, T., Thierens, D., Bosman, P.A.N.: Real-valued evolutionary multi-modal optimization driven by hill-valley clustering. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2018), pp. 857\u2013864. Association for Computing Machinery, New York, NY, USA (Jul 2018). https:\/\/doi.org\/10.1145\/3205455.3205477","DOI":"10.1145\/3205455.3205477"},{"key":"18_CR27","doi-asserted-by":"publisher","unstructured":"Preuss, M.: Niching the CMA-ES via nearest-better clustering. In: Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO 2010), pp. 1711\u20131718. Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1830761.1830793","DOI":"10.1145\/1830761.1830793"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/11844297_52","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"M Preuss","year":"2006","unstructured":"Preuss, M., Naujoks, B., Rudolph, G.: Pareto set and EMOA behavior for simple multimodal multiobjective functions. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 513\u2013522. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11844297_52"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-70928-2_7","volume-title":"Evolutionary Multi-Criterion Optimization","author":"G Rudolph","year":"2007","unstructured":"Rudolph, G., Naujoks, B., Preuss, M.: Capabilities of EMOA to detect and preserve equivalent pareto subsets. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 36\u201350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70928-2_7"},{"key":"18_CR30","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/978-3-030-72062-9_50","volume-title":"Evolutionary Multi-Criterion Optimization","author":"L Sch\u00e4permeier","year":"2021","unstructured":"Sch\u00e4permeier, L., Grimme, C., Kerschke, P.: To boldly show what no one has seen before: a dashboard for visualizing multi-objective landscapes. In: Ishibuchi, H., Zhang, Q., Ishibuchi, H. (eds.) Evolutionary Multi-Criterion Optimization, pp. 632\u2013644. Springer, Cham (2021)"},{"issue":"1","key":"18_CR31","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TEVC.2019.2909744","volume":"24","author":"R Tanabe","year":"2020","unstructured":"Tanabe, R., Ishibuchi, H.: A review of evolutionary multimodal multiobjective optimization. IEEE Trans. Evol. Comput. 24(1), 193\u2013200 (2020). https:\/\/doi.org\/10.1109\/TEVC.2019.2909744","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"18_CR32","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian, Y., Cheng, R., Zhang, X., Jin, Y.: PlatEMO: a MATLAB platform for evolutionary multi-objective optimization. IEEE Comput. Intell. Mag. 12(4), 73\u201387 (2017)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"18_CR33","doi-asserted-by":"publisher","unstructured":"Tour\u00e9, C., Hansen, N., Auger, A., Brockhoff, D.: Uncrowded hypervolume improvement: COMO-CMA-ES and the sofomore framework. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2019), pp. 638\u2013646. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3321707.3321852","DOI":"10.1145\/3321707.3321852"},{"key":"18_CR34","doi-asserted-by":"publisher","unstructured":"Ursem, R.: Multinational evolutionary algorithms. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99. vol. 3, pp. 1633\u20131640. IEEE, New York, NY, USA (1999). https:\/\/doi.org\/10.1109\/CEC.1999.785470","DOI":"10.1109\/CEC.1999.785470"},{"key":"18_CR35","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TEVC.2017.2754271","volume":"22","author":"C Yue","year":"2017","unstructured":"Yue, C., Qu, B., Liang, J.: A multi-objective particle swarm optimizer using ring topology for solving multimodal multi-objective problems. IEEE Trans. Evol. Comput. 22, 805\u2013817 (2017). https:\/\/doi.org\/10.1109\/TEVC.2017.2754271","journal-title":"IEEE Trans. Evol. Comput."},{"key":"18_CR36","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11, 712\u2013731 (2007). https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans. Evol. Comput."},{"key":"18_CR37","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems, pp. 95\u2013100. International Center for Numerical Methods in Engineering, Athens, Greece (Sep 2001)"},{"issue":"2","key":"18_CR38","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003). https:\/\/doi.org\/10.1109\/TEVC.2003.810758","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:49:29Z","timestamp":1710262169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","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":"85","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":"0","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":"46% - 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.75","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.11","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}