{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T05:09:52Z","timestamp":1778994592388,"version":"3.51.4"},"publisher-location":"Cham","reference-count":44,"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_15","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"200-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Solving Problems on Generalized Convex Graphs via Mim-Width"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9872-7528","authenticated-orcid":false,"given":"Flavia","family":"Bonomo-Braberman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1136-418X","authenticated-orcid":false,"given":"Nick","family":"Brettell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1509-8832","authenticated-orcid":false,"given":"Andrea","family":"Munaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.tcs.2013.01.011","volume":"511","author":"R Belmonte","year":"2013","unstructured":"Belmonte, R., Vatshelle, M.: Graph classes with structured neighborhoods and algorithmic applications. Theoret. Comput. Sci. 511, 54\u201365 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR2","first-page":"17:1","volume":"144","author":"B Bergougnoux","year":"2019","unstructured":"Bergougnoux, B., Kant\u00e9, M.M.: More applications of the d-neighbor equivalence connectivity and acyclicity constraints. Proc ESA 2009. LIPIcs 144, 17:1-17:14 (2019)","journal-title":"Proc ESA 2009. LIPIcs"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-030-60440-0_31","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B Bergougnoux","year":"2020","unstructured":"Bergougnoux, B., Papadopoulos, C., Telle, J.A.: Node multiway cut and subset feedback vertex set on graphs of bounded MIM-width. In: Adler, I., M\u00fcller, H. (eds.) WG 2020. LNCS, vol. 12301, pp. 388\u2013400. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60440-0_31"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.dam.2018.03.072","volume":"261","author":"F Bonomo","year":"2019","unstructured":"Bonomo, F., de Estrada, D.: On the thinness and proper thinness of a graph. Discrete Appl. Math. 261, 78\u201392 (2019)","journal-title":"Discrete Appl. Math."},{"key":"15_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. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA (1999)"},{"key":"15_CR6","first-page":"143","volume":"30","author":"J Brault-Baron","year":"2015","unstructured":"Brault-Baron, J., Capelli, F., Mengel, S.: Understanding model counting for beta-acyclic CNF-formulas. Proc. STACS 2015. LIPIcs 30, 143\u2013156 (2015)","journal-title":"Proc. STACS 2015. LIPIcs"},{"key":"15_CR7","first-page":"6:1","volume":"180","author":"N Brettell","year":"2020","unstructured":"Brettell, N., Horsfield, J., Munaro, A., Paesani, G., Paulusma, D.: Bounding the MIM-width of hereditary graph classes. Proc. IPEC 2020, LIPIcs 180, 6:1-6:18 (2020)","journal-title":"Proc. IPEC 2020, LIPIcs"},{"key":"15_CR8","unstructured":"Brettell, N., Horsfield, J., Munaro, A., Paulusma, D.: List $$k$$-colouring $${P}_t$$-free graphs: a mim-width perspective. CoRR, abs\/2008.01590 (2020)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.7155\/jgaa.00237","volume":"15","author":"K Buchin","year":"2011","unstructured":"Buchin, K., van Kreveld, M., Meijer, H., Speckmann, B., Verbeek, K.: On planar supports for hypergraphs. J. Graph Algorithms Appl. 15, 533\u2013549 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"5187","DOI":"10.1016\/j.tcs.2011.05.022","volume":"412","author":"BM Bui-Xuan","year":"2011","unstructured":"Bui-Xuan, B.M., Telle, J.A., Vatshelle, M.: Boolean-width of graphs. Theoret. Comput. Sci. 412, 5187\u20135204 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2013.01.009","volume":"511","author":"BM Bui-Xuan","year":"2013","unstructured":"Bui-Xuan, B.M., Telle, J.A., Vatshelle, M.: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theoret. Comput. Sci. 511, 66\u201376 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-015-9917-3","volume":"32","author":"H Chen","year":"2015","unstructured":"Chen, H., Lei, Z., Liu, T., Tang, Z., Wang, C., Xu, K.: Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs. J. Comb. Optim. 32, 1\u201316 (2015). https:\/\/doi.org\/10.1007\/s10878-015-9917-3","journal-title":"J. Comb. Optim."},{"key":"15_CR13","first-page":"1","volume":"343","author":"M Chudnovsky","year":"2020","unstructured":"Chudnovsky, M., Spirkl, S., Zhong, M.: List $$3$$-coloring $${P}_t$$-free graphs with no induced $$1$$-subdivision of $${K}_{1, s}$$. Discrete Math. 343, 1\u20135 (2020)","journal-title":"Discrete Math."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101, 77\u2013114 (2000)","journal-title":"Discrete Appl. Math."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00453-013-9777-0","volume":"71","author":"JF Couturier","year":"2015","unstructured":"Couturier, J.F., Golovach, P.A., Kratsch, D., Paulusma, D.: List coloring in the absence of a linear forest. Algorithmica 71, 21\u201335 (2015)","journal-title":"Algorithmica"},{"key":"15_CR16","first-page":"1","volume":"456","author":"KK Dabrowski","year":"2019","unstructured":"Dabrowski, K.K., Johnson, M., Paulusma, D.: Clique-width for hereditary graph classes. Lond. Math. Soc. Lect. Note Ser. 456, 1\u201356 (2019)","journal-title":"Lond. Math. Soc. Lect. Note Ser."},{"key":"15_CR17","series-title":"AIRO Springer Series","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-030-63072-0_2","volume-title":"Graphs and Combinatorial Optimization: From Theory to Applications","author":"J D\u00edaz","year":"2020","unstructured":"D\u00edaz, J., Diner, \u00d6.Y., Serna, M.J., Serra, O.: On list $$k$$-coloring convex bipartite graphs. In: Gentile, C., Stecca, G., Ventura, P. (eds.) Graphs and Combinatorial Optimization: From Theory to Applications. AIRO Springer Series, vol. 5, pp. 15\u201326. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63072-0_2"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"MC Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. Int. J. Found. Comput. Sci. 11, 423\u2013443 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Comput. J. 51, 326\u2013362 (2008)","journal-title":"Comput. J."},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s00453-008-9197-8","volume":"57","author":"CT Ho\u00e0ng","year":"2010","unstructured":"Ho\u00e0ng, C.T., Kami\u0144ski, M., Lozin, V.V., Sawada, J., Shu, X.: Deciding $$k$$-colorability of $${P}_5$$-free graphs in polynomial time. Algorithmica 57, 74\u201381 (2010)","journal-title":"Algorithmica"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-030-30786-8_17","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S H\u00f8gemo","year":"2019","unstructured":"H\u00f8gemo, S., Telle, J.A., V\u00e5gset, E.R.: Linear MIM-width of trees. In: Sau, I., Thilikos, D.M. (eds.) WG 2019. LNCS, vol. 11789, pp. 218\u2013231. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30786-8_17"},{"key":"15_CR22","unstructured":"Jaffke, L.: Bounded Width Graph Classes in Parameterized Algorithms. Ph.D. thesis, University of Bergen (2020)"},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/s00453-019-00607-3","volume":"82","author":"L Jaffke","year":"2020","unstructured":"Jaffke, L., Kwon, O., Telle, J.A.: Mim-width II the feedback vertex set problem. Algorithmica 82, 118\u2013145 (2020)","journal-title":"Algorithmica"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2012.12.021","volume":"507","author":"W Jiang","year":"2013","unstructured":"Jiang, W., Liu, T., Wang, C., Xu, K.: Feedback vertex sets on restricted bipartite graphs. Theoret. Comput. Sci. 507, 41\u201351 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-22616-8_33","volume-title":"Combinatorial Optimization and Applications","author":"W Jiang","year":"2011","unstructured":"Jiang, W., Liu, T., Xu, K.: Tractable feedback vertex sets in restricted bipartite graphs. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 424\u2013434. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22616-8_33"},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"2747","DOI":"10.1016\/j.dam.2008.08.022","volume":"157","author":"M Kami\u0144ski","year":"2009","unstructured":"Kami\u0144ski, M., Lozin, V.V., Milani\u010d, M.: Recent developments on graphs of bounded clique-width. Discrete Appl. Math. 157, 2747\u20132761 (2009)","journal-title":"Discrete Appl. Math."},{"key":"15_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.09.006","volume":"704","author":"DY Kang","year":"2017","unstructured":"Kang, D.Y., Kwon, O., Str\u00f8mme, T.J.F., Telle, J.A.: A width parameter useful for chordal and co-comparability graphs. Theoret. Comput. Sci. 704, 1\u201317 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR28","unstructured":"Kwon, O.: Personal communication (2020)"},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-07956-1_22","volume-title":"Algorithmic Aspects in Information and Management","author":"T Liu","year":"2014","unstructured":"Liu, T.: Restricted bipartite graphs: comparison and hardness results. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 241\u2013252. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07956-1_22"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2014.05.001","volume":"556","author":"T Liu","year":"2014","unstructured":"Liu, T., Lu, M., Lu, Z., Xu, K.: Circular convex bipartite graphs: feedback vertex sets. Theoret. Comput. Sci. 556, 55\u201362 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"15_CR31","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10878-014-9729-x","volume":"29","author":"T Liu","year":"2014","unstructured":"Liu, T., Lu, Z., Xu, K.: Tractable connected domination for restricted bipartite graphs. J. Comb. Optim. 29(1), 247\u2013256 (2014). https:\/\/doi.org\/10.1007\/s10878-014-9729-x","journal-title":"J. Comb. Optim."},{"key":"15_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-38756-2_16","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"M Lu","year":"2013","unstructured":"Lu, M., Liu, T., Xu, K.: Independent domination: reductions from circular- and triad-convex bipartite graphs to convex bipartite graphs. In: Fellows, M., Tan, X., Zhu, B. (eds.) AAIM\/FAW -2013. LNCS, vol. 7924, pp. 142\u2013152. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38756-2_16"},{"key":"15_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2006.01.009","volume":"35","author":"C Mannino","year":"2007","unstructured":"Mannino, C., Oriolo, G., Ricci, F., Chandran, S.: The stable set problem and the thinness of a graph. Oper. Res. Lett. 35, 1\u20139 (2007)","journal-title":"Oper. Res. Lett."},{"key":"15_CR34","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S Oum","year":"2006","unstructured":"Oum, S., Seymour, P.D.: Approximating clique-width and branch-width. J. Comb. Theory Ser. B 96, 514\u2013528 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"key":"15_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-030-11509-8_12","volume-title":"Proceedings of Algorithms and Discrete Applied Mathematics","author":"BS Panda","year":"2019","unstructured":"Panda, B.S., Chaudhary, J.: Dominating induced matching in some subclasses of bipartite graphs. In: Pal, S., Vijayakumar, A. (eds.) CALDAM 2019. LNCS, vol. 11394, pp. 138\u2013149. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11509-8_12"},{"issue":"3","key":"15_CR36","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s10878-020-00611-2","volume":"40","author":"BS Panda","year":"2020","unstructured":"Panda, B.S., Pandey, A., Chaudhary, J., Dane, P., Kashyap, M.: Maximum weight induced matching in some subclasses of bipartite graphs. J. Comb. Optim. 40(3), 713\u2013732 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00611-2","journal-title":"J. Comb. Optim."},{"key":"15_CR37","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.dam.2018.03.029","volume":"252","author":"A Pandey","year":"2019","unstructured":"Pandey, A., Panda, B.: Domination in some subclasses of bipartite graphs. Discrete Appl. Math. 252, 51\u201366 (2019)","journal-title":"Discrete Appl. Math."},{"key":"15_CR38","doi-asserted-by":"publisher","first-page":"6157","DOI":"10.1016\/j.disc.2007.11.039","volume":"308","author":"M Rao","year":"2008","unstructured":"Rao, M.: Clique-width of graphs defined by one-vertex extensions. Discrete Math. 308, 6157\u20136165 (2008)","journal-title":"Discrete Math."},{"key":"15_CR39","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors X. Obstructions to tree-decomposition. J. Comb. Theory Ser. B 52, 153\u2013190 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"key":"15_CR40","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.tcs.2015.11.039","volume":"615","author":"SH S\u00e6ther","year":"2016","unstructured":"S\u00e6ther, S.H., Vatshelle, M.: Hardness of computing width parameters based on branch decompositions over the vertex set. Theoret. Comput. Sci. 615, 120\u2013125 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-29700-7_12","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"Yu Song","year":"2012","unstructured":"Song, Yu., Liu, T., Xu, K.: Independent domination on tree convex bipartite graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM\/FAW -2012. LNCS, vol. 7285, pp. 129\u2013138. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29700-7_12"},{"key":"15_CR42","unstructured":"Vatshelle, M.: New Width Parameters of Graphs. Ph.D. thesis, University of Bergen (2012)"},{"key":"15_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-319-08016-1_23","volume-title":"Proceedings of Frontiers in Algorithmics","author":"C Wang","year":"2014","unstructured":"Wang, C., Chen, H., Lei, Z., Tang, Z., Liu, T., Xu, K.: Tree convex bipartite graphs: NP-complete domination, hamiltonicity and treewidth. In: Chen, J., Hopcroft, J.E., Wang, J. (eds.) FAW 2014. LNCS, vol. 8497, pp. 252\u2013263. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08016-1_23"},{"key":"15_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-31770-5_9","volume-title":"Combinatorial Optimization and Applications","author":"C Wang","year":"2012","unstructured":"Wang, C., Liu, T., Jiang, W., Xu, K.: Feedback vertex sets on tree convex bipartite graphs. In: Lin, G. (ed.) COCOA 2012. LNCS, vol. 7402, pp. 95\u2013102. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31770-5_9"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:26:17Z","timestamp":1645183577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_15","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)"}}]}}