{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:56:53Z","timestamp":1743004613699,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030489656"},{"type":"electronic","value":"9783030489663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_10","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"126-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal In-place Algorithms for Basic Graph Problems"],"prefix":"10.1007","author":[{"given":"Sankardeep","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasa Rao","family":"Satti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"issue":"1","key":"10_CR1","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)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.comgeo.2013.11.004","volume":"47","author":"T Asano","year":"2014","unstructured":"Asano, T., et al.: Reprint of: memory-constrained algorithms for simple polygons. Comput. Geom. 47(3), 469\u2013479 (2014)","journal-title":"Comput. Geom."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-319-13075-0_44","volume-title":"Algorithms and Computation","author":"T Asano","year":"2014","unstructured":"Asano, T., et al.: Depth-first search using $$O(n)$$ bits. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 553\u2013564. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_44"},{"issue":"1","key":"10_CR4","first-page":"46","volume":"2","author":"T Asano","year":"2011","unstructured":"Asano, T., Mulzer, W., Rote, G., Wang, Y.: Constant-work-space algorithms for geometric problems. JoCG 2(1), 46\u201368 (2011)","journal-title":"JoCG"},{"issue":"8","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1736","DOI":"10.1007\/s00224-017-9841-2","volume":"62","author":"N Banerjee","year":"2018","unstructured":"Banerjee, N., Chakraborty, S., Raman, V., Satti, S.R.: Space efficient linear time algorithms for BFS, DFS and applications. Theory Comput. Syst. 62(8), 1736\u20131762 (2018)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1007\/s00453-014-9893-5","volume":"72","author":"L Barba","year":"2015","unstructured":"Barba, L., Korman, M., Langerman, S., Sadakane, K., Silveira, R.I.: Space-time trade-offs for stack-based algorithms. Algorithmica 72(4), 1097\u20131129 (2015)","journal-title":"Algorithmica"},{"issue":"5","key":"10_CR7","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1137\/S0097539793283151","volume":"27","author":"G Barnes","year":"1998","unstructured":"Barnes, G., Buss, J., Ruzzo, W., Schieber, B.: A sublinear space, polynomial time algorithm for directed s-t connectivity. SIAM J. Comput. 27(5), 1273\u20131282 (1998)","journal-title":"SIAM J. Comput."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Br\u00f6nnimann, H., Chan, T.M., Chen, E.Y.: Towards in-place geometric algorithms and data structures. In: SOCG, pp. 239\u2013246 (2004)","DOI":"10.1145\/997817.997854"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Kouck\u00fd, M., Loff, B., Speelman, F.: Computing with a full memory: catalytic space. In: STOC, pp. 857\u2013866 (2014)","DOI":"10.1145\/2591796.2591874"},{"key":"10_CR10","unstructured":"Chakraborty, S.: Space efficient graph algorithms. Ph.D. thesis, The Institute of Mathematical Sciences, HBNI, India (2018)"},{"key":"10_CR11","unstructured":"Chakraborty, S., Mukherjee, A., Raman, V., Satti, S.R.: A framework for in-place graph algorithms. In: ESA, pp. 13:1\u201313:16 (2018)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-030-25027-0_14","volume-title":"Fundamentals of Computation Theory","author":"S Chakraborty","year":"2019","unstructured":"Chakraborty, S., Mukherjee, A., Satti, S.R.: Space efficient algorithms for breadth-depth search. In: G\u0105sieniec, L.A., Jansson, J., Levcopoulos, C. (eds.) FCT 2019. LNCS, vol. 11651, pp. 201\u2013212. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25027-0_14"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.jcss.2017.06.006","volume":"90","author":"S Chakraborty","year":"2017","unstructured":"Chakraborty, S., Raman, V., Satti, S.R.: Biconnectivity, st-numbering and other applications of DFS using O(n) bits. J. Comput. Syst. Sci. 90, 63\u201379 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR14","unstructured":"Chakraborty, S., Sadakane, K.: Indexing graph search trees and applications. In: 44th MFCS. LIPIcs, vol. 138, pp. 67:1\u201367:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"10_CR15","unstructured":"Chakraborty, S., Sadakane, K., Satti, S.R.: Optimal in-place algorithms for basic graph problems. CoRR, abs\/1907.09280 (2019)"},{"issue":"2","key":"10_CR16","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10878-018-0270-1","volume":"37","author":"S Chakraborty","year":"2018","unstructured":"Chakraborty, S., Satti, S.R.: Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS. J. Comb. Optim. 37(2), 465\u2013481 (2018)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00454-006-1275-6","volume":"37","author":"TM Chan","year":"2007","unstructured":"Chan, T.M., Chen, E.Y.: Multi-pass geometric algorithms. Discret. Comput. Geom. 37(1), 79\u2013102 (2007)","journal-title":"Discret. Comput. Geom."},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-45030-3_38","volume-title":"Algorithms and Computation","author":"TM Chan","year":"2013","unstructured":"Chan, T.M., Munro, J.I., Raman, V.: Faster, space-efficient selection algorithms in read-only memory for integers. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 405\u2013412. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45030-3_38"},{"issue":"2","key":"10_CR19","first-page":"11:1","volume":"14","author":"TM Chan","year":"2018","unstructured":"Chan, T.M., Munro, J.I., Raman, V.: Selection and sorting in the \u201crestore\u201d model. ACM Trans. Algorithms 14(2), 11:1\u201311:18 (2018)","journal-title":"ACM Trans. Algorithms"},{"key":"10_CR20","unstructured":"Clark, D.R.: Compact pat trees. Ph.D. thesis. University of Waterloo, Canada (1996)"},{"key":"10_CR21","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-662-44777-2_24","volume-title":"Algorithms - ESA 2014","author":"O Darwish","year":"2014","unstructured":"Darwish, O., Elmasry, A.: Optimal time-space tradeoff for the 2D convex-hull problem. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 284\u2013295. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_24"},{"key":"10_CR23","unstructured":"Diestel, R.: Graph Theory, 4th edn (2012)"},{"issue":"2","key":"10_CR24","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P Elias","year":"1974","unstructured":"Elias, P.: Efficient storage and retrieval by content and address of static files. J. ACM 21(2), 246\u2013260 (1974)","journal-title":"J. ACM"},{"key":"10_CR25","unstructured":"Elmasry, A., Hagerup, T., Kammer, F.: Space-efficient basic graph algorithms. In: 32nd STACS, pp. 288\u2013301 (2015)"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2014.06.012","volume":"554","author":"A Elmasry","year":"2014","unstructured":"Elmasry, A., Juhl, D.D., Katajainen, J., Satti, S.R.: Selection from read-only memory with limited workspace. Theor. Comput. Sci. 554, 64\u201373 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10_CR27","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S Even","year":"1976","unstructured":"Even, S., Tarjan, R.E.: Computing an st-numbering. Theor. Comput. Sci. 2(3), 339\u2013344 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR28","unstructured":"Fano, R.M.: On the number of bits required to implement an associative memory. Memorandum 61, Computer Structures Group, MIT, Cambridge (1971)"},{"issue":"2\u20133","key":"10_CR29","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2005.09.013","volume":"348","author":"J Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2\u20133), 207\u2013216 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Franceschini, G., Munro, J.I.: Implicit dictionaries with O(1) modifications per update and fast search. In: SODA, pp. 404\u2013413 (2006)","DOI":"10.1145\/1109557.1109603"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-540-73420-8_47","volume-title":"Automata, Languages and Programming","author":"G Franceschini","year":"2007","unstructured":"Franceschini, G., Muthukrishnan, S.: In-place suffix sorting. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 533\u2013545. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73420-8_47"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-75520-3_19","volume-title":"Algorithms \u2013 ESA 2007","author":"G Franceschini","year":"2007","unstructured":"Franceschini, G., Muthukrishnan, S., P\u01cetra\u015fcu, M.: Radix sorting with no extra space. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 194\u2013205. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_19"},{"issue":"1","key":"10_CR33","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0022-0000(87)90002-X","volume":"34","author":"GN Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Upper bounds for time-space trade-offs in sorting and selection. J. Comput. Syst. Sci. 34(1), 19\u201326 (1987)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-030-17402-6_24","volume-title":"Algorithms and Complexity","author":"F Kammer","year":"2019","unstructured":"Kammer, F., Sajenko, A.: Linear-time in-place DFS and BFS on the word RAM. In: Heggernes, P. (ed.) CIAC 2019. LNCS, vol. 11485, pp. 286\u2013298. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17402-6_24"},{"key":"10_CR35","unstructured":"Kouck\u00fd, M.: Catalytic computation. Bull. EATCS 118 (2016). http:\/\/eatcs.org\/beatcs\/index.php\/beatcs\/article\/view\/400"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-19487-8_2","volume-title":"SWAT 88","author":"TW Lai","year":"1988","unstructured":"Lai, T.W., Wood, D.: Implicit selection. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 14\u201323. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19487-8_2"},{"issue":"1","key":"10_CR37","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"JI Munro","year":"1986","unstructured":"Munro, J.I.: An implicit data structure supporting insertion, deletion, and search in O(log$${^2}$$ n) time. J. Comput. Syst. Sci. 33(1), 66\u201374 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Munro, J.I.: Tables. In: FSTTCS, pp. 37\u201342 (1996)","DOI":"10.1007\/3-540-62034-6_35"},{"key":"10_CR39","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"JI Munro","year":"1980","unstructured":"Munro, J.I., Paterson, M.: Selection and sorting with limited storage. Theor. Comput. Sci. 12, 315\u2013323 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Pagter, J., Rauhe, T.: Optimal time-space trade-offs for sorting. In: FOCS, pp. 264\u2013268 (1998)","DOI":"10.7146\/brics.v5i10.19282"},{"key":"10_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-45061-0_30","volume-title":"Automata, Languages and Programming","author":"R Raman","year":"2003","unstructured":"Raman, R., Rao, S.S.: Succinct dynamic dictionaries and trees. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 357\u2013368. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_30"},{"issue":"7","key":"10_CR42","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ipl.2013.01.016","volume":"113","author":"JM Schmidt","year":"2013","unstructured":"Schmidt, J.M.: A simple test on 2-vertex- and 2-edge-connectivity. Inf. Process. Lett. 113(7), 241\u2013244 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"10_CR43","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10_CR44","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0020-0190(74)90003-9","volume":"2","author":"RE Tarjan","year":"1974","unstructured":"Tarjan, R.E.: A note on finding the bridges of a graph. Inf. Process. Lett. 2(6), 160\u2013161 (1974)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"10_CR45","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48966-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:15:39Z","timestamp":1710256539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","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":"62","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":"30","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":"48% - 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,8","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,9","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)"}},{"value":"The conference had to be postponed due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}