{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:40:13Z","timestamp":1742913613697,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031327322"},{"type":"electronic","value":"9783031327339"}],"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_22","type":"book-chapter","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:04:40Z","timestamp":1684969480000},"page":"502-519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spanning Trees with\u00a0Few Branch Vertices in\u00a0Graphs of\u00a0Bounded Neighborhood Diversity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3459-1075","authenticated-orcid":false,"given":"Luisa","family":"Gargano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9124-610X","authenticated-orcid":false,"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2020.06.002","volume":"835","author":"A Agrawal","year":"2020","unstructured":"Agrawal, A., et al.: Parameterized complexity of happy coloring problems. Theoret. Comput. Sci. 835, 58\u201381 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"22_CR2","first-page":"1","volume":"20","author":"J Araujo","year":"2018","unstructured":"Araujo, J., Ducoffe, G., Nisse, N., Suchan, K.: On interval number in cycle convexity. Discrete Math. Theoret. Comput. Sci. 20(1), 1\u201328 (2018)","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Watel, D., Baste, J.: An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. Available at SSRN: https:\/\/ssrn.com\/abstract=4197048 or https:\/\/dx.doi.org\/10.2139\/ssrn.4197048","DOI":"10.2139\/ssrn.4197048"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-540-69355-0_22","volume-title":"Structural Information and Communication Complexity","author":"J-C Bermond","year":"2008","unstructured":"Bermond, J.-C., Gargano, L., Rescigno, A.A.: Gathering with minimum delay in tree sensor networks. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 262\u2013276. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69355-0_22"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0219265910002714","volume":"11","author":"J-C Bermond","year":"2010","unstructured":"Bermond, J.-C., Gargano, L., Rescigno, A.A.: Gathering with minimum completion time in sensor tree networks. J. Interconnect. Netw. 11, 1\u201333 (2010)","journal-title":"J. Interconnect. Netw."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.tcs.2013.03.017","volume":"509","author":"J-C Bermond","year":"2013","unstructured":"Bermond, J.-C., Gargano, L., Pe\u00e9nnes, S., Rescigno, A.A., Vaccaro, U.: Optimal time data gathering in wireless networks with multidirectional antennas. Theoret. Comput. Sci. 509, 122\u2013139 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Bhyravarapu, S., Reddy, I.V.: On structural parameterizations of star coloring. arXiv preprint: arXiv:2211.12226 (2022)","DOI":"10.1007\/978-3-031-25211-2_12"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/SURV.2011.113010.00106","volume":"14","author":"AP Bianzino","year":"2012","unstructured":"Bianzino, A.P., Chaudet, C., Rossi, D., Rougier, J.L.: A survey of green networking research. IEEE Commun. Surv. Tutorials 14, 3\u201320 (2012)","journal-title":"IEEE Commun. Surv. Tutorials"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10589-013-9556-5","volume":"56","author":"F Carrabs","year":"2013","unstructured":"Carrabs, F., Cerulli, R., Gaudioso, M., Gentili, M.: Lower and upper bounds for the spanning tree with minimum branch vertices. Comput. Optim. Appl. 56(2), 405\u2013438 (2013). https:\/\/doi.org\/10.1007\/s10589-013-9556-5","journal-title":"Comput. Optim. Appl."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/TCCN.2016.2608337","volume":"2","author":"A Celik","year":"2016","unstructured":"Celik, A., Kamal, A.E.: Green cooperative spectrum sensing and scheduling in heterogeneous cognitive radio networks. IEEE Trans. Cognitive Commun. Networking 2, 238\u2013248 (2016)","journal-title":"IEEE Trans. Cognitive Commun. Networking"},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ejor.2013.07.029","volume":"232","author":"C Cerrone","year":"2014","unstructured":"Cerrone, C., Cerulli, R., Raiconi, A.: Relations, models and a memetic approach for three degree-dependent spanning tree problems. Eur. J. Oper. Res. 232(3), 442\u2013453 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"22_CR12","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10589-007-9120-2","volume":"42","author":"R Cerulli","year":"2009","unstructured":"Cerulli, R., Gentili, M., Iossa, A.: Bounded-degree spanning tree problems: models and new algorithms. Comput. Optim. Appl. 42(3), 353\u2013370 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"22_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00224-014-9556-6","volume":"56","author":"VM Chimani","year":"2015","unstructured":"Chimani, V.M., Spoerhase, J.: Approximating spanning trees with few branches. Theory Comput. Syst. 56(1), 181\u2013196 (2015)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1002\/net.21756","volume":"71","author":"G Cordasco","year":"2018","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A., Vaccaro, U.: Evangelism in social networks: algorithms and complexity. Networks 71(4), 346\u2013357 (2018)","journal-title":"Networks"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-48966-3_15","volume-title":"Combinatorial Algorithms","author":"G Cordasco","year":"2020","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Iterated type partitions. In: G\u0105sieniec, L., Klasing, R., Radzik, T. (eds.) IWOCA 2020. LNCS, vol. 12126, pp. 195\u2013210. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48966-3_15"},{"key":"22_CR16","doi-asserted-by":"publisher","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Parameterized complexity of immunization in the threshold model. In: Mutzel, P., Rahman, M.S., Slamin (eds.) WALCOM: Algorithms and Computation. WALCOM 2022. Lecture Notes in Computer Science(), vol. 13174. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-96731-4_23","DOI":"10.1007\/978-3-030-96731-4_23"},{"issue":"1\u20133","key":"22_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discret. Appl. Math. 101(1\u20133), 77\u2013144 (2000)","journal-title":"Discret. Appl. Math."},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-21275-3_15","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Lower bounds for kernelization. In: Parameterized Algorithms, pp. 523\u2013555. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3_15"},{"key":"22_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer-Verlag, New York (1999)"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Clique-width: on the price of generality. In: Proceedings of SODA 2009, pp. 825\u2013834 (2009)","DOI":"10.1137\/1.9781611973068.90"},{"issue":"5","key":"22_CR21","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1137\/080742270","volume":"39","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Intractability of clique-width parameterizations. SIAM J. Comput. 39(5), 1941\u20131956 (2010)","journal-title":"SIAM J. Comput."},{"key":"22_CR22","doi-asserted-by":"publisher","unstructured":"Gajarsky, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Gutin, G., Szeider, S. (eds.) Parameterized and Exact Computation. IPEC 2013. Lecture Notes in Computer Science, vol. 8246. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_15","DOI":"10.1007\/978-3-319-03898-8_15"},{"key":"22_CR23","unstructured":"Ganian, R.: Using neighborhood diversity to solve hard problems (2012). arXiv:1201.3091"},{"issue":"1","key":"22_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.disc.2004.04.005","volume":"285","author":"L Gargano","year":"2004","unstructured":"Gargano, L., Hammar, M., Hell, P., Stacho, L., Vaccaro, U.: Spanning spiders and light splitting switches. Discret. Math. 285(1), 83\u201395 (2004)","journal-title":"Discret. Math."},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45465-9_31","volume-title":"Automata, Languages and Programming","author":"L Gargano","year":"2002","unstructured":"Gargano, L., Hell, P., Stacho, L., Vaccaro, U.: Spanning trees with bounded number of branch vertices. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 355\u2013365. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_31"},{"key":"22_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2014.11.029","volume":"566","author":"L Gargano","year":"2015","unstructured":"Gargano, L., Rescigno, A.A.: Complexity of conflict-free colorings of graphs. Theoret. Comput. Sci. 566, 39\u201349 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"8","key":"22_CR27","doi-asserted-by":"publisher","first-page":"1858","DOI":"10.1016\/j.dam.2009.01.015","volume":"157","author":"L Gargano","year":"2009","unstructured":"Gargano, L., Rescigno, A.A.: Collision-free path coloring with application to minimum-delay gathering in sensor networks. Discret. Appl. Math. 157(8), 1858\u20131872 (2009)","journal-title":"Discret. Appl. Math."},{"key":"22_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2020.100596","volume":"44","author":"T Gavenciak","year":"2022","unstructured":"Gavenciak, T., Kouteck\u00fd, M., Knop, D.: Integer programming in parameterized complexity: five miniatures. Discrete Optim. 44, 100596 (2022)","journal-title":"Discrete Optim."},{"key":"22_CR29","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1109\/TMC.2012.101","volume":"12","author":"D Gozupek","year":"2013","unstructured":"Gozupek, D., Buhari, S., Alagoz, F.: A spectrum switching delay-aware scheduling algorithm for centralized cognitive radio networks. IEEE Trans. Mobile Comp. 12, 1270\u20131280 (2013)","journal-title":"IEEE Trans. Mobile Comp."},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Jansen, K., Rohwedderb, L.: On integer programming, discrepancy, and convolution. Math. Operat. Res., 1\u201315 (2023)","DOI":"10.1287\/moor.2022.1308"},{"key":"22_CR31","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64, 19\u201337 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"22_CR32","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s10589-017-9924-7","volume":"68","author":"M Landete","year":"2017","unstructured":"Landete, M., Mar\u00edn, A., Sainz-Pardo, J.L.: Decomposition methods based on articulation vertices for degree-dependent spanning tree problems. Comput. Optim. Appl. 68(3), 749\u2013773 (2017). https:\/\/doi.org\/10.1007\/s10589-017-9924-7","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"22_CR33","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.ejor.2015.04.011","volume":"245","author":"A Marin","year":"2015","unstructured":"Marin, A.: Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem. Eur. J. Oper. Res. 245(3), 680\u2013689 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"22_CR34","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/s10589-016-9850-0","volume":"65","author":"RA Melo","year":"2016","unstructured":"Melo, R.A., Samer, P., Urrutia, S.: An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. Comput. Optim. Appl. 65(3), 821\u2013844 (2016). https:\/\/doi.org\/10.1007\/s10589-016-9850-0","journal-title":"Comput. Optim. Appl."},{"key":"22_CR35","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00373-012-1277-5","volume":"30","author":"H Matsuda","year":"2014","unstructured":"Matsuda, H., Ozeki, K., Yamashita, T.: Spanning trees with a bounded number of branch vertices in a claw-free graph. Graphs and Combinatorics 30, 429\u2013437 (2014)","journal-title":"Graphs and Combinatorics"},{"key":"22_CR36","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II. algorithmic aspects of tree-width. J. Algorithms 7, 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"22_CR37","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/s11081-013-9219-5","volume":"15","author":"A Rossi","year":"2014","unstructured":"Rossi, A., Singh, A., Shyam, S.: Cutting-plane-based algorithms for two branch vertices related spanning tree problems. Optim. Eng. 15, 855\u2013887 (2014)","journal-title":"Optim. Eng."},{"key":"22_CR38","unstructured":"Salamon, G.: Spanning tree optimization problems with degree-based objective functions. In: 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, pp. 309\u2013315 (2005)"},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"Shami, N., Rasti, M.: A joint multi-channel assignment and power control scheme for energy efficiency in cognitive radio networks. In: Proceedings IEEE Wireless Communications and Networking Conference, WCNC 2016, pp. 1\u20136 (2016)","DOI":"10.1109\/WCNC.2016.7564912"},{"issue":"4","key":"22_CR40","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s11590-013-0665-y","volume":"8","author":"RMA Silva","year":"2014","unstructured":"Silva, R.M.A., Silva, D.M., Resende, M.G.C., Mateus, G.R., Goncalves, J.F., Festa, P.: An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. Optim. Lett. 8(4), 1225\u20131243 (2014)","journal-title":"Optim. Lett."},{"key":"22_CR41","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.cor.2016.11.010","volume":"81","author":"S Silvestri","year":"2017","unstructured":"Silvestri, S., Laporte, G., Cerulli, R.: A branch-and-cut algorithm for the minimum branch vertices spanning tree problem. Comput. Oper. Res. 81, 322\u2013332 (2017)","journal-title":"Comput. Oper. Res."},{"key":"22_CR42","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.ins.2012.01.037","volume":"195","author":"S Sundar","year":"2012","unstructured":"Sundar, S., Singh, A., Rossi, A.: New heuristics for two bounded-degree spanning tree problems. Inf. Sci. 195, 226\u2013240 (2012)","journal-title":"Inf. Sci."},{"key":"22_CR43","unstructured":"Toufar, T., Masa\u0159\u00edk, T., Kouteck\u00fd, M., Knop, D.: Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. Log. Methods Comput. Sci. 15 (2019)"}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:06:56Z","timestamp":1684969616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32733-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327322","9783031327339"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32733-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}