{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T01:53:13Z","timestamp":1772502793649,"version":"3.50.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031183669","type":"print"},{"value":"9783031183676","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-18367-6_11","type":"book-chapter","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T16:05:36Z","timestamp":1666281936000},"page":"211-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Streaming Algorithms for\u00a0Geometric Independent Set and\u00a0Clique"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0104-1659","authenticated-orcid":false,"given":"Sujoy","family":"Bhore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7791-3604","authenticated-orcid":false,"given":"Fabian","family":"Klute","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jelle J.","family":"Oostveen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,21]]},"reference":[{"issue":"3\u20134","key":"11_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"PK Agarwal","year":"1998","unstructured":"Agarwal, P.K., van Kreveld, M.J., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom.: Theory Appl. 11(3\u20134), 209\u2013218 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(98)00028-5","journal-title":"Comput. Geom.: Theory Appl."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-540-39658-1_50","volume-title":"Algorithms - ESA 2003","author":"PK Agarwal","year":"2003","unstructured":"Agarwal, P.K., Krishnan, S., Mustafa, N.H., Venkatasubramanian, S.: Streaming geometric optimization using graphics hardware. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 544\u2013555. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_50"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.comgeo.2005.12.001","volume":"34","author":"PK Agarwal","year":"2006","unstructured":"Agarwal, P.K., Mustafa, N.H.: Independent set of intersection graphs of convex objects in 2D. Comput. Geom.: Theory Appl. 34(2), 83\u201395 (2006). https:\/\/doi.org\/10.1016\/j.comgeo.2005.12.001","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137\u2013147 (1999). https:\/\/doi.org\/10.1006\/jcss.1997.1545","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Bakshi, A., Chepurko, N., Woodruff, D.P.: Weighted maximum independent set of geometric objects in turnstile streams. In: Proceedings of the Annual International Conference on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2020). LIPIcs, vol. 176, pp. 64:1\u201364:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX\/RANDOM.2020.64","DOI":"10.4230\/LIPIcs.APPROX\/RANDOM.2020.64"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas, E., Yu, C.S.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4), 1054\u20131068 (1986). https:\/\/doi.org\/10.1137\/0215075","journal-title":"SIAM J. Comput."},{"issue":"5","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM 48(5), 1069\u20131090 (2001). https:\/\/doi.org\/10.1145\/502102.502107","journal-title":"J. ACM"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703437843","volume":"36","author":"R Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M.M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM J. Comput. 36(1), 1\u201315 (2006). https:\/\/doi.org\/10.1137\/S0097539703437843","journal-title":"SIAM J. Comput."},{"issue":"5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10951-014-0398-5","volume":"18","author":"R van Bevern","year":"2014","unstructured":"van Bevern, R., Mnich, M., Niedermeier, R., Weller, M.: Interval scheduling and colorful independent sets. J. Sched. 18(5), 449\u2013469 (2014). https:\/\/doi.org\/10.1007\/s10951-014-0398-5","journal-title":"J. Sched."},{"key":"11_CR10","unstructured":"Bhore, S., Cardinal, J., Iacono, J., Koumoutsos, G.: Dynamic geometric independent set. CoRR abs\/2007.08643 (2020). https:\/\/arxiv.org\/abs\/2007.08643"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2017.08.015","volume":"702","author":"S Cabello","year":"2017","unstructured":"Cabello, S., P\u00e9rez-Lantero, P.: Interval selection in the streaming model. Theor. Comput. Sci. 702, 77\u201396 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.08.015","journal-title":"Theor. Comput. Sci."},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Cardinal, J., Iacono, J., Koumoutsos, G.: Worst-case efficient dynamic geometric independent set. In: Proceedings of the 29th Annual European Symposium on Algorithms (ESA 2021). LIPIcs, vol. 204, pp. 25:1\u201325:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.25","DOI":"10.4230\/LIPIcs.ESA.2021.25"},{"key":"11_CR13","unstructured":"Chakrabarti, A.: CS49: data stream algorithms lecture notes (2020). http:\/\/www.cs.dartmouth.edu\/ac\/Teach\/data-streams-lecnotes.pdf"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Chakrabarti, A., Khot, S., Sun, X.: Near-optimal lower bounds on the multi-party communication complexity of set disjointness. In: 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), Aarhus, Denmark, 7\u201310 July 2003, pp. 107\u2013117. IEEE Computer Society (2003). https:\/\/doi.org\/10.1109\/CCC.2003.1214414","DOI":"10.1109\/CCC.2003.1214414"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00454-012-9417-5","volume":"48","author":"TM Chan","year":"2012","unstructured":"Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. Discret. Comput. Geom. 48(2), 373\u2013392 (2012). https:\/\/doi.org\/10.1007\/s00454-012-9417-5","journal-title":"Discret. Comput. Geom."},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Chen, X., Jayaram, R., Levi, A., Waingarten, E.: New streaming algorithms for high dimensional EMD and MST. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2022), pp. 222\u2013233. ACM (2022). https:\/\/doi.org\/10.1145\/3519935.3519979","DOI":"10.1145\/3519935.3519979"},{"key":"11_CR17","unstructured":"Compton, S., Mitrovic, S., Rubinfeld, R.: New partitioning techniques and faster algorithms for approximate interval scheduling. CoRR abs\/2012.15002 (2020). https:\/\/arxiv.org\/abs\/2012.15002"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Cormode, G., Dark, J., Konrad, C.: Independent sets in vertex-arrival streams. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, (ICALP 2019). LIPIcs, vol. 132, pp. 45:1\u201345:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.45","DOI":"10.4230\/LIPIcs.ICALP.2019.45"},{"key":"11_CR19","unstructured":"Czumaj, A., Jiang, S.H., Krauthgamer, R., Vesel\u00fd, P.: Streaming algorithms for geometric steiner forest. CoRR abs\/2011.04324 (2020). https:\/\/arxiv.org\/abs\/2011.04324"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Emek, Y., Halld\u00f3rsson, M.M., Ros\u00e9n, A.: Space-constrained interval selection. ACM Trans. Algorithms 12(4), 51:1\u201351:32 (2016). https:\/\/doi.org\/10.1145\/2886102","DOI":"10.1145\/2886102"},{"issue":"6","key":"11_CR21","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM J. Comput. 34(6), 1302\u20131323 (2005). https:\/\/doi.org\/10.1137\/S0097539702402676","journal-title":"SIAM J. Comput."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Computing the independence number of intersection graphs. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 1161\u20131165. SIAM (2011)","DOI":"10.1137\/1.9781611973082.87"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Frahling, G., Sohler, C.: Coresets in dynamic geometric data streams. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 209\u2013217. ACM (2005). https:\/\/doi.org\/10.1145\/1060590.1060622","DOI":"10.1145\/1060590.1060622"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"G\u00e1lvez, W., Khan, A., Mari, M., M\u00f6mke, T., Pittu, M.R., Wiese, A.: A 3-approximation algorithm for maximum independent set of rectangles. In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, (SODA 2022), pp. 894\u2013905. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.38","DOI":"10.1137\/1.9781611977073.38"},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F Gavril","year":"1973","unstructured":"Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3(3), 261\u2013273 (1973). https:\/\/doi.org\/10.1002\/net.3230030305","journal-title":"Networks"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.tcs.2014.09.046","volume":"562","author":"A Gavruskin","year":"2015","unstructured":"Gavruskin, A., Khoussainov, B., Kokho, M., Liu, J.: Dynamic algorithms for monotonic interval scheduling problem. Theor. Comput. Sci. 562, 227\u2013242 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.09.046","journal-title":"Theor. Comput. Sci."},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-642-14165-2_54","volume-title":"Automata, Languages and Programming","author":"BV Halld\u00f3rsson","year":"2010","unstructured":"Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Losievskaja, E., Szegedy, M.: Streaming algorithms for independent sets. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 641\u2013652. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_54"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within $$n^{1-\\epsilon }$$. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS 1996), pp. 627\u2013636. IEEE Computer Society (1996). https:\/\/doi.org\/10.1109\/SFCS.1996.548522","DOI":"10.1109\/SFCS.1996.548522"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Henzinger, M., Neumann, S., Wiese, A.: Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. In: Proceedings of the 36th International Symposium on Computational Geometry (SoCG 2020). LIPIcs, vol. 164, pp. 51:1\u201351:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2020.51","DOI":"10.4230\/LIPIcs.SoCG.2020.51"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-30538-5_3","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"P Indyk","year":"2004","unstructured":"Indyk, P.: Streaming algorithms for geometric problems. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 32\u201334. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30538-5_3"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Trotter, L.E., Jr.: Algorithmic graph theory and perfect graphs, by Martin C. Golumbic, academic, New York, 284 pp. price: \\$34.00. Networks 13(2), 304\u2013305 (1983). https:\/\/doi.org\/10.1002\/net.3230130214","DOI":"10.1002\/net.3230130214"},{"key":"11_CR32","doi-asserted-by":"publisher","unstructured":"Kane, D.M., Nelson, J., Woodruff, D.P.: An optimal algorithm for the distinct elements problem. In: Proceedings of the 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2010), pp. 41\u201352. ACM (2010). https:\/\/doi.org\/10.1145\/1807085.1807094","DOI":"10.1145\/1807085.1807094"},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Proceedings of a Symposium on the Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"11_CR34","volume-title":"Algorithm Design","author":"JM Kleinberg","year":"2006","unstructured":"Kleinberg, J.M., Tardos, \u00c9.: Algorithm Design. Addison-Wesley, Boston (2006)"},{"issue":"1","key":"11_CR35","first-page":"85","volume":"31","author":"J Kratochv\u00edl","year":"1990","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J.: Independent set and clique problems in intersection-defined classes of graphs. Comment. Math. Univ. Carol. 31(1), 85\u201393 (1990)","journal-title":"Comment. Math. Univ. Carol."},{"issue":"1","key":"11_CR36","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/2627692.2627694","volume":"43","author":"A McGregor","year":"2014","unstructured":"McGregor, A.: Graph stream algorithms: a survey. SIGMOD Rec. 43(1), 9\u201320 (2014). https:\/\/doi.org\/10.1145\/2627692.2627694","journal-title":"SIGMOD Rec."},{"key":"11_CR37","doi-asserted-by":"publisher","unstructured":"Mitchell, J.S.B.: Approximating maximum independent set for rectangles in the plane. In: Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, pp. 339\u2013350. IEEE (2021). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00042","DOI":"10.1109\/FOCS52979.2021.00042"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S., et al.: Data streams: algorithms and applications. Found. Trends\u00ae Theor. Comput. Sci. 1(2), 117\u2013236 (2005)","DOI":"10.1561\/0400000002"},{"issue":"1","key":"11_CR39","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3(1), 103\u2013128 (2007). https:\/\/doi.org\/10.4086\/toc.2007.v003a006","journal-title":"Theory Comput."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18367-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T16:07:01Z","timestamp":1666282021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18367-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031183669","9783031183676"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18367-6_11","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":"21 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","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":"8 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2022.eu\/waoa\/","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":"21","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":"12","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":"57% - 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":"3","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)"}}]}}