{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:02:19Z","timestamp":1783576939271,"version":"3.55.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031327322","type":"print"},{"value":"9783031327339","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-32733-9_12","type":"book-chapter","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:04:40Z","timestamp":1684969480000},"page":"262-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Energy Complexity of\u00a0Diameter and\u00a0Minimum Cut Computation in\u00a0Bounded-Genus Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0109-2432","authenticated-orcid":false,"given":"Yi-Jun","family":"Chang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Akhoondian Amiri, S., Schmid, S., Siebertz, S.: A local constant factor MDS approximation for bounded genus graphs. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC), pp. 227\u2013233 (2016)","DOI":"10.1145\/2933057.2933084"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/11523468_92","volume-title":"Automata, Languages and Programming","author":"C Amb\u00fchl","year":"2005","unstructured":"Amb\u00fchl, C.: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) Automata, Languages and Programming, pp. 1139\u20131150. Springer, Berlin Heidelberg, Berlin, Heidelberg (2005)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Augustine, J., Moses, Jr, W.K., Pandurangan, G.: Distributed MST computation in the sleeping model: awake-optimal algorithms and lower bounds. arXiv preprint arXiv:2204.08385 (2022)","DOI":"10.1145\/3519270.3538459"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45(1), 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Barenboim, L., Maimon, T.: Deterministic logarithmic completeness in the distributed sleeping model. In: Gilbert, S. (ed.) 35th International Symposium on Distributed Computing (DISC). Leibniz International Proceedings in Informatics (LIPIcs), vol. 209, pp. 10:1\u201310:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2021.10","DOI":"10.4230\/LIPIcs.DISC.2021.10"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Kopelowitz, T., Pettie, S., Young, M.: Contention resolution with log-logstar channel accesses. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC), pp. 499\u2013508 (2016). https:\/\/doi.org\/10.1145\/2897518.2897655","DOI":"10.1145\/2897518.2897655"},{"issue":"27","key":"12_CR7","doi-asserted-by":"publisher","first-page":"2549","DOI":"10.1016\/j.tcs.2009.02.002","volume":"410","author":"P Berenbrink","year":"2009","unstructured":"Berenbrink, P., Cooper, C., Hu, Z.: Energy efficient randomised communication in unknown adhoc networks. Theor. Comput. Sci. 410(27), 2549\u20132561 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.02.002","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"12_CR8","first-page":"1796","volume":"83","author":"JL Bordim","year":"2000","unstructured":"Bordim, J.L., Jiangtao, C., Hayashi, T., Nakano, K., Olariu, S.: Energy-efficient initialization protocols for ad-hoc radio networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 83(9), 1796\u20131803 (2000)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/11602613_54","volume-title":"Algorithms and Computation","author":"I Caragiannis","year":"2005","unstructured":"Caragiannis, I., Galdi, C., Kaklamanis, C.: Basic computations in wireless networks. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 533\u2013542. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11602613_54"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Chang, Y., Dani, V., Hayes, T.P., He, Q., Li, W., Pettie, S.: The energy complexity of broadcast. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (PODC) (2018)","DOI":"10.1145\/3212734.3212774"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Chang, Y., Kopelowitz, T., Pettie, S., Wang, R., Zhan, W.: Exponential separations in the energy complexity of leader election. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 771\u2013783 (2017)","DOI":"10.1145\/3055399.3055481"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Chang, Y.J., Dani, V., Hayes, T.P., Pettie, S.: The energy complexity of BFS in radio networks. In: Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC), pp. 273\u2013282. ACM (2020). https:\/\/doi.org\/10.1145\/3382734.3405713","DOI":"10.1145\/3382734.3405713"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Chang, Y.J., Duan, R., Jiang, S.: Near-optimal time-energy trade-offs for deterministic leader election. In: Proceedings of the 33th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM (2021)","DOI":"10.1145\/3409964.3461830"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Chang, Y.J., Jiang, S.: The energy complexity of Las Vegas leader election. In: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 75\u201386 (2022)","DOI":"10.1145\/3490148.3538586"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Chatterjee, S., Gmyr, R., Pandurangan, G.: Sleeping is efficient: MIS in $$O(1)$$-rounds node-averaged awake complexity. In: Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC), pp. 99\u2013108. ACM (2020). https:\/\/doi.org\/10.1145\/3382734.3405718","DOI":"10.1145\/3382734.3405718"},{"issue":"12","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I Chlamtac","year":"1985","unstructured":"Chlamtac, I., Kutten, S.: On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. Commun. 33(12), 1240\u20131246 (1985)","journal-title":"IEEE Trans. Commun."},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"STACS 2001","author":"AEF Clementi","year":"2001","unstructured":"Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 121\u2013131. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44693-1_11"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-87779-0_6","volume-title":"Distributed Computing","author":"A Czygrinow","year":"2008","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M., Wawrzyniak, W.: Fast distributed approximations in planar graphs. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 78\u201392. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87779-0_6"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Dani, V., Gupta, A., Hayes, T.P., Pettie, S.: Wake up and join me! an energy-efficient algorithm for maximal matching in radio networks. Distrib. Comput. (2022)","DOI":"10.1007\/s00446-022-00426-w"},{"key":"12_CR20","unstructured":"Dani, V., Hayes, T.P.: How to wake up your neighbors: safe and nearly optimal generic energy conservation in radio networks. arXiv preprint arXiv:2205.12830 (2022)"},{"key":"12_CR21","unstructured":"Dufoulon, F., Moses, Jr, W.K., Pandurangan, G.: Sleeping is superefficient: MIS in exponentially better awake complexity. arXiv preprint arXiv:2204.08359 (2022)"},{"issue":"4","key":"12_CR22","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1109\/26.52656","volume":"38","author":"A Ephremides","year":"1990","unstructured":"Ephremides, A., Truong, T.V.: Scheduling broadcasts in multihop radio networks. IEEE Trans. Commun. 38(4), 456\u2013460 (1990). https:\/\/doi.org\/10.1109\/26.52656","journal-title":"IEEE Trans. Commun."},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-75142-7_21","volume-title":"Distributed Computing","author":"L Ga\u0327sieniec","year":"2007","unstructured":"Ga\u0327sieniec, L., Kantor, E., Kowalski, D.R., Peleg, D., Su, C.: Energy and time efficient broadcasting in known topology radio networks. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 253\u2013267. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75142-7_21"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Distributed algorithms for planar networks II: low-congestion shortcuts, MST, and min-cut. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 202\u2013219. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch16"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Low-congestion shortcuts for graphs excluding dense minors. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing PODC, pp. 213\u2013221 (2021)","DOI":"10.1145\/3465084.3467935"},{"key":"12_CR26","unstructured":"Ghaffari, M., Parter, M.: Near-optimal distributed DFS in planar graphs. In: 31st International Symposium on Distributed Computing (DISC 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Portmann, J.: Average awake complexity of MIS and matching. In: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 45\u201355 (2022)","DOI":"10.1145\/3490148.3538566"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Li, J., Zuzic, G.: Minor excluded network families admit fast distributed algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (PODC), pp. 465\u2013474 (2018)","DOI":"10.1145\/3212734.3212776"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Energy-efficient size approximation of radio networks with no collision detection. In: Proceedings of the 8th Annual International Conference on Computing and Combinatorics (COCOON), pp. 279\u2013289 (2002)","DOI":"10.1007\/3-540-45655-4_31"},{"issue":"11\u201312","key":"12_CR30","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1002\/cpe.783","volume":"15","author":"T Jurdzinski","year":"2003","unstructured":"Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Weak communication in single-hop radio networks: adjusting algorithms to industrial standards. Concurr. Comput. Pract. Exp. 15(11\u201312), 1117\u20131131 (2003)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"12_CR31","doi-asserted-by":"publisher","unstructured":"Jurdzi\u0144ski, T., Kuty\u0142owski, M., Zatopia\u0144ski, J.: Efficient algorithms for leader election in radio networks. In: Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 51\u201357 (2002). https:\/\/doi.org\/10.1145\/571825.571833","DOI":"10.1145\/571825.571833"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Kardas, M., Klonowski, M., Pajak, D.: Energy-efficient leader election protocols for single-hop radio networks. In: Proceedings of the 42nd International Conference on Parallel Processing (ICPP), pp. 399\u2013408 (2013)","DOI":"10.1109\/ICPP.2013.49"},{"issue":"1","key":"12_CR33","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"LM Kirousis","year":"2000","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theor. Comput. Sci. 243(1), 289\u2013305 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(98)00223-0","journal-title":"Theor. Comput. Sci."},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-39658-1_37","volume-title":"Algorithms - ESA 2003","author":"M Kuty\u0142owski","year":"2003","unstructured":"Kuty\u0142owski, M., Rutkowski, W.: Adversary immune leader election in ad hoc radio networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 397\u2013408. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_37"},{"issue":"5","key":"12_CR35","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/j.ic.2006.10.001","volume":"205","author":"C Lavault","year":"2007","unstructured":"Lavault, C., Marckert, J.F., Ravelomanana, V.: Quasi-optimal energy-efficient leader election algorithms in radio networks. Inf. Comput. 205(5), 679\u2013693 (2007)","journal-title":"Inf. Comput."},{"issue":"2","key":"12_CR36","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00446-013-0186-z","volume":"26","author":"C Lenzen","year":"2013","unstructured":"Lenzen, C., Pignolet, Y.A., Wattenhofer, R.: Distributed minimum dominating set approximations in restricted families of graphs. Distrib. Comput. 26(2), 119\u2013137 (2013)","journal-title":"Distrib. Comput."},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Li, J., Parter, M.: Planar diameter via metric compression. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 152\u2013163 (2019)","DOI":"10.1145\/3313276.3316358"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Miller, G.L., Peng, R., Xu, S.C.: Parallel graph decompositions using random shifts. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 196\u2013203. ACM (2013)","DOI":"10.1145\/2486159.2486180"},{"key":"12_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/3-540-40996-3_31","volume-title":"Algorithms and Computation","author":"K Nakano","year":"2000","unstructured":"Nakano, K., Olariu, S.: Randomized leader election protocols in radio networks with no collision detection. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 362\u2013373. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-40996-3_31"},{"key":"12_CR40","unstructured":"Parter, M.: Distributed planar reachability in nearly optimal time. In: 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"Roditty, L., Williams, V.V.: Fast approximation algorithms for the diameter and radius of sparse graphs. In: Proceedings 45th ACM Symposium on Theory of Computing (STOC), pp. 515\u2013524 (2013)","DOI":"10.1145\/2488608.2488673"},{"issue":"1","key":"12_CR42","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1019128411323","volume":"3","author":"A Sen","year":"1997","unstructured":"Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. Wirel. Netw. 3(1), 71\u201382 (1997). https:\/\/doi.org\/10.1023\/A:1019128411323","journal-title":"Wirel. Netw."},{"issue":"3","key":"12_CR43","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1109\/TCOM.1984.1096061","volume":"32","author":"H Takagi","year":"1984","unstructured":"Takagi, H., Kleinrock, L.: Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans. Commun. 32(3), 246\u2013257 (1984). https:\/\/doi.org\/10.1109\/TCOM.1984.1096061","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"12_CR44","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ipl.2013.11.008","volume":"114","author":"W Wawrzyniak","year":"2014","unstructured":"Wawrzyniak, W.: A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs. Inf. Process. Lett. 114(3), 94\u201398 (2014)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32733-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:05:58Z","timestamp":1684969558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32733-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327322","9783031327339"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32733-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Alcal\u00e1 de Henares","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2023.networks.imdea.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"48","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":"26","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":"54% - 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","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":"5","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)"}}]}}