{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:49:26Z","timestamp":1759042166496,"version":"3.40.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_1","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Routing Among Convex Polygonal Obstacles in the Plane"],"prefix":"10.1007","author":[{"given":"R.","family":"Inkulu","sequence":"first","affiliation":[]},{"given":"Pawan","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-642-24100-0_39","volume-title":"Distributed Computing","author":"I Abraham","year":"2011","unstructured":"Abraham, I., Gavoille, C.: On approximate distance labels and routing schemes with affine stretch. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 404\u2013415. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24100-0_39"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-61680-2_79","volume-title":"Algorithms\u2014ESA 1996","author":"S Arikati","year":"1996","unstructured":"Arikati, S., Chen, D.Z., Chew, L.P., Das, G., Smid, M., Zaroliagis, C.D.: Planar spanners and approximate shortest path queries among obstacles in the plane. In: Diaz, J., Serna, M. (eds.) ESA 1996. LNCS, vol. 1136, pp. 514\u2013528. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61680-2_79"},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T Asano","year":"1986","unstructured":"Asano, T., Asano, T., Guibas, L.J., Hershberger, J., Imai, H.: Visibility of disjoint polygons. Algorithmica 1(1), 49\u201363 (1986). https:\/\/doi.org\/10.1007\/BF01840436","journal-title":"Algorithmica"},{"issue":"3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0196-6774(90)90017-9","volume":"11","author":"B Awerbuch","year":"1990","unstructured":"Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Improved routing strategies with succinct tables. J. Algorithms 11(3), 307\u2013341 (1990)","journal-title":"J. Algorithms"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"101593","DOI":"10.1016\/j.comgeo.2019.101593","volume":"87","author":"B Banyassady","year":"2020","unstructured":"Banyassady, B., et al.: Routing in polygonal domains. Comput. Geom. 87, 101593 (2020)","journal-title":"Comput. Geom."},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1142\/S0218195994000252","volume":"4","author":"R Bar-Yehuda","year":"1994","unstructured":"Bar-Yehuda, R., Chazelle, B.: Triangulating disjoint Jordan chains. Int. J. Comput. Geom. Appl. 4(4), 475\u2013481 (1994)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1137\/140988103","volume":"44","author":"P Bose","year":"2015","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Optimal local routing on Delaunay triangulations defined by empty equilateral triangles. SIAM J. Comput. 44, 1626\u20131649 (2015)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1_CR8","first-page":"125","volume":"8","author":"P Bose","year":"2017","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive local routing with constraints. J. Comput. Geom. 8(1), 125\u2013152 (2017)","journal-title":"J. Comput. Geom."},{"key":"1_CR9","unstructured":"Bose, P., Korman, M., van Renssen, A., Verdonschot, S.: Routing on the visibility graph. In: Proceedings of International Symposium on Algorithms and Computation, pp. 18:1\u201318:2 (2017)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.tcs.2021.02.017","volume":"861","author":"P Bose","year":"2021","unstructured":"Bose, P., Korman, M., van Renssen, A., Verdonschot, S.: Constrained routing between non-visible vertices. Theor. Comput. Sci. 861, 144\u2013154 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2004.05.019","volume":"324","author":"P Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Competitive online routing in geometric graphs. Theor. Comput. Sci. 324(2), 273\u2013288 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"1_CR12","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.comgeo.2013.04.002","volume":"46","author":"P Bose","year":"2013","unstructured":"Bose, P., Smid, M.: On plane geometric spanners: a survey and open problems. Comput. Geom. 46(7), 818\u2013830 (2013)","journal-title":"Comput. Geom."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Chechik, S.: Compact routing schemes with improved stretch. In: Proceedings of Symposium on Principles of Distributed Computing, pp. 33\u201341 (2013)","DOI":"10.1145\/2484239.2484268"},{"key":"1_CR14","unstructured":"Chen, D.Z.: On the all-pairs Euclidean short path problem. In: Proceedings of Symposium on Discrete Algorithms, pp. 292\u2013301 (1995)"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.comgeo.2014.08.003","volume":"48","author":"DZ Chen","year":"2015","unstructured":"Chen, D.Z., Wang, H.: Visibility and ray shooting queries in polygonal domains. Comput. Geom. 48(2), 31\u201341 (2015)","journal-title":"Comput. Geom."},{"key":"1_CR16","unstructured":"Chiang, Y.-J., Mitchell, J.S.B.: Two-point Euclidean shortest path queries in the plane. In: Proceedings of Symposium on Discrete Algorithms, pp. 215\u2013224 (1999)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Kapoor, S., Vaidya, P.M.: Rectilinear shortest paths through polygonal obstacles in $$O(n(\\lg {n})^2)$$ time. In: Proceedings of Symposium on Computational Geometry, pp. 251\u2013257 (1987)","DOI":"10.1145\/41958.41985"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1006\/jagm.2000.1134","volume":"38","author":"L Cowen","year":"1999","unstructured":"Cowen, L.: Compact routing with minimum stretch. J. Algorithms 38, 170\u2013183 (1999)","journal-title":"J. Algorithms"},{"key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0196-6774(03)00002-6","volume":"46","author":"T Eilam","year":"2003","unstructured":"Eilam, T., Gavoille, C., Peleg, D.: Compact routing schemes with low stretch factor. J. Algorithms 46(2), 97\u2013114 (2003)","journal-title":"J. Algorithms"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"Automata, Languages and Programming","author":"P Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 757\u2013772. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_62"},{"key":"1_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"SK Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"LJ Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209\u2013233 (1987). https:\/\/doi.org\/10.1007\/BF01840360","journal-title":"Algorithmica"},{"issue":"6","key":"1_CR24","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J Hershberger","year":"1999","unstructured":"Hershberger, J., Suri, S.: An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput. 28(6), 2215\u20132256 (1999)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"1_CR25","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.comgeo.2009.02.005","volume":"42","author":"R Inkulu","year":"2009","unstructured":"Inkulu, R., Kapoor, S.: Planar rectilinear shortest path computation using corridors. Comput. Geom. 42(9), 873\u2013884 (2009)","journal-title":"Comput. Geom."},{"key":"1_CR26","unstructured":"Inkulu, R., Kapoor, S.: Approximate Euclidean shortest paths amid polygonal obstacles. In: Proceedings of Symposium on Algorithms and Computation (2019)"},{"key":"1_CR27","unstructured":"Inkulu, R., Kapoor, S., Maheshwari, S.N.: A near optimal algorithm for finding Euclidean shortest path in polygonal domain. CoRR 1011.6481 (2010)"},{"issue":"3","key":"1_CR28","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1007\/s00453-017-0308-2","volume":"80","author":"H Kaplan","year":"2018","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P.: Routing in unit disk graphs. Algorithmica 80(3), 830\u2013848 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0308-2","journal-title":"Algorithmica"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Kapoor, S.: Efficient computation of geodesic shortest paths. In: Proceedings of Symposium on Theory of Computing, pp. 770\u2013779 (1999)","DOI":"10.1145\/301250.301449"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Kapoor, S., Maheshwari, S.N.: Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles. In: Proceedings of Symposium on Computational Geometry, pp. 172\u2013182 (1988)","DOI":"10.1145\/73393.73411"},{"issue":"3","key":"1_CR31","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1137\/S0097539795253591","volume":"30","author":"S Kapoor","year":"2000","unstructured":"Kapoor, S., Maheshwari, S.N.: Efficiently constructing the visibility graph of a simple polygon with obstacles. SIAM J. Comput. 30(3), 847\u2013871 (2000)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1_CR32","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/PL00009323","volume":"18","author":"S Kapoor","year":"1997","unstructured":"Kapoor, S., Maheshwari, S.N., Mitchell, J.S.B.: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discrete Comput. Geom. 18(4), 377\u2013383 (1997). https:\/\/doi.org\/10.1007\/PL00009323","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"1_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2876055","volume":"12","author":"G Konjevod","year":"2016","unstructured":"Konjevod, G., Richa, A.W., Xia, D.: Scale-free compact routing schemes in networks of low doubling dimension. ACM Trans. Algorithms 12(3), 1\u201329 (2016)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"1_CR34","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"JSB Mitchell","year":"1996","unstructured":"Mitchell, J.S.B.: Shortest paths among obstacles in the plane. Int. J. Comput. Geom. Appl. 6(3), 309\u2013332 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"1_CR35","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Handbook of Discrete and Computational Geometry, pp. 811\u2013848. CRC Press (2017)"},{"key":"1_CR36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.H.M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Overmars, M.H., Welzl, E.: New methods for computing visibility graphs. In: Proceedings of the Fourth Annual Symposium on Computational Geometry, pp. 164\u2013171 (1988)","DOI":"10.1145\/73393.73410"},{"issue":"3","key":"1_CR38","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. J. ACM 36(3), 510\u2013530 (1989)","journal-title":"J. ACM"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Roditty, L., Tov, R.: New routing techniques and their applications. In: Proceedings of ACM Symposium on Principles of Distributed Computing, pp. 23\u201332 (2015)","DOI":"10.1145\/2767386.2767409"},{"issue":"1","key":"1_CR40","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00446-015-0256-5","volume":"29","author":"L Roditty","year":"2015","unstructured":"Roditty, L., Tov, R.: Close to linear space routing schemes. Distrib. Comput. 29(1), 65\u201374 (2015). https:\/\/doi.org\/10.1007\/s00446-015-0256-5","journal-title":"Distrib. Comput."},{"issue":"1","key":"1_CR41","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labelling and implicit routing in networks. Comput. J. 28(1), 5\u20138 (1985)","journal-title":"Comput. J."},{"issue":"1","key":"1_CR42","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M Sharir","year":"1986","unstructured":"Sharir, M., Schorr, A.: On shortest paths in polyhedral spaces. SIAM J. Comput. 15(1), 193\u2013215 (1986)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"1_CR43","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1145\/185675.185795","volume":"41","author":"JA Storer","year":"1994","unstructured":"Storer, J.A., Reif, J.H.: Shortest paths in the plane with polygonal obstacles. J. ACM 41(5), 982\u20131012 (1994)","journal-title":"J. ACM"},{"issue":"6","key":"1_CR44","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M Thorup","year":"2004","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51(6), 993\u20131024 (2004)","journal-title":"J. ACM"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of Symposium on Parallel Algorithms and Architectures, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"issue":"1","key":"1_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52(1), 1\u201324 (2005)","journal-title":"J. ACM"},{"issue":"4","key":"1_CR47","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","volume":"20","author":"E Welzl","year":"1985","unstructured":"Welzl, E.: Constructing the visibility graph for $$n$$-line segments in $$O(n^2)$$ time. Inf. Process. Lett. 20(4), 167\u2013171 (1985)","journal-title":"Inf. Process. Lett."},{"issue":"7","key":"1_CR48","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.comgeo.2012.01.015","volume":"45","author":"C Yan","year":"2012","unstructured":"Yan, C., Xiang, Y., Dragan, F.F.: Compact and low delay routing labeling scheme for unit disk graphs. Comput. Geom. 45(7), 305\u2013325 (2012)","journal-title":"Comput. Geom."},{"issue":"4","key":"1_CR49","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"AC Yao","year":"1982","unstructured":"Yao, A.C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11(4), 721\u2013736 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:03:38Z","timestamp":1639353818000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","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":"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":"16","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":"8","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":"26% - 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":"4.2","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":"2.75","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)"}}]}}