{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:17Z","timestamp":1759638077077,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030752415"},{"type":"electronic","value":"9783030752422"}],"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-75242-2_19","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:22:29Z","timestamp":1620141749000},"page":"271-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Exploring the Gap Between Treedepth and Vertex Cover Through Vertex\u00a0Integrity"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Gima","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6943-856X","authenticated-orcid":false,"given":"Tesshu","family":"Hanaka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1618-9373","authenticated-orcid":false,"given":"Masashi","family":"Kiyomi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3244-6915","authenticated-orcid":false,"given":"Yasuaki","family":"Kobayashi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0087-853X","authenticated-orcid":false,"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,4]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ipl.2013.11.007","volume":"114","author":"FN Abu-Khzam","year":"2014","unstructured":"Abu-Khzam, F.N.: Maximum common induced subgraph parameterized by vertex cover. Inf. Process. Lett. 114(3), 99\u2013103 (2014). https:\/\/doi.org\/10.1016\/j.ipl.2013.11.007","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308\u2013340 (1991). https:\/\/doi.org\/10.1016\/0196-6774(91)90006-K","journal-title":"J. Algorithms"},{"issue":"7","key":"19_CR3","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.dam.2010.11.003","volume":"159","author":"Y Asahiro","year":"2011","unstructured":"Asahiro, Y., Miyano, E., Ono, H.: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discret. Appl. Math. 159(7), 498\u2013508 (2011). https:\/\/doi.org\/10.1016\/j.dam.2010.11.003","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/0602041","volume":"2","author":"SF Assmann","year":"1981","unstructured":"Assmann, S.F., Peck, G.W., Sys\u0142o, M.M., Zak, J.: The bandwidth of caterpillars with hairs of length 1 and 2. SIAM J. Algebraic Discrete Methods 2(4), 387\u2013393 (1981). https:\/\/doi.org\/10.1137\/0602041","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"19_CR5","first-page":"13","volume":"1","author":"CA Barefoot","year":"1987","unstructured":"Barefoot, C.A., Entringer, R.C., Swart, H.C.: Vulnerability in graphs \u2013 a comparative survey. J. Combin. Math. Combin. Comput. 1, 13\u201322 (1987)","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1137\/16M1057383","volume":"31","author":"R Belmonte","year":"2017","unstructured":"Belmonte, R., Fomin, F.V., Golovach, P.A., Ramanujan, M.S.: Metric dimension of bounded tree-length graphs. SIAM J. Discret. Math. 31(2), 1217\u20131243 (2017). https:\/\/doi.org\/10.1137\/16M1057383","journal-title":"SIAM J. Discret. Math."},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"R\u00e9my, B., Hanaka, T., Katsikarelis, I., Kim, E.J., Lampis, M.: New results on directed edge dominating set. In: MFCS 2018, volume 117 of LIPIcs, pp. 67:1\u201367:16 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.67","DOI":"10.4230\/LIPIcs.MFCS.2018.67"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"R\u00e9my, B., Kim, E.J., Lampis, M., Mitsou, V., Otachi, Y.: Grundy distinguishes treewidth from pathwidth. In: ESA 2020, volume 173 of LIPIcs, pp. 14:1\u201314:19 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.14","DOI":"10.4230\/LIPIcs.ESA.2020.14"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.dam.2004.12.001","volume":"148","author":"TC Biedl","year":"2005","unstructured":"Biedl, T.C., Chan, T.M., Ganjali, Y., Hajiaghayi, M.T., Wood, D.R.: Balanced vertex-orderings of graphs. Discret. Appl. Math. 148(1), 27\u201348 (2005). https:\/\/doi.org\/10.1016\/j.dam.2004.12.001","journal-title":"Discret. Appl. Math."},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-19488-6_110","volume-title":"Automata, Languages and Programming","author":"HL Bodlaender","year":"1988","unstructured":"Bodlaender, H.L.: Dynamic programming on graphs with bounded treewidth. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol. 317, pp. 105\u2013118. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19488-6_110"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Hanaka, T., Jaffke, L., Ono, H., Otachi, Y., van der Zanden, T.C.: Hedonic seat arrangement problems (extended abstract). In: AAMAS 2020, pp. 1777\u20131779 (2020) https:\/\/doi.org\/10.5555\/3398761.3398979","DOI":"10.5555\/3398761.3398979"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-030-17402-6_8","volume-title":"Algorithms and Complexity","author":"HL Bodlaender","year":"2019","unstructured":"Bodlaender, H.L., Hanaka, T., Okamoto, Y., Otachi, Y., van der Zanden, T.C.: SubGraph isomorphism on graph classes that exclude a substructure. In: Heggernes, P. (ed.) CIAC 2019. LNCS, vol. 11485, pp. 87\u201398. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17402-6_8"},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Purohit, N.: Metric dimension parameterized by treewidth. In: IPEC 2019, volume 148 of LIPIcs, pp. 5:1\u20135:15 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2019.5","DOI":"10.4230\/LIPIcs.IPEC.2019.5"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.dam.2016.11.016","volume":"231","author":"\u00c9 Bonnet","year":"2017","unstructured":"Bonnet, \u00c9., Sikora, F.: The graph motif problem parameterized by the structure of the input graph. Discret. Appl. Math. 231, 78\u201394 (2017). https:\/\/doi.org\/10.1016\/j.dam.2016.11.016","journal-title":"Discret. Appl. Math."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. RAIRO Theor. Inform. Appl. 26, 257\u2013286 (1992). https:\/\/doi.org\/10.1051\/ita\/1992260302571","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"19_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-79723-4_9","volume-title":"Parameterized and Exact Computation","author":"M Dom","year":"2008","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S., Villanger, Y.: Capacitated domination and covering: a parameterized perspective. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 78\u201390. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79723-4_9"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Cham (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Drange, P.G., Dregi, M.S., van \u2019t Hof, P.: On the computational complexity of vertex integrity and component order connectivity. Algorithmica, 76(4), 1181\u20131202 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0127-x","DOI":"10.1007\/s00453-016-0127-x"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Dvo\u0159\u00e1k, P., Eiben, E., Ganian, R., Knop, D., Ordyniak, S.: Solving integer linear programs with a small number of global variables and constraints. In: IJCAI 2017, pp. 607\u2013613 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/85","DOI":"10.24963\/ijcai.2017\/85"},{"issue":"12","key":"19_CR21","doi-asserted-by":"publisher","first-page":"3597","DOI":"10.1007\/s00453-018-0408-7","volume":"80","author":"P Dvo\u0159\u00e1k","year":"2018","unstructured":"Dvo\u0159\u00e1k, P., Knop, D.: Parameterized complexity of length-bounded cuts and multicuts. Algorithmica 80(12), 3597\u20133617 (2018). https:\/\/doi.org\/10.1007\/s00453-018-0408-7","journal-title":"Algorithmica"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-11269-0_10","volume-title":"Parameterized and Exact Computation","author":"R Enciso","year":"2009","unstructured":"Enciso, R., Fellows, M.R., Guo, J., Kanj, I., Rosamond, F., Such\u00fd, O.: What makes equitable connected partition easy. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 122\u2013133. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11269-0_10"},{"issue":"2","key":"19_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ic.2010.11.026","volume":"209","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., et al.: On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209(2), 143\u2013153 (2011). https:\/\/doi.org\/10.1016\/j.ic.2010.11.026","journal-title":"Inf. Comput."},{"key":"19_CR24","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"},{"issue":"23","key":"19_CR25","doi-asserted-by":"publisher","first-page":"2513","DOI":"10.1016\/j.tcs.2010.10.043","volume":"412","author":"J Fiala","year":"2011","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Parameterized complexity of coloring problems: treewidth versus vertex cover. Theor. Comput. Sci. 412(23), 2513\u20132523 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.10.043","journal-title":"Theor. Comput. Sci."},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Ganian, R., Klute, F., Ordyniak, S.: On structural parameterizations of the bounded-degree vertex deletion problem. Algorithmica (2020). https:\/\/doi.org\/10.1007\/s00453-020-00758-8","DOI":"10.1007\/s00453-020-00758-8"},{"key":"19_CR27","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, W. H (1979)"},{"issue":"2","key":"19_CR28","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.jda.2009.05.002","volume":"8","author":"E Gassner","year":"2010","unstructured":"Gassner, E.: The steiner forest problem revisited. J. Discrete Algorithms 8(2), 154\u2013163 (2010). https:\/\/doi.org\/10.1016\/j.jda.2009.05.002","journal-title":"J. Discrete Algorithms"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Gima, T., Hanaka, T., Kiyomi, M., Kobayashi, Y., Otachi, Y.: Exploring the gap between treedepth and vertex cover through vertex integrity. CoRR, abs\/2101.09414, arXiv preprint arXiv:2101.09414 (2021)","DOI":"10.1007\/978-3-030-75242-2_19"},{"issue":"1","key":"19_CR30","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jcss.2012.04.004","volume":"79","author":"K Jansen","year":"2013","unstructured":"Jansen, K., Kratsch, S., Marx, D., Schlotter, I.: Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. 79(1), 39\u201349 (2013). https:\/\/doi.org\/10.1016\/j.jcss.2012.04.004","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Kellerhals, L., Koana, T.: Parameterized complexity of geodetic set. In: IPEC 2020, volume 180 of LIPIcs, pp. 20:1\u201320:14 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2020.20","DOI":"10.4230\/LIPIcs.IPEC.2020.20"},{"key":"19_CR32","doi-asserted-by":"publisher","unstructured":"Lenstra Jr, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983). https:\/\/doi.org\/10.1287\/moor.8.4.538","DOI":"10.1287\/moor.8.4.538"},{"key":"19_CR33","unstructured":"Lokshtanov, D.: Parameterized integer quadratic programming: variables and coefficients. CoRR, abs\/1511.00310 (2015). arXiv preprint arXiv:1511.00310"},{"issue":"19\u201321","key":"19_CR34","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1016\/j.ipl.2013.06.010","volume":"113","author":"D Lokshtanov","year":"2013","unstructured":"Lokshtanov, D., Misra, N., Saurabh, S.: Imbalance is fixed parameter tractable. Inf. Process. Lett. 113(19\u201321), 714\u2013718 (2013). https:\/\/doi.org\/10.1016\/j.ipl.2013.06.010","journal-title":"Inf. Process. Lett."},{"key":"19_CR35","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ic.2016.08.001","volume":"251","author":"K Meeks","year":"2016","unstructured":"Meeks, K., Alexander, S.: The parameterised complexity of list problems on graphs of bounded treewidth. Inf. Comput. 251, 91\u2013103 (2016). https:\/\/doi.org\/10.1016\/j.ic.2016.08.001","journal-title":"Inf. Comput."},{"key":"19_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-030-58150-3_13","volume-title":"Computing and Combinatorics","author":"N Misra","year":"2020","unstructured":"Misra, N., Mittal, H.: Imbalance parameterized by twin cover revisited. In: Kim, D., Uma, R.N., Cai, Z., Lee, D.H. (eds.) COCOON 2020. LNCS, vol. 12273, pp. 162\u2013173. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58150-3_13"},{"issue":"4","key":"19_CR37","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0607057","volume":"7","author":"B Monien","year":"1986","unstructured":"Monien, B.: The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete. SIAM J. Algebraic Discrete Methods 7(4), 505\u2013512 (1986). https:\/\/doi.org\/10.1137\/0607057","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"3","key":"19_CR38","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/S0304-3975(03)00238-X","volume":"307","author":"D Muradian","year":"2003","unstructured":"Muradian, D.: The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete. Theor. Comput. Sci. 307(3), 567\u2013572 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(03)00238-X","journal-title":"Theor. Comput. Sci."},{"key":"19_CR39","doi-asserted-by":"publisher","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Sparsity: Graphs, Structures, and Algorithms. Algorithms and Combinatorics. Springer, Cham (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4","DOI":"10.1007\/978-3-642-27875-4"},{"key":"19_CR40","unstructured":"Szeider, S.: Not so easy problems for tree decomposable graphs. Ramanujan Mathematical Society, Lecture Notes Series, No. 13, pp. 179\u2013190 (2010) arXiv preprint arXiv:1107.1177"},{"key":"19_CR41","doi-asserted-by":"publisher","unstructured":"Szeider, S.: Monadic second order logic on graphs with local cardinality constraints. ACM Trans. Comput. Log. 12(2), 12:1\u201312:21 (2011). https:\/\/doi.org\/10.1145\/1877714.1877718","DOI":"10.1145\/1877714.1877718"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75242-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T09:47:19Z","timestamp":1672048039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75242-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752415","9783030752422"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75242-2_19","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":"4 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","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":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2021\/","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":"78","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":"27","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":"35% - 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":"10","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":"Due to the Corona pandemic the conference was held virtually.","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)"}}]}}