{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T14:23:13Z","timestamp":1763389393655,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60440-0_11","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"134-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Edge Elimination and Weighted Graph\u00a0Classes"],"prefix":"10.1007","author":[{"given":"Jesse","family":"Beisegel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Chiarelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ekkehard","family":"K\u00f6hler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matja\u017e","family":"Krnc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nevena","family":"Piva\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Scheffler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Strehler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"issue":"5","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1016\/j.disc.2009.11.006","volume":"310","author":"DV Andrade","year":"2010","unstructured":"Andrade, D.V., Boros, E., Gurvich, V.: Not complementary connected and not CIS $$d$$-graphs form weakly monotone families. Discrete Math. 310(5), 1089\u20131096 (2010). https:\/\/doi.org\/10.1016\/j.disc.2009.11.006","journal-title":"Discrete Math."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0024-3795(91)90090-J","volume":"148","author":"M Bakonyi","year":"1991","unstructured":"Bakonyi, M., Constantinescu, T.: Inheritance principles for chordal graphs. Linear Algebra Appl. 148, 125\u2013143 (1991). https:\/\/doi.org\/10.1016\/0024-3795(91)90090-J","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1023\/A:1022806215452","volume":"47","author":"M Bakonyi","year":"1997","unstructured":"Bakonyi, M., Bono, A.: Several results on chordal bipartite graphs. Czechoslov. Math. J. 47(4), 577\u2013583 (1997). https:\/\/doi.org\/10.1023\/A:1022806215452","journal-title":"Czechoslov. Math. J."},{"issue":"5","key":"11_CR4","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00500-005-0507-7","volume":"10","author":"A Berry","year":"2006","unstructured":"Berry, A., Sigayret, A., Sinoquet, C.: Maximal sub-triangulation in pre-processing phylogenetic data. Soft Comput. 10(5), 461\u2013468 (2006). https:\/\/doi.org\/10.1007\/s00500-005-0507-7","journal-title":"Soft Comput."},{"issue":"12","key":"11_CR5","doi-asserted-by":"publisher","first-page":"3853","DOI":"10.1016\/j.disc.2008.10.020","volume":"309","author":"E Boros","year":"2009","unstructured":"Boros, E., Gurvich, V.: Vertex-and edge-minimal and locally minimal graphs. Discrete Math. 309(12), 3853\u20133865 (2009). https:\/\/doi.org\/10.1016\/j.disc.2008.10.020","journal-title":"Discrete Math."},{"key":"11_CR6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. In: Hammer, P.L., Johnson, E.L., Korte, B.H., Nemhauser, G.L. (eds.) Studies in Integer Programming, Annals of Discrete Mathematics, vol. 1, pp. 145\u2013162. Elsevier (1977). https:\/\/doi.org\/10.1016\/S0167-5060(08)70731-3","DOI":"10.1016\/S0167-5060(08)70731-3"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Programming 1, 127\u2013136 (1971). https:\/\/doi.org\/10.1007\/BF01584082","journal-title":"Math. Programming"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2019.03.031","volume":"806","author":"T Fluschnik","year":"2020","unstructured":"Fluschnik, T., Molter, H., Niedermeier, R., Renken, M., Zschoche, P.: Temporal graph classes: a view through temporal separators. Theor. Comput. Sci. 806, 197\u2013218 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.03.031","journal-title":"Theor. Comput. Sci."},{"key":"11_CR10","unstructured":"Foldes, S., Hammer, P.L.: Split graphs. In: Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing. Louisiana State University, Baton Rouge, La., 1977, pp. 311\u2013315. Congressus Numerantium, no. XIX (1977)"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"340","DOI":"10.2307\/2785498","volume":"9","author":"E Forsyth","year":"1946","unstructured":"Forsyth, E., Katz, L.: A matrix approach to the analysis of sociometric data: preliminary report. Sociometry 9(4), 340\u2013347 (1946). https:\/\/doi.org\/10.2307\/2785498","journal-title":"Sociometry"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00357-017-9230-1","volume":"34","author":"D Fortin","year":"2017","unstructured":"Fortin, D.: Robinsonian matrices: recognition challenges. J. Classif. 34(2), 191\u2013222 (2017). https:\/\/doi.org\/10.1007\/s00357-017-9230-1","journal-title":"J. Classif."},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.: Incidence matrices and interval graphs. Pac. J. Math. 15(3), 835\u2013855 (1965). https:\/\/doi.org\/10.2140\/pjm.1965.15.835","journal-title":"Pac. J. Math."},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579333","volume":"1","author":"PL Hammer","year":"1981","unstructured":"Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica 1(3), 275\u2013284 (1981). https:\/\/doi.org\/10.1007\/BF02579333","journal-title":"Combinatorica"},{"issue":"1\u20132","key":"11_CR15","first-page":"87","volume":"14","author":"P Heggernes","year":"2007","unstructured":"Heggernes, P., Kratsch, D.: Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord. J. Comput. 14(1\u20132), 87\u2013108 (2007)","journal-title":"Nord. J. Comput."},{"issue":"12","key":"11_CR16","doi-asserted-by":"publisher","first-page":"2659","DOI":"10.1016\/j.dam.2008.08.010","volume":"157","author":"P Heggernes","year":"2009","unstructured":"Heggernes, P., Mancini, F.: Minimal split completions. Discrete Appl. Math. 157(12), 2659\u20132669 (2009). https:\/\/doi.org\/10.1016\/j.dam.2008.08.010","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10878-010-9322-x","volume":"22","author":"P Heggernes","year":"2011","unstructured":"Heggernes, P., Mancini, F., Papadopoulos, C., Sritharan, R.: Strongly chordal and chordal bipartite graphs are sandwich monotone. J. Comb. Optim. 22(3), 438\u2013456 (2011). https:\/\/doi.org\/10.1007\/s10878-010-9322-x","journal-title":"J. Comb. Optim."},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-540-73545-8_40","volume-title":"Computing and Combinatorics","author":"P Heggernes","year":"2007","unstructured":"Heggernes, P., Papadopoulos, C.: Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 406\u2013416. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73545-8_40"},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2008.07.020","volume":"410","author":"P Heggernes","year":"2009","unstructured":"Heggernes, P., Papadopoulos, C.: Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. Theor. Comput. Sci. 410(1), 1\u201315 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2008.07.020","journal-title":"Theor. Comput. Sci."},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Huson, D.H., Nettles, S., Warnow, T.J.: Obtaining highly accurate topology estimates of evolutionary trees from very short sequences. In: Istrail, S., Pevzner, P.A., Waterman, M.S. (eds.) Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, RECOMB 1999, Lyon, France, April 11\u201314, 1999, pp. 198\u2013207. ACM (1999). https:\/\/doi.org\/10.1145\/299432.299484","DOI":"10.1145\/299432.299484"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Ibarra, L.: Fully dynamic algorithms for chordal graphs and split graphs. ACM Trans. Algorithms Art. 40 4(4), 20 (2008). https:\/\/doi.org\/10.1145\/1383369.1383371","DOI":"10.1145\/1383369.1383371"},{"key":"11_CR22","unstructured":"Kearney, P.E., Hayward, R.B., Meijer, H.: Inferring evolutionary trees from ordinal data. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 1997, pp. 418\u2013426. ACM, New York (1997)"},{"key":"11_CR23","unstructured":"Khodaverdian, A., Weitz, B., Wu, J., Yosef, N.: Steiner network problems on temporal graphs. arXiv preprint arXiv:1609.04918 (2016)"},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1006\/jagm.1995.1037","volume":"19","author":"T Kloks","year":"1995","unstructured":"Kloks, T., Kratsch, D.: Treewidth of chordal bipartite graphs. J. Algorithms 19(2), 266\u2013281 (1995). https:\/\/doi.org\/10.1006\/jagm.1995.1037","journal-title":"J. Algorithms"},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1137\/16M1056791","volume":"31","author":"M Laurent","year":"2017","unstructured":"Laurent, M., Seminaroti, M.: Similarity-first search: a new algorithm with application to Robinsonian matrix recognition. SIAM J. Discrete Math. 31(3), 1765\u20131800 (2017). https:\/\/doi.org\/10.1137\/16M1056791","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Laurent, M., Seminaroti, M., Tanigawa, S.i.: A structural characterization for certifying Robinsonian matrices. Electron. J. Combin. Paper 2.21 24(2), 22 (2017). https:\/\/doi.org\/10.37236\/6701","DOI":"10.37236\/6701"},{"issue":"2","key":"11_CR27","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s11590-017-1213-y","volume":"14","author":"M Laurent","year":"2017","unstructured":"Laurent, M., Tanigawa, S.: Perfect elimination orderings for symmetric matrices. Optimization Letters 14(2), 339\u2013353 (2017). https:\/\/doi.org\/10.1007\/s11590-017-1213-y","journal-title":"Optimization Letters"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Liiv, I.: Seriation and matrix reordering methods: an historical overview. Stat. Anal. Data Min. ASA Data Sci. J. 3(2), 70\u201391 (2010). https:\/\/doi.org\/10.1002\/sam.10071","DOI":"10.1002\/sam.10071"},{"issue":"7","key":"11_CR29","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0898-1221(93)90308-I","volume":"25","author":"PJ Looges","year":"1993","unstructured":"Looges, P.J., Olariu, S.: Optimal greedy algorithms for indifference graphs. Comput. Math. Appl. 25(7), 15\u201325 (1993). https:\/\/doi.org\/10.1016\/0898-1221(93)90308-I","journal-title":"Comput. Math. Appl."},{"key":"11_CR30","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics. Annals Discrete Mathematics, vol. 56. North-Holland Publishing Co., Amsterdam (1995)"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-642-39212-2_57","volume-title":"Automata, Languages, and Programming","author":"GB Mertzios","year":"2013","unstructured":"Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 657\u2013668. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_57"},{"issue":"3","key":"11_CR32","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00357-014-9150-2","volume":"31","author":"P Pr\u00e9a","year":"2014","unstructured":"Pr\u00e9a, P., Fortin, D.: An optimal algorithm to recognize robinsonian dissimilarities. J. Classif. 31(3), 351\u2013385 (2014). https:\/\/doi.org\/10.1007\/s00357-014-9150-2","journal-title":"J. Classif."},{"key":"11_CR33","unstructured":"Roberts, F.S.: Indifference graphs. In: Proof Techniques in Graph Theory: Proceedings of the Second Ann Arbor Graph Theory Conference, pp. 139\u2013146. Academic Press (1969)"},{"issue":"3","key":"11_CR34","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"DJ Rose","year":"1970","unstructured":"Rose, D.J.: Triangulated graphs and the elimination process. J. Math. Anal. Appl. 32(3), 597\u2013609 (1970). https:\/\/doi.org\/10.1016\/0022-247X(70)90282-9","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"11_CR35","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976). https:\/\/doi.org\/10.1137\/0205021","journal-title":"SIAM J. Comput."},{"issue":"2\u20133","key":"11_CR36","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0166-218X(03)00448-7","volume":"136","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R.: A fully dynamic algorithm for modular decomposition and recognition of cographs. Discrete Appl. Math. 136(2\u20133), 329\u2013340 (2004). https:\/\/doi.org\/10.1016\/S0166-218X(03)00448-7","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"11_CR37","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(93)E0161-Q","volume":"59","author":"J Spinrad","year":"1995","unstructured":"Spinrad, J., Sritharan, R.: Algorithms for weakly triangulated graphs. Discrete Appl. Math. 59(2), 181\u2013191 (1995). https:\/\/doi.org\/10.1016\/0166-218X(93)E0161-Q","journal-title":"Discrete Appl. Math."},{"issue":"41","key":"11_CR38","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.jda.2016.06.003","volume":"38","author":"R Sritharan","year":"2016","unstructured":"Sritharan, R.: Graph modification problem for some classes of graphs. J. Discrete Algorithms 38(41), 32\u201337 (2016). https:\/\/doi.org\/10.1016\/j.jda.2016.06.003","journal-title":"J. Discrete Algorithms"},{"key":"11_CR39","doi-asserted-by":"publisher","unstructured":"Tardos, G.: Extremal theory of vertex or edge ordered graphs. In: Surveys in Combinatorics 2019. London Mathematical Society Lecture Note Series, vol. 456, pp. 221\u2013236. Cambridge University Press, Cambridge (2019). https:\/\/doi.org\/10.1017\/9781108649094.008","DOI":"10.1017\/9781108649094.008"},{"key":"11_CR40","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)"},{"issue":"1","key":"11_CR41","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discrete Methods 2(1), 77\u201379 (1981). https:\/\/doi.org\/10.1137\/0602010","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60440-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:00:46Z","timestamp":1710266446000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_11","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":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","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":"94","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":"32","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":"34% - 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.7","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.1","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 was held virtually 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)"}}]}}