{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T19:45:16Z","timestamp":1770061516421,"version":"3.49.0"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030835071","type":"print"},{"value":"9783030835088","type":"electronic"}],"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-83508-8_22","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"300-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs"],"prefix":"10.1007","author":[{"given":"Feodor F.","family":"Dragan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Ducoffe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heather M.","family":"Guarnera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Vassilevska Williams, V., Wang, J.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: SODA, pp. 377\u2013391. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch28"},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/net.21631","volume":"67","author":"M Abu-Ata","year":"2016","unstructured":"Abu-Ata, M., Dragan, F.F.: Metric tree-like structures in real-world networks: an empirical study. Networks 67(1), 49\u201368 (2016)","journal-title":"Networks"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1090\/conm\/453\/08795","volume":"453","author":"H-J Bandelt","year":"2008","unstructured":"Bandelt, H.-J., Chepoi, V.: Metric graph theory and geometry: a survey. Contemp. Math. 453, 49\u201386 (2008)","journal-title":"Contemp. Math."},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0195-6698(89)80053-8","volume":"10","author":"H-J Bandelt","year":"1989","unstructured":"Bandelt, H.-J., Pesch, E.: Dismantling absolute retracts of reflexive graphs. Eur. J. Comb. 10(3), 211\u2013220 (1989)","journal-title":"Eur. J. Comb."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-662-48350-3_19","volume-title":"Algorithms - ESA 2015","author":"M Borassi","year":"2015","unstructured":"Borassi, M., Coudert, D., Crescenzi, P., Marino, A.: On computing the hyperbolicity of real-world graphs. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 215\u2013226. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_19"},{"key":"22_CR6","first-page":"51","volume":"322","author":"M Borassi","year":"2016","unstructured":"Borassi, M., Crescenzi, P., Habib, M.: Into the square: on the complexity of some quadratic-time solvable problems. Electron. Notes TCS 322, 51\u201367 (2016)","journal-title":"Electron. Notes TCS"},{"issue":"1\u20133","key":"22_CR7","first-page":"43","volume":"82","author":"A Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, A., Chepoi, V., Dragan, F.F.: The algorithmic use of hypertree structure and maximum neighbourhood orderings. DAM 82(1\u20133), 43\u201377 (1998)","journal-title":"DAM"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1137\/S0895480193253415","volume":"11","author":"A Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Chepoi, V., Voloshin, V.: Dually chordal graphs. SIDMA 11(3), 437\u2013455 (1998)","journal-title":"SIDMA"},{"key":"22_CR9","unstructured":"Bringmann, K., Husfeldt, T., Magnusson, M.: Multivariate analysis of orthogonal range searching and graph distances parameterized by treewidth. In: IPEC (2018)"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00026-001-8007-7","volume":"5","author":"G Brinkmann","year":"2001","unstructured":"Brinkmann, G., Koolen, J., Moulton, V.: On the hyperbolicity of chordal graphs. Ann. Comb. 5(1), 61\u201369 (2001)","journal-title":"Ann. Comb."},{"issue":"2","key":"22_CR11","first-page":"21","volume":"15","author":"S Cabello","year":"2018","unstructured":"Cabello, S.: Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs. ACM TALG 15(2), 21 (2018)","journal-title":"ACM TALG"},{"key":"22_CR12","unstructured":"Chalopin, J., Chepoi, V., Dragan, F.F., Ducoffe, G., Mohammed, A., Vax\u00e8s, Y.: Fast approximation and exact computation of negative curvature parameters of graphs. In: SoCG 2018, pp. 22:1\u201322:15 (2018)"},{"key":"22_CR13","unstructured":"Chalopin, J., Chepoi, V., Genevois, A., Hirai, H., Osajda, D.: Helly groups (2020)"},{"key":"22_CR14","unstructured":"Chalopin, J., Chepoi, V., Hirai, H., Osajda, D.: Weakly modular graphs and nonpositive curvature. Mem. Amer. Math. Soc. 159 (2020)"},{"key":"22_CR15","unstructured":"Chepoi, V., Dragan, F.F.: Disjoint sets problem (1992)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BFb0049406","volume-title":"Algorithms \u2014 ESA 1994","author":"V Chepoi","year":"1994","unstructured":"Chepoi, V., Dragan, F.: A linear-time algorithm for finding a central vertex of a chordal graph. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 159\u2013170. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0049406"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Chepoi, V., Dragan, F.F., Estellon, B., Habib, M., Vax\u00e8s, Y.: Diameters, centers, and approximating trees of $$\\delta $$-hyperbolic geodesic spaces and graphs. In: SoCG 2008, pp. 59\u201368. ACM (2008)","DOI":"10.1145\/1377676.1377687"},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.7155\/jgaa.00496","volume":"23","author":"V Chepoi","year":"2019","unstructured":"Chepoi, V., Dragan, F.F.F., Habib, M., Vax\u00e8s, Y., Alrasheed, H.: Fast approximation of eccentricities and distances in hyperbolic graphs. J. Graph Algorithms Appl. 23(2), 393\u2013433 (2019)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2\u20133","key":"22_CR19","first-page":"143","volume":"113","author":"D Corneil","year":"2001","unstructured":"Corneil, D., Dragan, F.F., Habib, M., Paul, C.: Diameter determination on restricted graph families. DAM 113(2\u20133), 143\u2013166 (2001)","journal-title":"DAM"},{"issue":"3","key":"22_CR20","doi-asserted-by":"publisher","first-page":"1601","DOI":"10.1137\/140954787","volume":"28","author":"D Coudert","year":"2014","unstructured":"Coudert, D., Ducoffe, G.: Recognition of c$${}_{\\text{4 }}$$-free and 1\/2-hyperbolic graphs. SIDMA 28(3), 1601\u20131617 (2014)","journal-title":"SIDMA"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Coudert, D., Ducoffe, G., Popa, A.: Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. ACM TALG 15(3) (2019)","DOI":"10.1145\/3310228"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Dourado, M., Protti, F., Szwarcfiter, J.: Complexity aspects of the Helly property: graphs and hypergraphs. EJC 1000, 17-12 (2009)","DOI":"10.37236\/38"},{"key":"22_CR23","unstructured":"Dragan, F.F.: Centers of Graphs and the Helly Property. Ph.D. thesis, Moldava State University, Chi\u015fin\u0103u (1989). (in Russian)"},{"key":"22_CR24","unstructured":"Dragan, F.F.: Conditions for coincidence of local and global minima for eccentricity function on graphs and the Helly property. Stud. Appl. Math. Inf. Sci. 49\u201356 (1990). (in Russian)"},{"issue":"2","key":"22_CR25","first-page":"64","volume":"1","author":"FF Dragan","year":"1993","unstructured":"Dragan, F.F.: HT-graphs: centers, connected r-domination and Steiner trees. Comput. Sci. J. Moldova (Kishinev) 1(2), 64\u201383 (1993)","journal-title":"Comput. Sci. J. Moldova (Kishinev)"},{"key":"22_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/3-540-58218-5_34","volume-title":"Algorithm Theory \u2014 SWAT 1994","author":"FF Dragan","year":"1994","unstructured":"Dragan, F.F.: Dominating cliques in distance-hereditary graphs. In: Schmidt, E.M., Skyum, S. (eds.) SWAT 1994. LNCS, vol. 824, pp. 370\u2013381. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58218-5_34"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Dragan, F.F., Ducoffe, G., Guarnera, H.M.: Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. CoRR, arXiv:2102.08349 (2021)","DOI":"10.1007\/978-3-030-83508-8_22"},{"issue":"2","key":"22_CR28","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.disc.2018.10.017","volume":"342","author":"FF Dragan","year":"2019","unstructured":"Dragan, F.F., Guarnera, H.M.: Obstructions to a small hyperbolicity in Helly graphs. Discret. Math. 342(2), 326\u2013338 (2019)","journal-title":"Discret. Math."},{"key":"22_CR29","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2020.05.004","volume":"833","author":"FF Dragan","year":"2020","unstructured":"Dragan, F.F., Guarnera, H.M.: Eccentricity function in distance-hereditary graphs. Theor. Comput. Sci. 833, 26\u201340 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR30","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jcss.2020.03.004","volume":"112","author":"FF Dragan","year":"2020","unstructured":"Dragan, F.F., Guarnera, H.M.: Eccentricity terrain of $$\\delta $$-hyperbolic graphs. J. Comput. Syst. Sci. 112, 50\u201365 (2020)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR31","unstructured":"Dragan, F.F., Habib, M., Viennot, L.: Revisiting radius, diameter, and all eccentricity computation in graphs through certificates. CoRR, arXiv:1803.04660 (2018)"},{"key":"22_CR32","unstructured":"Dragan, F.F., Mohammed, A.: Slimness of graphs. DMTCS 21(3) (2019)"},{"issue":"3","key":"22_CR33","first-page":"191","volume":"98","author":"FF Dragan","year":"2000","unstructured":"Dragan, F.F., Nicolai, F.: LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem. DAM 98(3), 191\u2013207 (2000)","journal-title":"DAM"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-62559-3_15","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"FF Dragan","year":"1997","unstructured":"Dragan, F.F., Nicolai, F., Brandst\u00e4dt, A.: LexBFS-orderings and powers of graphs. In: d\u2019Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds.) WG 1996. LNCS, vol. 1197, pp. 166\u2013180. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62559-3_15"},{"issue":"4","key":"22_CR35","first-page":"67","volume":"4","author":"FF Dragan","year":"1992","unstructured":"Dragan, F.F., Prisakaru, K., Chepoi, V.: The location problem on graphs and the Helly problem. Diskret. Mat. 4(4), 67\u201373 (1992)","journal-title":"Diskret. Mat."},{"issue":"3","key":"22_CR36","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0001-8708(84)90029-X","volume":"53","author":"A Dress","year":"1984","unstructured":"Dress, A.: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: a note on combinatorial properties of metric spaces. Adv. Math. 53(3), 321\u2013402 (1984)","journal-title":"Adv. Math."},{"key":"22_CR37","unstructured":"Ducoffe, G.: Around the diameter of AT-free graphs. CoRR, arXiv:2010.15814 (2020)"},{"key":"22_CR38","unstructured":"Ducoffe, G.: Distance problems within Helly graphs and k-Helly graphs. CoRR, arXiv:2011.00001 (2020)"},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"Ducoffe, G.: Optimal diameter computation within bounded clique-width graphs. CoRR, arXiv:2011.08448 (2020)","DOI":"10.46298\/dmtcs.6422"},{"key":"22_CR40","doi-asserted-by":"crossref","unstructured":"Ducoffe, G.: Beyond Helly graphs: the diameter problem on absolute retracts. CoRR, arXiv:2101.03574 (2021)","DOI":"10.1007\/978-3-030-86838-3_25"},{"key":"22_CR41","unstructured":"Ducoffe, G., Dragan, F.F.: A story of diameter, radius, and (almost) Helly property. Networks, to appear"},{"key":"22_CR42","doi-asserted-by":"crossref","unstructured":"Ducoffe, G., Habib, M., Viennot, L.: Diameter computation on $$H$$-minor free graphs and graphs of bounded (distance) VC-dimension. In: SODA, pp. 1905\u20131922. SIAM (2020)","DOI":"10.1137\/1.9781611975994.117"},{"issue":"3","key":"22_CR43","first-page":"185","volume":"2","author":"A Farley","year":"1980","unstructured":"Farley, A., Proskurowski, A.: Computation of the center and diameter of outerplanar graphs. DAM 2(3), 185\u2013191 (1980)","journal-title":"DAM"},{"issue":"6\u20138","key":"22_CR44","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/j.ipl.2015.02.002","volume":"115","author":"H Fournier","year":"2015","unstructured":"Fournier, H., Ismail, A., Vigneron, A.: Computing the Gromov hyperbolicity of a discrete metric space. IPL 115(6\u20138), 576\u2013579 (2015)","journal-title":"IPL"},{"key":"22_CR45","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P., Kaplan, H., Mozes, S., Sharir, M., Weimann, O.: Voronoi diagrams on planar graphs, and computing the diameter in deterministic $$\\tilde{O}(n^{5\/3})$$ time. In: SODA, pp. 495\u2013514. SIAM (2018)","DOI":"10.1137\/1.9781611975031.33"},{"key":"22_CR46","series-title":"Mathematical Sciences Research Institute Publications","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-1-4613-9586-7_3","volume-title":"Essays in Group Theory","author":"M Gromov","year":"1987","unstructured":"Gromov, M.: Hyperbolic groups. In: Gersten, S.M. (ed.) Essays in Group Theory. MSRI, vol. 8, pp. 75\u2013263. Springer, New York (1987). https:\/\/doi.org\/10.1007\/978-1-4613-9586-7_3"},{"issue":"1","key":"22_CR47","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF02566944","volume":"39","author":"J Isbell","year":"1964","unstructured":"Isbell, J.: Six theorems about injective metric spaces. Commentarii Mathematici Helvetici 39(1), 65\u201376 (1964)","journal-title":"Commentarii Mathematici Helvetici"},{"key":"22_CR48","doi-asserted-by":"crossref","unstructured":"Kennedy, W.S., Saniee, I., Narayan, O.: On the hyperbolicity of large-scale networks and its estimation. In: BigData 2016, pp. 3344\u20133351. IEEE (2016)","DOI":"10.1109\/BigData.2016.7840994"},{"issue":"6","key":"22_CR49","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1006\/eujc.2002.0591","volume":"23","author":"JH Koolen","year":"2002","unstructured":"Koolen, J.H., Moulton, V.: Hyperbolic bridged graphs. Eur. J. Comb. 23(6), 683\u2013699 (2002)","journal-title":"Eur. J. Comb."},{"key":"22_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-31955-9_3","volume-title":"Network Analysis","author":"D Kosch\u00fctzki","year":"2005","unstructured":"Kosch\u00fctzki, D., Lehmann, K.A., Peeters, L., Richter, S., Tenfelde-Podehl, D., Zlotowski, O.: Centrality indices. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol. 3418, pp. 16\u201361. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31955-9_3"},{"issue":"1","key":"22_CR51","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ipl.2007.02.017","volume":"103","author":"M Lin","year":"2007","unstructured":"Lin, M., Szwarcfiter, J.: Faster recognition of clique-Helly and hereditary clique-Helly graphs. Inf. Process. Lett. 103(1), 40\u201343 (2007)","journal-title":"Inf. Process. Lett."},{"key":"22_CR52","doi-asserted-by":"crossref","unstructured":"Narayan, O., Saniee, I.: Large-scale curvature of networks. Phys. Rev. E, 84(6), 066108 (2011)","DOI":"10.1103\/PhysRevE.84.066108"},{"issue":"3\u20134","key":"22_CR53","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1080\/00207169008803870","volume":"34","author":"S Olariu","year":"1990","unstructured":"Olariu, S.: A simple linear-time algorithm for computing the center of an interval graph. Int. J. Comput. Math. 34(3\u20134), 121\u2013128 (1990)","journal-title":"Int. J. Comput. Math."},{"key":"22_CR54","doi-asserted-by":"crossref","unstructured":"Roditty, L., Vassilevska Williams, V.: Fast approximation algorithms for the diameter and radius of sparse graphs. In: STOC, pp. 515\u2013524. ACM (2013)","DOI":"10.1145\/2488608.2488673"},{"key":"22_CR55","doi-asserted-by":"crossref","unstructured":"Wu, Y., Zhang, C.: Hyperbolicity and chordality of a graph. Electr. J. Comb. 18(1), Paper #P43 (2011)","DOI":"10.37236\/530"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:26:47Z","timestamp":1645183607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","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":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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":"38% - 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.1","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":"13","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)"}}]}}