{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:02Z","timestamp":1742913842815,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"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-15914-5_10","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"129-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["s-Club Cluster Vertex Deletion on\u00a0Interval and\u00a0Well-Partitioned Chordal Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0534-6417","authenticated-orcid":false,"given":"Dibyayan","family":"Chakraborty","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5451-6975","authenticated-orcid":false,"given":"L. Sunil","family":"Chandran","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1365-3997","authenticated-orcid":false,"given":"Sajith","family":"Padinhatteeri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2997-5384","authenticated-orcid":false,"given":"Raji R.","family":"Pillai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-030-60440-0_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J Ahn","year":"2020","unstructured":"Ahn, J., Jaffke, L., Kwon, O., Lima, P.T.: Well-partitioned chordal graphs: obstruction set and disjoint paths. In: Adler, I., M\u00fcller, H. (eds.) WG 2020. LNCS, vol. 12301, pp. 148\u2013160. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60440-0_12"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-030-75242-2_2","volume-title":"Algorithms and Complexity","author":"J Ahn","year":"2021","unstructured":"Ahn, J., Jaffke, L., Kwon, O., Lima, P.T.: Three problems on well-partitioned chordal graphs. In: Calamoneri, T., Cor\u00f2, F. (eds.) CIAC 2021. LNCS, vol. 12701, pp. 23\u201336. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75242-2_2"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"RD Alba","year":"1973","unstructured":"Alba, R.D.: A graph-theoretic definition of a sociometric clique. J. Math. Sociol. 3(1), 113\u2013126 (1973)","journal-title":"J. Math. Sociol."},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-030-73879-2_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Aprile","year":"2021","unstructured":"Aprile, M., Drescher, M., Fiorini, S., Huynh, T.: A tight approximation algorithm for the cluster vertex deletion problem. In: Singh, M., Williamson, D.P. (eds.) IPCO 2021. LNCS, vol. 12707, pp. 340\u2013353. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-73879-2_24"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","volume":"10","author":"B Balasundaram","year":"2005","unstructured":"Balasundaram, B., Butenko, S., Trukhanov, S.: Novel approaches for analyzing biological networks. J. Comb. Optim. 10(1), 23\u201339 (2005)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"issue":"3\u20134","key":"10_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A Ben-Dor","year":"1999","unstructured":"Ben-Dor, A., Shamir, R., Yakhini, Z.: Clustering gene expression patterns. J. Comput. Biol. 6(3\u20134), 281\u2013297 (1999)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00224-015-9631-7","volume":"58","author":"A Boral","year":"2016","unstructured":"Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M.: A fast branching algorithm for cluster vertex deletion. Theory Comput. Syst. 58(2), 357\u2013376 (2016)","journal-title":"Theory Comput. Syst."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2018.05.039","volume":"745","author":"Y Cao","year":"2018","unstructured":"Cao, Y., Ke, Y., Otachi, Y., You, J.: Vertex deletion problems on chordal graphs. Theoret. Comput. Sci. 745, 75\u201386 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-030-79987-8_11","volume-title":"Combinatorial Algorithms","author":"D Chakraborty","year":"2021","unstructured":"Chakraborty, D., Chandran, L.S., Padinhatteeri, S., Pillai, R.R.: Algorithms and complexity of s-club cluster vertex deletion. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 152\u2013164. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_11"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11847250_2","volume-title":"Parameterized and Exact Computation","author":"F Dehne","year":"2006","unstructured":"Dehne, F., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: implementations and experiments. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 13\u201324. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11847250_2"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.disopt.2010.09.006","volume":"8","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Graph-based data clustering with overlaps. Discrete Optim. 8(1), 2\u201317 (2011)","journal-title":"Discrete Optim."},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-030-75242-2_15","volume-title":"Algorithms and Complexity","author":"A Figiel","year":"2021","unstructured":"Figiel, A., Himmel, A.-S., Nichterlein, A., Niedermeier, R.: On 2-clubs in graph-based data clustering: theory and algorithm engineering. In: Calamoneri, T., Cor\u00f2, F. (eds.) CIAC 2021. LNCS, vol. 12701, pp. 216\u2013230. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75242-2_15"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-319-33461-5_20","volume-title":"Integer Programming and Combinatorial Optimization","author":"S Fiorini","year":"2016","unstructured":"Fiorini, S., Joret, G., Schaudt, O.: Improved approximation algorithms for hitting 3-vertex paths. In: Louveaux, Q., Skutella, M. (eds.) IPCO 2016. LNCS, vol. 9682, pp. 238\u2013249. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33461-5_20"},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-019-01395-y","volume":"182","author":"S Fiorini","year":"2019","unstructured":"Fiorini, S., Joret, G., Schaudt, O.: Improved approximation algorithms for hitting 3-vertex paths. Math. Program. 182(1), 355\u2013367 (2019). https:\/\/doi.org\/10.1007\/s10107-019-01395-y","journal-title":"Math. Program."},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3284176","volume":"66","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Gaspers, S., Lokshtanov, D., Saurabh, S.: Exact algorithms via monotone local search. J. ACM (JACM) 66(2), 1\u201323 (2019)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"10_CR18","first-page":"1","volume":"15","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Le, T.-N., Lokshtanov, D., Saurabh, S., Thomass\u00e9, S., Zehavi, M.: Subquadratic kernels for implicit 3-hitting set and 3-set packing problems. ACM Trans. Algorithms (TALG) 15(1), 1\u201344 (2019)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","volume":"39","author":"J Gramm","year":"2004","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/s00224-008-9150-x","volume":"47","author":"F H\u00fcffner","year":"2010","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 47(1), 196\u2013217 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"10_CR21","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2- $$\\varepsilon $$. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10_CR22","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1006\/jagm.1994.1044","volume":"17","author":"V King","year":"1994","unstructured":"King, V., Rao, S., Tarjan, R.: A faster deterministic maximum flow algorithm. J. Algorithms 17(3), 447\u2013474 (1994)","journal-title":"J. Algorithms"},{"key":"10_CR23","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Pearson Education India (2006)"},{"issue":"2","key":"10_CR24","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-29700-7_22","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"H Liu","year":"2012","unstructured":"Liu, H., Zhang, P., Zhu, D.: On editing graphs into 2-club clusters. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM\/FAW -2012. LNCS, vol. 7285, pp. 235\u2013246. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29700-7_22"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"RJ Mokken","year":"1979","unstructured":"Mokken, R.J.: Cliques, clubs and clans. Qual. Quant. 13, 161\u2013173 (1979)","journal-title":"Qual. Quant."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in o (nm) time, or better. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 765\u2013774 (2013)","DOI":"10.1145\/2488608.2488705"},{"issue":"3","key":"10_CR28","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","volume":"24","author":"S Papadopoulos","year":"2012","unstructured":"Papadopoulos, S., Kompatsiaris, Y., Vakali, A., Spyridonos, P.: Community detection in social media. Data Min. Knowl. Disc. 24(3), 515\u2013554 (2012)","journal-title":"Data Min. Knowl. Disc."},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-78757-0_14","volume-title":"Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics","author":"Srinivas Pasupuleti","year":"2008","unstructured":"Pasupuleti, Srinivas: Detection of protein complexes in protein interaction networks using n-clubs. In: Marchiori, Elena, Moore, Jason H.. (eds.) EvoBIO 2008. LNCS, vol. 4973, pp. 153\u2013164. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78757-0_14"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Truss, A., B\u00f6cker, S.: Exact and heuristic algorithms for weighted cluster editing. In: Computational Systems Bioinformatics, vol. 6, pp. 391\u2013401. World Scientific (2007)","DOI":"10.1142\/9781860948732_0040"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Sau, I., Souza, U.D.S.: Hitting forbidden induced subgraphs on bounded treewidth graphs. In: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)","DOI":"10.1016\/j.ic.2021.104812"},{"key":"10_CR32","unstructured":"Sch\u00e4fer, A.: Exact algorithms for s-club finding and related problems. Diploma thesis, Friedrich-Schiller-University Jena (2009)"},{"issue":"1\u20132","key":"10_CR33","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discret. Appl. Math. 144(1\u20132), 173\u2013182 (2004)","journal-title":"Discret. Appl. Math."},{"key":"10_CR34","unstructured":"Sharan, R., Shamir, R.: CLICK: a clustering algorithm with applications to gene expression analysis. In: Proceedings of the International Conference on Intelligent Systems in Molecular Biology, vol. 8, p. 16 (2000)"},{"issue":"21","key":"10_CR35","doi-asserted-by":"publisher","first-page":"12123","DOI":"10.1073\/pnas.2032324100","volume":"100","author":"V Spirin","year":"2003","unstructured":"Spirin, V., Mirny, L.A.: Protein complexes and functional modules in molecular networks. Proc. Natl. Acad. Sci. 100(21), 12123\u201312128 (2003)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"10_CR36","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00224-020-10005-w","volume":"65","author":"D Tsur","year":"2021","unstructured":"Tsur, D.: Faster parameterized algorithm for cluster vertex deletion. Theory Comput. Syst. 65(2), 323\u2013343 (2021)","journal-title":"Theory Comput. Syst."},{"issue":"11","key":"10_CR37","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1109\/34.244673","volume":"15","author":"W Zhenyu","year":"1993","unstructured":"Zhenyu, W., Leahy, R.: An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 15(11), 1101\u20131113 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"10_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-016-0001-8","volume":"6","author":"Z Yang","year":"2016","unstructured":"Yang, Z., Algesheimer, R., Tessone, C.J.: A comparative analysis of community detection algorithms on artificial networks. Sci. Rep. 6(1), 1\u201318 (2016)","journal-title":"Sci. Rep."},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"},{"key":"10_CR40","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.dam.2016.11.007","volume":"219","author":"J You","year":"2017","unstructured":"You, J., Wang, J., Cao, Y.: Approximate association via dissociation. Discret. Appl. Math. 219, 202\u2013209 (2017)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15914-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:16:31Z","timestamp":1664536591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_10","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":"1 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcbingen","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":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","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":"96","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":"32","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":"33% - 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":"12","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)"}}]}}