{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:17:53Z","timestamp":1742912273205,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031270505"},{"type":"electronic","value":"9783031270512"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-27051-2_19","type":"book-chapter","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:03:35Z","timestamp":1678665815000},"page":"217-228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Splitting Plane Graphs to\u00a0Outerplanarity"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gronemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana\u00efs","family":"Villedieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,13]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Abu-Khzam, F.N., Barr, J.R., Fakhereldine, A., Shaw, P.: A greedy heuristic for cluster editing with vertex splitting. In: Proceedings of the 4th International Conference on Artificial Intelligence for Industries (AI4I), pp. 38\u201341. IEEE (2021). https:\/\/doi.org\/10.1109\/AI4I51902.2021.00017","DOI":"10.1109\/AI4I51902.2021.00017"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Ahmed, R., Kobourov, S., Kryven, M.: An FPT algorithm for bipartite vertex splitting. In: Angelini, P., von Hanxleden, R. (eds.) GD 2022. LNCS, vol. 13764, pp. 261\u2013268. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-22203-0_19","DOI":"10.1007\/978-3-031-22203-0_19"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/TVCG.2020.3016055","volume":"28","author":"L Angori","year":"2022","unstructured":"Angori, L., Didimo, W., Montecchiani, F., Pagliuca, D., Tappini, A.: Hybrid graph visualizations with ChordLink: algorithms, experiments, and applications. IEEE Trans. Vis. Comput. Graph. 28(2), 1288\u20131300 (2022). https:\/\/doi.org\/10.1109\/TVCG.2020.3016055","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994). https:\/\/doi.org\/10.1145\/174644.174650","journal-title":"J. ACM"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theor. Ser. B 27(3), 320\u2013331 (1979). https:\/\/doi.org\/10.1016\/0095-8956(79)90021-2","journal-title":"J. Comb. Theor. Ser. B"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.dam.2014.10.017","volume":"181","author":"T Biedl","year":"2015","unstructured":"Biedl, T.: On triangulating k-outerplanar graphs. Discrete Appl. Math. 181, 275\u2013279 (2015). https:\/\/doi.org\/10.1016\/j.dam.2014.10.017","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00454-010-9310-z","volume":"45","author":"T Biedl","year":"2010","unstructured":"Biedl, T.: Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs. Discrete Comput. Geom. 45(1), 141\u2013160 (2010). https:\/\/doi.org\/10.1007\/s00454-010-9310-z","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1137\/0217004","volume":"17","author":"D Bienstock","year":"1988","unstructured":"Bienstock, D., Monma, C.L.: On the complexity of covering vertices by faces in a planar graph. SIAM J. Comput. 17(1), 53\u201376 (1988). https:\/\/doi.org\/10.1137\/0217004","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial $$k$$-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1\u20132), 1\u201345 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(97)00228-4","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0196-6774(02)00001-9","volume":"43","author":"HL Bodlaender","year":"2002","unstructured":"Bodlaender, H.L., Fomin, F.V.: Approximation of pathwidth of outerplanar graphs. J. Algorithms 43(2), 190\u2013200 (2002). https:\/\/doi.org\/10.1016\/S0196-6774(02)00001-9","journal-title":"J. Algorithms"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2016.05.031","volume":"645","author":"M Bonamy","year":"2016","unstructured":"Bonamy, M., Kowalik, L.: A 13k-kernel for planar feedback vertex set via region decomposition. Theor. Comput. Sci. 645, 25\u201340 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.05.031","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.4153\/CMB-1987-028-5","volume":"30","author":"JA Bondy","year":"1987","unstructured":"Bondy, J.A., Hopkins, G., Staton, W.: Lower bounds for induced forests in cubic graphs. Can. Math. Bull. 30(2), 193\u2013199 (1987). https:\/\/doi.org\/10.4153\/CMB-1987-028-5","journal-title":"Can. Math. Bull."},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Demaine, E., Hajiaghayi, M.: Bidimensionality: new connections between FPT algorithms and PTASs. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 590\u2013601 (2005). https:\/\/doi.org\/10.1145\/1070432.1070514","DOI":"10.1145\/1070432.1070514"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1007\/s00453-017-0328-y","volume":"80","author":"D Eppstein","year":"2017","unstructured":"Eppstein, D.: On the planar split thickness of graphs. Algorithmica 80(3), 977\u2013994 (2017). https:\/\/doi.org\/10.1007\/s00453-017-0328-y","journal-title":"Algorithmica"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BFb0054317","volume-title":"LATIN\u201998: Theoretical Informatics","author":"L Faria","year":"1998","unstructured":"Faria, L., de Figueiredo, C.M.H., de Mendon\u00e7a Neto, C.F.X.: The splitting number of the 4-cube. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 141\u2013150. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054317"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0166-218X(00)00220-1","volume":"108","author":"L Faria","year":"2001","unstructured":"Faria, L., de Figueiredo, C.M., de Mendon\u00e7a, C.F.X.: Splitting number is NP-complete. Discrete Appl. Math. 108(1), 65\u201383 (2001). https:\/\/doi.org\/10.1016\/S0166-218X(00)00220-1","journal-title":"Discrete Appl. Math."},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"101854","DOI":"10.1016\/j.comgeo.2021.101854","volume":"103","author":"F Frati","year":"2022","unstructured":"Frati, F.: Planar rectilinear drawings of outerplanar graphs in linear time. Comput. Geom. 103, 101854 (2022). https:\/\/doi.org\/10.1016\/j.comgeo.2021.101854","journal-title":"Comput. Geom."},{"issue":"5","key":"19_CR18","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BF01955044","volume":"15","author":"GN Frederickson","year":"1996","unstructured":"Frederickson, G.N.: Searching among intervals and compact routing tables. Algorithmica 15(5), 448\u2013466 (1996). https:\/\/doi.org\/10.1007\/BF01955044","journal-title":"Algorithmica"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(86)90039-7","volume":"62","author":"N Hartsfield","year":"1986","unstructured":"Hartsfield, N.: The toroidal splitting number of the complete graph k$${}_{\\text{ n }}$$. Discrete Math. 62(1), 35\u201347 (1986). https:\/\/doi.org\/10.1016\/0012-365X(86)90039-7","journal-title":"Discrete Math."},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF01788557","volume":"3","author":"N Hartsfield","year":"1987","unstructured":"Hartsfield, N.: The splitting number of the complete graph in the projective plane. Graphs Comb. 3(1), 349\u2013356 (1987). https:\/\/doi.org\/10.1007\/BF01788557","journal-title":"Graphs Comb."},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02582960","volume":"1","author":"N Hartsfield","year":"1985","unstructured":"Hartsfield, N., Jackson, B., Ringel, G.: The splitting number of the complete graph. Graphs Comb. 1(1), 311\u2013329 (1985). https:\/\/doi.org\/10.1007\/BF02582960","journal-title":"Graphs Comb."},{"issue":"6","key":"19_CR22","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1109\/TVCG.2008.141","volume":"14","author":"N Henry","year":"2008","unstructured":"Henry, N., Bezerianos, A., Fekete, J.: Improving the readability of clustered social networks using node duplication. IEEE Trans. Vis. Comput. Graph. 14(6), 1317\u20131324 (2008). https:\/\/doi.org\/10.1109\/TVCG.2008.141","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"2","key":"19_CR23","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/BF01772941","volume":"42","author":"B Jackson","year":"1984","unstructured":"Jackson, B., Ringel, G.: The splitting number of complete bipartite graphs. Arch. Math. 42(2), 178\u2013184 (1984). https:\/\/doi.org\/10.1007\/BF01772941","journal-title":"Arch. Math."},{"issue":"1","key":"19_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1996.0034","volume":"21","author":"G Kant","year":"1996","unstructured":"Kant, G.: Augmenting outerplanar graphs. J. Algorithms 21(1), 1\u201325 (1996). https:\/\/doi.org\/10.1006\/jagm.1996.0034","journal-title":"J. Algorithms"},{"key":"19_CR25","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ejc.2016.10.009","volume":"61","author":"T Kelly","year":"2017","unstructured":"Kelly, T., Liu, C.: Minimum size of feedback vertex sets of planar graphs of girth at least five. Eur. J. Comb. 61, 138\u2013150 (2017). https:\/\/doi.org\/10.1016\/j.ejc.2016.10.009","journal-title":"Eur. J. Comb."},{"issue":"2","key":"19_CR26","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/j.disc.2015.10.023","volume":"339","author":"KB Knauer","year":"2016","unstructured":"Knauer, K.B., Ueckerdt, T.: Three ways to cover a graph. Discrete Math. 339(2), 745\u2013758 (2016). https:\/\/doi.org\/10.1016\/j.disc.2015.10.023","journal-title":"Discrete Math."},{"key":"19_CR27","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.tcs.2018.10.002","volume":"770","author":"S Lazard","year":"2019","unstructured":"Lazard, S., Lenhart, W.J., Liotta, G.: On the edge-length ratio of outerplanar graphs. Theor. Comput. Sci. 770, 88\u201394 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.10.002","journal-title":"Theor. Comput. Sci."},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-62495-3_55","volume-title":"Graph Drawing","author":"W Lenhart","year":"1997","unstructured":"Lenhart, W., Liotta, G.: Proximity drawings of outerplanar graphs (extended abstract). In: North, S. (ed.) GD 1996. LNCS, vol. 1190, pp. 286\u2013302. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62495-3_55"},{"issue":"2","key":"19_CR29","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980). https:\/\/doi.org\/10.1016\/0022-0000(80)90060-4","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20133","key":"19_CR30","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0012-365X(94)00268-N","volume":"148","author":"J Liu","year":"1996","unstructured":"Liu, J., Zhao, C.: A new bound on the feedback vertex sets in cubic graphs. Discrete Math. 148(1\u20133), 119\u2013131 (1996). https:\/\/doi.org\/10.1016\/0012-365X(94)00268-N","journal-title":"Discrete Math."},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-46632-0_31","volume-title":"Algorithms and Computation","author":"A Maheshwari","year":"1999","unstructured":"Maheshwari, A., Zeh, N.: External memory algorithms for outerplanar graphs. In: ISAAC 1999. LNCS, vol. 1741, pp. 307\u2013316. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46632-0_31"},{"issue":"3\u20134","key":"19_CR32","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/s00453-010-9484-z","volume":"62","author":"D Marx","year":"2012","unstructured":"Marx, D., Schlotter, I.: Obtaining a planar graph by vertex deletion. Algorithmica 62(3\u20134), 807\u2013822 (2012). https:\/\/doi.org\/10.1007\/s00453-010-9484-z","journal-title":"Algorithmica"},{"issue":"1","key":"19_CR33","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jctb.2000.2026","volume":"82","author":"B Mohar","year":"2001","unstructured":"Mohar, B.: Face covers and the genus problem for apex graphs. J. Comb. Theor. Ser. B 82(1), 102\u2013117 (2001). https:\/\/doi.org\/10.1006\/jctb.2000.2026","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1","key":"19_CR34","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math. 113(1), 109\u2013128 (2001). https:\/\/doi.org\/10.1016\/S0166-218X(00)00391-7","journal-title":"Discrete Appl. Math."},{"key":"19_CR35","doi-asserted-by":"publisher","unstructured":"N\u00f6llenburg, M., Sorge, M., Terziadis, S., Villedieu, A., Wu, H.Y., Wulms, J.: Planarizing graphs and their drawings by vertex splitting. In: Angelini, P., von Hanxleden, R. (eds.) GD 2022. LNCS, vol. 13764, pp. 232\u2013246. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-22203-0_17","DOI":"10.1007\/978-3-031-22203-0_17"},{"issue":"4","key":"19_CR36","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1142\/S0129054198000301","volume":"9","author":"D Paik","year":"1998","unstructured":"Paik, D., Reddy, S.M., Sahni, S.: Vertex splitting in dags and applications to partial scan designs and lossy circuits. Int. J. Found. Comput. Sci. 9(4), 377\u2013398 (1998). https:\/\/doi.org\/10.1142\/S0129054198000301","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"19_CR37","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ipl.2010.10.008","volume":"111","author":"P Schweitzer","year":"2010","unstructured":"Schweitzer, P., Schweitzer, P.: Connecting face hitting sets in planar graphs. Inf. Process. Lett. 111(1), 11\u201315 (2010). https:\/\/doi.org\/10.1016\/j.ipl.2010.10.008","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"19_CR38","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math. 144(1\u20132), 173\u2013182 (2004). https:\/\/doi.org\/10.1016\/j.dam.2004.01.007","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"19_CR39","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/jgt.3190030302","volume":"3","author":"WT Trotter","year":"1979","unstructured":"Trotter, W.T., Harary, F.: On double and multiple interval graphs. J. Graph. Theor. 3(3), 205\u2013211 (1979). https:\/\/doi.org\/10.1002\/jgt.3190030302","journal-title":"J. Graph. Theor."},{"issue":"1\u20133","key":"19_CR40","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","volume":"72","author":"S Ueno","year":"1988","unstructured":"Ueno, S., Kajitani, Y., Gotoh, S.: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. Discrete Math. 72(1\u20133), 355\u2013360 (1988). https:\/\/doi.org\/10.1016\/0012-365X(88)90226-9","journal-title":"Discrete Math."},{"issue":"7","key":"19_CR41","doi-asserted-by":"publisher","first-page":"2682","DOI":"10.1109\/TVCG.2020.3038154","volume":"28","author":"HY Wu","year":"2022","unstructured":"Wu, H.Y., N\u00f6llenburg, M., Viola, I.: Multi-level area balancing of clustered graphs. IEEE Trans. Vis. Comput. Graph. 28(7), 2682\u20132696 (2022). https:\/\/doi.org\/10.1109\/TVCG.2020.3038154","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"19_CR42","doi-asserted-by":"publisher","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC), pp. 253\u2013264. ACM (1978). https:\/\/doi.org\/10.1145\/800133.804355","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27051-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:05:29Z","timestamp":1678665929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27051-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031270505","9783031270512"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27051-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hsinchu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2023","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":"walcom2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.walcom2023.conf.nycu.edu.tw\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"40% - 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":"This proceeding includes 2 invited papers.","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)"}}]}}