{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T21:17:34Z","timestamp":1770067054532,"version":"3.49.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031095733","type":"print"},{"value":"9783031095740","type":"electronic"}],"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-09574-0_7","type":"book-chapter","created":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T17:36:07Z","timestamp":1656005767000},"page":"96-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lossy Kernelization of\u00a0Same-Size Clustering"],"prefix":"10.1007","author":[{"given":"Sayan","family":"Bandyapadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fedor V.","family":"Fomin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nidhi","family":"Purohit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirill","family":"Siminov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,24]]},"reference":[{"key":"7_CR1","volume-title":"Data Clustering: Algorithms and Applications","year":"2013","unstructured":"Aggarwal, C.C., Reddy, C.K. (eds.): Data Clustering: Algorithms and Applications. CRC Press, Boca Raton (2013)"},{"key":"7_CR2","unstructured":"Agrawal, A., Saurabh, S., Tale, P.: On the parameterized complexity of contraction to generalization of trees. In: 12th International Symposium on Parameterized and Exact Computation (IPEC). LIPIcs, vol. 89, pp. 1:1\u20131:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Ahmadian, S., Norouzi-Fard, A., Svensson, O., Ward, J.: Better guarantees for $$k$$-means and Euclidean $$k$$-median by primal-dual algorithms. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pp. 61\u201372. IEEE Computer Society (2017)","DOI":"10.1109\/FOCS.2017.15"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/jagm.1999.1024","volume":"33","author":"N Alon","year":"1999","unstructured":"Alon, N., Sudakov, B.: On two segmentation problems. J. Algorithms 33(1), 173\u2013184 (1999)","journal-title":"J. Algorithms"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean $$k$$-medians and related problems. In: Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 106\u2013113. ACM, New York (1998)","DOI":"10.1145\/276698.276718"},{"key":"7_CR6","unstructured":"Baker, D., Braverman, V., Huang, L., Jiang, S.H.C., Krauthgamer, R., Wu, X.: Coresets for clustering in graphs of bounded treewidth. In: International Conference on Machine Learning, pp. 569\u2013579. PMLR (2020)"},{"key":"7_CR7","unstructured":"Bandyapadhyay, S., Fomin, F.V., Purohit, N., Simonov, K.: Lossy kernelization of same-size clustering. CoRR abs\/2107.07383 (2021)"},{"key":"7_CR8","unstructured":"Bandyapadhyay, S., Fomin, F.V., Simonov, K.: On coresets for fair clustering in metric and Euclidean spaces and their applications. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP). LIPIcs, vol. 198, pp. 23:1\u201323:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Bandyapadhyay, S., Varadarajan, K.R.: On variants of $$k$$-means clustering. In: 32nd International Symposium on Computational Geometry, SoCG 2016. LIPIcs, Boston, MA, USA, 14\u201318 June 2016, vol. 51, pp. 14:1\u201314:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)","DOI":"10.1016\/j.comgeo.2015.10.003"},{"key":"7_CR10","doi-asserted-by":"publisher","DOI":"10.1201\/9781584889977","volume-title":"Constrained Clustering: Advances in Algorithms, Theory, and Applications","author":"S Basu","year":"2008","unstructured":"Basu, S., Davidson, I., Wagstaff, K.: Constrained Clustering: Advances in Algorithms, Theory, and Applications. CRC Press, Boca Raton (2008)"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00224-017-9820-7","volume":"62","author":"A Bhattacharya","year":"2018","unstructured":"Bhattacharya, A., Jaiswal, R., Kumar, A.: Faster algorithms for the constrained $$k$$-means problem. Theory Comput. Syst. 62(1), 93\u2013115 (2018). https:\/\/doi.org\/10.1007\/s00224-017-9820-7","journal-title":"Theory Comput. Syst."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Byrka, J., Fleszar, K., Rybicki, B., Spoerhase, J.: Bi-factor approximation algorithms for hard capacitated $$k$$-median problems. In: Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 722\u2013736. SIAM (2015)","DOI":"10.1137\/1.9781611973730.49"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Byrka, J., Pensyl, T.W., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for $$k$$-median and positive correlation in budgeted optimization. ACM Trans. Algorithms 13(2), 23:1\u201323:31 (2017)","DOI":"10.1145\/2981561"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-319-33461-5_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"J Byrka","year":"2016","unstructured":"Byrka, J., Rybicki, B., Uniyal, S.: An approximation algorithm for uniform capacitated k-median problem with $$1+\\epsilon $$ capacity violation. In: Louveaux, Q., Skutella, M. (eds.) IPCO 2016. LNCS, vol. 9682, pp. 262\u2013274. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33461-5_22"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcss.2002.1882","volume":"65","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Guha, S., Tardos, \u00c9., Shmoys, D.B.: A constant-factor approximation algorithm for the $$k$$-median problem. J. Comput. Syst. Sci. 65(1), 129\u2013149 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR16","unstructured":"Chuzhoy, J., Rabani, Y.: Approximating $$k$$-median with non-uniform capacities. In: Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 952\u2013958. SIAM (2005)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V.: Approximation schemes for capacitated clustering in doubling metrics. In: ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, pp. 2241\u20132259. SIAM (2020)","DOI":"10.1137\/1.9781611975994.138"},{"key":"7_CR18","unstructured":"Cohen-Addad, V., Gupta, A., Kumar, A., Lee, E., Li, J.: Tight FPT approximations for $$k$$-median and $$k$$-means. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP). LIPIcs, vol. 132, pp. 42:1\u201342:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"2","key":"7_CR19","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/17M112717X","volume":"48","author":"V Cohen-Addad","year":"2019","unstructured":"Cohen-Addad, V., Klein, P.N., Mathieu, C.: Local search yields approximation schemes for $$k$$-means and $$k$$-median in Euclidean and minor-free metrics. SIAM J. Comput. 48(2), 644\u2013667 (2019)","journal-title":"SIAM J. Comput."},{"key":"7_CR20","unstructured":"Cohen-Addad, V., Li, J.: On the fixed-parameter tractability of capacitated clustering. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP). LIPIcs, vol. 132, pp. 41:1\u201341:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"7_CR21","unstructured":"Cohen-Addad, V., Mathieu, C.: Effectiveness of local search for geometric optimization. In: 31st International Symposium on Computational Geometry, SoCG 2015. LIPIcs, vol. 34, pp. 329\u2013343. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., de\u00a0Mesmay, A., Rotenberg, E., Roytman, A.: The bane of low-dimensionality clustering. In: Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 441\u2013456. SIAM (2018)","DOI":"10.1137\/1.9781611975031.30"},{"key":"7_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"7_CR24","unstructured":"Dell, H., Marx, D.: Kernelization of packing problems. CoRR abs\/1812.03155 (2018)"},{"key":"7_CR25","unstructured":"Demirci, H.G., Li, S.: Constant approximation for capacitated $$k$$-median with $$(1+\\varepsilon )$$-capacity violation. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP). LIPIcs, vol. 55, pp. 73:1\u201373:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"4","key":"7_CR26","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/s00453-019-00616-2","volume":"82","author":"H Ding","year":"2020","unstructured":"Ding, H., Xu, J.: A unified framework for clustering constrained data without locality property. Algorithmica 82(4), 808\u2013852 (2020). https:\/\/doi.org\/10.1007\/s00453-019-00616-2","journal-title":"Algorithmica"},{"key":"7_CR27","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science, Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"7_CR28","unstructured":"Dvo\u0159\u00e1k, P., Feldmann, A.E., Knop, D., Masa\u0159\u00edk, T., Toufar, T., Vesel\u00fd, P.: Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. CoRR abs\/1710.00668 (2017)"},{"key":"7_CR29","unstructured":"Eiben, E., Kumar, M., Mouawad, A.E., Panolan, F., Siebertz, S.: Lossy kernels for connected dominating set on sparse graphs. In: 34th International Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol. 96, pp. 29:1\u201329:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Feldman, D., Langberg, M.: A unified framework for approximating and clustering data. In: 43rd Annual ACM Symposium on Theory of Computing (STOC), pp. 569\u2013578. ACM (2011)","DOI":"10.1145\/1993636.1993712"},{"issue":"3","key":"7_CR31","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/18M1209854","volume":"49","author":"D Feldman","year":"2020","unstructured":"Feldman, D., Schmidt, M., Sohler, C.: Turning big data into tiny data: constant-size coresets for $$k$$-means, PCA, and projective clustering. SIAM J. Comput. 49(3), 601\u2013657 (2020)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"7_CR32","doi-asserted-by":"publisher","first-page":"146","DOI":"10.3390\/a13060146","volume":"13","author":"AE Feldmann","year":"2020","unstructured":"Feldmann, A.E., Karthik, C.S., Lee, E., Manurangsi, P.: A survey on approximation in parameterized complexity: hardness and algorithms. Algorithms 13(6), 146 (2020)","journal-title":"Algorithms"},{"key":"7_CR33","unstructured":"Feng, Q., Zhang, Z., Huang, Z., Xu, J., Wang, J.: A unified framework of FPT approximation algorithms for clustering problems. In: 31st International Symposium on Algorithms and Computation (ISAAC). LIPIcs, vol. 181, pp. 5:1\u20135:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"2","key":"7_CR34","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/s10618-019-00669-5","volume":"34","author":"FV Fomin","year":"2020","unstructured":"Fomin, F.V., Golovach, P.A., Panolan, F.: Parameterized low-rank binary matrix approximation. Data Min. Knowl. Discov. 34(2), 478\u2013532 (2020). https:\/\/doi.org\/10.1007\/s10618-019-00669-5","journal-title":"Data Min. Knowl. Discov."},{"key":"7_CR35","volume-title":"Kernelization: Theory of Parameterized Preprocessing","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019)"},{"issue":"2","key":"7_CR36","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/17M1127181","volume":"48","author":"Z Friggstad","year":"2019","unstructured":"Friggstad, Z., Rezapour, M., Salavatipour, M.R.: Local search yields a PTAS for $$k$$-means in doubling metrics. SIAM J. Comput. 48(2), 452\u2013480 (2019)","journal-title":"SIAM J. Comput."},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: On coresets for $$k$$-means and $$k$$-median clustering. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 291\u2013300. ACM (2004)","DOI":"10.1145\/1007352.1007400"},{"key":"7_CR38","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-540-79474-5_8","volume-title":"Computational Intelligence Paradigms, Innovative Applications","author":"F H\u00f6ppner","year":"2008","unstructured":"H\u00f6ppner, F., Klawonn, F.: Clustering with size constraints. In: Jain, L.C., Sato-Ilic, M., Virvou, M., Tsihrintzis, G.A., Balas, V.E., Abeynayake, C. (eds.) Computational Intelligence Paradigms, Innovative Applications. SCI, vol. 137, pp. 167\u2013180. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79474-5_8"},{"issue":"2","key":"7_CR39","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and $$k$$-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48(2), 274\u2013296 (2001)","journal-title":"J. ACM"},{"key":"7_CR40","unstructured":"Krithika, R., Misra, P., Rai, A., Tale, P.: Lossy kernels for graph contraction problems. In: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). LIPIcs, vol. 65, pp. 23:1\u201323:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57(2), 5:1\u20135:32 (2010)","DOI":"10.1145\/1667053.1667054"},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Li, S.: On uniform capacitated $$k$$-median beyond the natural LP relaxation. ACM Trans. Algorithms 13(2), 22:1\u201322:18 (2017)","DOI":"10.1145\/2983633"},{"issue":"2","key":"7_CR43","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1137\/130938645","volume":"45","author":"S Li","year":"2016","unstructured":"Li, S., Svensson, O.: Approximating $$k$$-median via pseudo-approximation. SIAM J. Comput. 45(2), 530\u2013547 (2016)","journal-title":"SIAM J. Comput."},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Li, T.: A general model for clustering binary data. In: KDD 2005, pp. 188\u2013197 (2005)","DOI":"10.1137\/1.9781611972757.54"},{"key":"7_CR45","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Panolan, F., Ramanujan, M.S., Saurabh, S.: Lossy kernelization. In: 49th Annual ACM Symposium on Theory of Computing (STOC), pp. 224\u2013237. ACM (2017)","DOI":"10.1145\/3055399.3055456"},{"key":"7_CR46","unstructured":"Manurangsi, P., Raghavendra, P.: A birthday repetition theorem and complexity of approximating dense CSPs. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"7_CR47","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximation: gap location. Comput. Complex. 4, 133\u2013157 (1994). https:\/\/doi.org\/10.1007\/BF01202286","journal-title":"Comput. Complex."},{"key":"7_CR48","unstructured":"Siebertz, S.: Lossy kernels for connected distance-$$r$$ domination on nowhere dense graph classes. CoRR abs\/1707.09819 (2017)"},{"key":"7_CR49","doi-asserted-by":"crossref","unstructured":"Sohler, C., Woodruff, D.P.: Strong coresets for $$k$$-median and subspace approximation: goodbye dimension. In: 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 802\u2013813. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00081"},{"issue":"05","key":"7_CR50","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: $$k$$-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 10(05), 557\u2013570 (2002)","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"7_CR51","doi-asserted-by":"crossref","unstructured":"Vallejo-Huanga, D., Morillo, P., Ferri, C.: Semi-supervised clustering algorithms for grouping scientific articles. In: International Conference on Computational Science (ICCS) (2017). Procedia Comput. Sci. 108, 325\u2013334. Elsevier","DOI":"10.1016\/j.procs.2017.05.206"},{"key":"7_CR52","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Li, T., Ding, C., Zhang, X.: Binary matrix factorization with applications. In: ICDM 2007, pp. 391\u2013400. IEEE (2007)","DOI":"10.1109\/ICDM.2007.99"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09574-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T23:03:11Z","timestamp":1656284591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09574-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031095733","9783031095740"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09574-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"29 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 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":"csr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2022\/","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":"51","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":"21","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":"41% - 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":"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)"}}]}}