{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:32:53Z","timestamp":1767137573061,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030868376","type":"print"},{"value":"9783030868383","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]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    For a hereditary graph class\u00a0\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {H}$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    , the\u00a0\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {H}$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    -elimination distance of a graph\u00a0\n                    <jats:italic>G<\/jats:italic>\n                    is the minimum number of rounds needed to reduce\u00a0\n                    <jats:italic>G<\/jats:italic>\n                    to a member of\u00a0\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {H}$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    by removing one vertex from each connected component in each round. The\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {H}$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    -treewidth of a graph\u00a0\n                    <jats:italic>G<\/jats:italic>\n                    is the minimum, taken over all vertex sets\u00a0\n                    <jats:italic>X<\/jats:italic>\n                    for which each connected component of\u00a0\n                    <jats:inline-formula>\n                      <jats:tex-math>$$G - X$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    belongs to\u00a0\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {H}$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    , of the treewidth of the graph obtained from\u00a0\n                    <jats:italic>G<\/jats:italic>\n                    by replacing the neighborhood of each component of\u00a0\n                    <jats:inline-formula>\n                      <jats:tex-math>$$G-X$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    by a clique and then removing\u00a0\n                    <jats:inline-formula>\n                      <jats:tex-math>$$V(G) \\setminus X$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    . These parameterizations recently attracted interest because they are simultaneously smaller than the graph-complexity measures treedepth and treewidth, respectively, and the vertex-deletion distance to\u00a0\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {H}$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    . For the class\u00a0\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {H}$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    of bipartite graphs, we present non-uniform fixed-parameter tractable algorithms for testing whether the\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {H}$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    -elimination distance or\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {H}$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    -treewidth of a graph is at most\u00a0\n                    <jats:italic>k<\/jats:italic>\n                    . Along the way, we also provide such algorithms for all graph classes\u00a0\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {H}$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    defined by a finite set of forbidden induced subgraphs.\n                  <\/jats:p>","DOI":"10.1007\/978-3-030-86838-3_6","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T18:05:30Z","timestamp":1632074730000},"page":"80-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8204-1268","authenticated-orcid":false,"given":"Bart M. P.","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3328-9712","authenticated-orcid":false,"given":"Jari J. H.","family":"de Kroon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, A., Kanesh, L., Panolan, F., Ramanujan, M., Saurabh, S.: An FPT algorithm for elimination distance to bounded degree graphs. In: Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.50","DOI":"10.4230\/LIPIcs.STACS.2021.50"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Agrawal, A., Ramanujan, M.S.: On the parameterized complexity of clique elimination distance. In: Cao, Y., Pilipczuk, M. (eds.) 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, Hong Kong, China, 14\u201318 December 2020 (Virtual Conference). LIPIcs, vol. 180, pp. 1:1\u20131:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2020.1","DOI":"10.4230\/LIPIcs.IPEC.2020.1"},{"issue":"6","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996). https:\/\/doi.org\/10.1137\/S0097539793251219","journal-title":"SIAM J. Comput."},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"HL Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255\u2013269 (2008). https:\/\/doi.org\/10.1093\/comjnl\/bxm037","journal-title":"Comput. J."},{"key":"6_CR5","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. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00453-015-0045-3","volume":"75","author":"J Bulian","year":"2016","unstructured":"Bulian, J., Dawar, A.: Graph isomorphism parameterized by elimination distance to bounded degree. Algorithmica 75(2), 363\u2013382 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0045-3","journal-title":"Algorithmica"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00453-016-0235-7","volume":"79","author":"J Bulian","year":"2017","unstructured":"Bulian, J., Dawar, A.: Fixed-parameter tractable distances to sparse graph classes. Algorithmica 79(1), 139\u2013158 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0235-7","journal-title":"Algorithmica"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Encyclopedia of Mathematics and Its Applications, Cambridge University Press (2012). https:\/\/doi.org\/10.1017\/CBO9780511977619","DOI":"10.1017\/CBO9780511977619"},{"key":"6_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","journal-title":"Parameterized Algorithms"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Eiben, E., Ganian, R., Hamm, T., Kwon, O.: Measuring what matters: a hybrid approach to dynamic programming with treewidth. In: Rossmanith, P., Heggernes, P., Katoen, J. (eds.) 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, 26\u201330 August 2019. LIPIcs, vol. 138, pp. 42:1\u201342:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2019.42","DOI":"10.4230\/LIPIcs.MFCS.2019.42"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"MR Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 294\u2013305. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_28"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Fluschnik, T., Niedermeier, R., Schubert, C., Zschoche, P.: Multistage S-T path: confronting similarity with dissimilarity in temporal graphs. In: Cao, Y., Cheng, S., Li, M. (eds.) 31st International Symposium on Algorithms and Computation, ISAAC 2020, Hong Kong, China, 14\u201318 December 2020 (Virtual Conference). LIPIcs, vol. 181, pp. 43:1\u201343:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2020.43","DOI":"10.4230\/LIPIcs.ISAAC.2020.43"},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00493-012-2536-z","volume":"32","author":"FV Fomin","year":"2012","unstructured":"Fomin, F.V., Villanger, Y.: Treewidth computation and extremal combinatorics. Combinatorics 32(3), 289\u2013308 (2012). https:\/\/doi.org\/10.1007\/s00493-012-2536-z","journal-title":"Combinatorics"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-30048-7_12","volume-title":"Principles and Practice of Constraint Programming","author":"R Ganian","year":"2019","unstructured":"Ganian, R., Ordyniak, S., Szeider, S.: A join-based hybrid parameter for constraint satisfaction. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 195\u2013212. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_12"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Ganian, R., Ramanujan, M.S., Szeider, S.: Combining treewidth and backdoors for CSP. In: Vollmer, H., Vall\u00e9e, B. (eds.) 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, Hannover, Germany, 8\u201311 March 2017. LIPIcs, vol. 66, pp. 36:1\u201336:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2017.36","DOI":"10.4230\/LIPIcs.STACS.2017.36"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-28639-4_15","volume-title":"Parameterized and Exact Computation","author":"J Guo","year":"2004","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Downey, R., Fellows, M., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 162\u2013173. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28639-4_15"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Hols, E.C., Kratsch, S., Pieterse, A.: Elimination distances, blocking sets, and kernels for vertex cover. In: Paul, C., Bl\u00e4ser, M. (eds.) 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, Montpellier, France, 10\u201313 March 2020. LIPIcs, vol. 154, pp. 36:1\u201336:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2020.36","DOI":"10.4230\/LIPIcs.STACS.2020.36"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00224-012-9393-4","volume":"53","author":"BMP Jansen","year":"2013","unstructured":"Jansen, B.M.P., Bodlaender, H.L.: Vertex cover kernelization revisited - upper and lower bounds for a refined parameter. Theory Comput. Syst. 53(2), 263\u2013299 (2013). https:\/\/doi.org\/10.1007\/s00224-012-9393-4","journal-title":"Theory Comput. Syst."},{"key":"6_CR21","unstructured":"Jansen, B.M.P., de Kroon, J.J.H.: FPT algorithms to compute the elimination distance to bipartite graphs and more. CoRR abs\/2106.04191 (2021). http:\/\/www.arxiv.org\/abs\/2106.04191"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Jansen, B.M.P., de Kroon, J.J.H., Wlodarczyk, M.: Vertex deletion parameterized by elimination distance and even less. In: Khuller, S., Williams, V.V. (eds.) STOC 2021: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, 21\u201325 June 2021, pp. 1757\u20131769. ACM (2021). https:\/\/doi.org\/10.1145\/3406325.3451068","DOI":"10.1145\/3406325.3451068"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-13731-0_9","volume-title":"Algorithm Theory - SWAT 2010","author":"S Kratsch","year":"2010","unstructured":"Kratsch, S., Schweitzer, P.: Isomorphism for graphs of bounded feedback vertex set number. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 81\u201392. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13731-0_9"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Lindermayr, A., Siebertz, S., Vigny, A.: Elimination distance to bounded degree on planar graphs. In: Esparza, J., Kr\u00e1l\u2019, D. (eds.) 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, Prague, Czech Republic, 24\u201328 August 2020. LIPIcs, vol. 170, pp. 65:1\u201365:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2020.65","DOI":"10.4230\/LIPIcs.MFCS.2020.65"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Ramanujan, M.S., Saurabh, S., Zehavi, M.: Reducing CMSO model checking to highly connected graphs. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, 9\u201313 July 2018. LIPIcs, vol. 107, pp. 135:1\u2013135:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.135","DOI":"10.4230\/LIPIcs.ICALP.2018.135"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Nesetril, J., de Mendez, P.O.: Sparsity - Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4","DOI":"10.1007\/978-3-642-27875-4"},{"issue":"4","key":"6_CR27","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"BA Reed","year":"2004","unstructured":"Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299\u2013301 (2004). https:\/\/doi.org\/10.1016\/j.orl.2003.10.009","journal-title":"Oper. Res. Lett."},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1007\/978-3-662-43948-7_77","volume-title":"Automata, Languages, and Programming","author":"F Reidl","year":"2014","unstructured":"Reidl, F., Rossmanith, P., Villaamil, F.S., Sikdar, S.: A faster parameterized algorithm for treedepth. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 931\u2013942. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_77"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63(1), 65\u2013110 (1995). https:\/\/doi.org\/10.1006\/jctb.1995.1006","DOI":"10.1006\/jctb.1995.1006"}],"updated-by":[{"DOI":"10.1007\/978-3-030-86838-3_32","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T00:00:00Z","timestamp":1701993600000}}],"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-86838-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T15:04:36Z","timestamp":1702047876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_6","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":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"8 December 2023","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","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":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","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":"41% - 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":"11","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 online 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)"}}]}}