{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:54:24Z","timestamp":1757310864482,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031222023"},{"type":"electronic","value":"9783031222030"}],"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-22203-0_17","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"232-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Planarizing Graphs and\u00a0Their Drawings by\u00a0Vertex Splitting"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7394-3147","authenticated-orcid":false,"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5161-3841","authenticated-orcid":false,"given":"Soeren","family":"Terziadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6196-8347","authenticated-orcid":false,"given":"Ana\u00efs","family":"Villedieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1028-0010","authenticated-orcid":false,"given":"Hsiang-Yun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9314-8260","authenticated-orcid":false,"given":"Jules","family":"Wulms","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.jda.2008.07.004","volume":"6","author":"FN Abu-Khzam","year":"2008","unstructured":"Abu-Khzam, F.N., Fernau, H., Langston, M.A.: A bounded search tree algorithm for parameterized face cover. J. Discrete Algorithms 6(4), 541\u2013552 (2008). https:\/\/doi.org\/10.1016\/j.jda.2008.07.004","journal-title":"J. Discrete Algorithms"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-28639-4_19","volume-title":"Parameterized and Exact Computation","author":"FN Abu-Khzam","year":"2004","unstructured":"Abu-Khzam, F.N., Langston, M.A.: A direct algorithm for the parameterized face cover problem. In: Downey, R., Fellows, M., Dehne, F. (eds.) Parameterized and Exact Computation. LNCS, vol. 3162, pp. 213\u2013222. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28639-4_19"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Angelini, P., et al.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4), 32:1\u201332:42 (2015). https:\/\/doi.org\/10.1145\/2629341","DOI":"10.1145\/2629341"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-030-60440-0_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A Arroyo","year":"2020","unstructured":"Arroyo, A., Klute, F., Parada, I., Seidel, R., Vogtenhuber, B., Wiedera, T.: Inserting one edge into a simple drawing is hard. In: Adler, I., M\u00fcller, H. (eds.) WG 2020. LNCS, vol. 12301, pp. 325\u2013338. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60440-0_26"},{"issue":"1","key":"17_CR5","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."},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Chimani, M., Gutwenger, C., Mutzel, P., Wolf, C.: Inserting a vertex into a planar graph. In: Mathieu, C. (ed.) Proceedings of 20th Symposium on Discrete Algorithms (SODA), pp. 375\u2013383. SIAM (2009). https:\/\/doi.org\/10.1137\/1.9781611973068.42","DOI":"10.1137\/1.9781611973068.42"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Chimani, M., Hlinen\u00fd, P.: Inserting multiple edges into a planar graph. In: Fekete, S.P., Lubiw, A. (eds.) Proceedings of 32nd International Symposium on Computational Geometry (SoCG). LIPIcs, vol. 51, pp. 30:1\u201330:15 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2016.30","DOI":"10.4230\/LIPIcs.SoCG.2016.30"},{"key":"17_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/BFb0021804","volume-title":"Graph Drawing","author":"P Eades","year":"1996","unstructured":"Eades, P., de Mendon\u00e7a N, C.F.X.: Vertex splitting and tension-free layout. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 202\u2013211. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021804"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Eiben, E., Ganian, R., Hamm, T., Klute, F., N\u00f6llenburg, M.: Extending nearly complete 1-planar drawings in polynomial time. In: Esparza, J., Kr\u00e1l\u2019, D. (eds.) Proceedings of 45th International Symposium on Mathematical Foundations of Computer Science (MFCS). LIPIcs, vol. 170, pp. 31:1\u201331:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2020.31","DOI":"10.4230\/LIPIcs.MFCS.2020.31"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Eiben, E., Ganian, R., Hamm, T., Klute, F., N\u00f6llenburg, M.: Extending partial 1-planar drawings. In: Czumaj, A., Dawar, A., Merelli, E. (eds.) Proceedings of 47th International Colloquium on Automata, Languages, and Programming (ICALP). LIPIcs, vol. 168, pp. 43:1\u201343:19. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.43","DOI":"10.4230\/LIPIcs.ICALP.2020.43"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1007\/s00453-017-0328-y","volume":"80","author":"D Eppstein","year":"2017","unstructured":"Eppstein, D., Kindermann, P., Kobourov, S., Liotta, G., Lubiw, A., Maignan, A., Mondal, D., Vosoughpour, H., Whitesides, S., Wismath, S.: 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":"17_CR13","doi-asserted-by":"publisher","unstructured":"Faria, L., de Figueiredo, C.M.H., de Mendon\u00e7a N., 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","DOI":"10.1016\/S0166-218X(00)00220-1"},{"issue":"4","key":"17_CR14","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem is NP-complete. J. SIAM Appl. Math. 32(4), 826\u2013834 (1977). https:\/\/doi.org\/10.1137\/0132071","journal-title":"J. SIAM Appl. Math."},{"issue":"1","key":"17_CR15","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 }}$$. Discret. Math. 62(1), 35\u201347 (1986). https:\/\/doi.org\/10.1016\/0012-365X(86)90039-7","journal-title":"Discret. Math."},{"issue":"1","key":"17_CR16","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":"17_CR17","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. Visual Comput. Graph. 14(6), 1317\u20131324 (2008). https:\/\/doi.org\/10.1109\/TVCG.2008.141","journal-title":"IEEE Trans. Visual Comput. Graph."},{"issue":"6","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/TVCG.2010.210","volume":"16","author":"N Henry Riche","year":"2010","unstructured":"Henry Riche, N., Dwyer, T.: Untangling euler diagrams. IEEE Trans. Visual Comput. Graph. 16(6), 1090\u20131099 (2010). https:\/\/doi.org\/10.1109\/TVCG.2010.210","journal-title":"IEEE Trans. Visual Comput. Graph."},{"issue":"2","key":"17_CR19","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."},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Jansen, B.M.P., Lokshtanov, D., Saurabh, S.: A near-optimal planarization algorithm. In: Chekuri, C. (ed.) Proceedings of 2014 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1802\u20131811. Proceedings, Society for Industrial and Applied Mathematics (2013). https:\/\/doi.org\/10.1137\/1.9781611973402.130","DOI":"10.1137\/1.9781611973402.130"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Kawarabayashi, K.i.: Planarity allowing few error vertices in linear time. In: Proceedings of 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 639\u2013648 (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.45","DOI":"10.1109\/FOCS.2009.45"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Kim, E.J., Langer, A., Paul, C., Reidl, F., Rossmanith, P., Sau, I., Sikdar, S.: Linear kernels and single-exponential algorithms via protrusion decompositions. ACM Trans. Algorithms 12(2), 21:1\u201321:41 (2015). https:\/\/doi.org\/10.1145\/2797140","DOI":"10.1145\/2797140"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-36379-3_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Kloks","year":"2002","unstructured":"Kloks, T., Lee, C.M., Liu, J.: New algorithms for k-Face Cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs. In: Goos, G., Hartmanis, J., van Leeuwen, J., Ku\u010dera, L. (eds.) Graph-Theoretic Concepts in Computer Science. LNCS, vol. 2573, pp. 282\u2013295. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36379-3_25"},{"issue":"2","key":"17_CR24","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. Discret. Math. 339(2), 745\u2013758 (2016). https:\/\/doi.org\/10.1016\/j.disc.2015.10.023","journal-title":"Discret. Math."},{"issue":"6","key":"17_CR25","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1111\/j.1467-8659.2011.01898.x","volume":"30","author":"T von Landesberger","year":"2011","unstructured":"von Landesberger, T., Kuijper, A., Schreck, T., Kohlhammer, J., van Wijk, J.J., Fekete, J.D., Fellner, D.W.: Visual analysis of large graphs: State-of-the-art and future research challenges. Comput. Graph. Forum 30(6), 1719\u20131749 (2011). https:\/\/doi.org\/10.1111\/j.1467-8659.2011.01898.x","journal-title":"Comput. Graph. Forum"},{"issue":"2","key":"17_CR26","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":"3","key":"17_CR27","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1111\/cgf.13213","volume":"36","author":"A Lhuillier","year":"2017","unstructured":"Lhuillier, A., Hurter, C., Telea, A.C.: State of the art in edge and trail bundling techniques. Comput. Graph. Forum 36(3), 619\u2013645 (2017). https:\/\/doi.org\/10.1111\/cgf.13213","journal-title":"Comput. Graph. Forum"},{"issue":"1","key":"17_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00032","volume":"5","author":"A Liebers","year":"2001","unstructured":"Liebers, A.: Planarizing graphs - a survey and annotated bibliography. J. Graph Algorithms Appl. 5(1), 1\u201374 (2001). https:\/\/doi.org\/10.7155\/jgaa.00032","journal-title":"J. Graph Algorithms Appl."},{"issue":"3\u20134","key":"17_CR29","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":"2","key":"17_CR30","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Vis. Lang. Comput. 6(2), 183\u2013210 (1995). https:\/\/doi.org\/10.1006\/jvlc.1995.1010","journal-title":"J. Vis. Lang. Comput."},{"issue":"3","key":"17_CR31","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1109\/TCBB.2019.2938501","volume":"18","author":"SS Nielsen","year":"2019","unstructured":"Nielsen, S.S., Ostaszewski, M., McGee, F., Hoksza, D., Zorzan, S.: Machine learning to support the presentation of complex pathway graphs. IEEE\/ACM Trans. Comput. Biol. Bioinf. 18(3), 1130\u20131141 (2019). https:\/\/doi.org\/10.1109\/TCBB.2019.2938501","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"17_CR32","unstructured":"N\u00f6llenburg, M., Sorge, M., Terziadis, S., Villedieu, A., Wu, H., Wulms, J.: Planarizing graphs and their drawings by vertex splitting. CoRR abs\/2202.12293 (2022). https:\/\/arxiv.org\/abs\/2202.12293"},{"key":"17_CR33","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-981-15-6533-5_11","volume-title":"Beyond Planar Graphs","author":"M N\u00f6llenburg","year":"2020","unstructured":"N\u00f6llenburg, M.: Crossing layout in non-planar graph drawings. In: Hong, S.-H., Tokuyama, T. (eds.) Beyond Planar Graphs, pp. 187\u2013209. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5_11"},{"key":"17_CR34","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-981-15-6533-5_10","volume-title":"Beyond Planar Graphs","author":"Y Okamoto","year":"2020","unstructured":"Okamoto, Y.: Angular resolutions: around vertices and crossings. In: Hong, S.-H., Tokuyama, T. (eds.) Beyond Planar Graphs, pp. 171\u2013186. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5_10"},{"key":"17_CR35","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"},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: Crossing Numbers of Graphs. CRC Press (2018)","DOI":"10.1201\/9781315152394"},{"issue":"1","key":"17_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-019-2779-4","volume":"20","author":"HY Wu","year":"2019","unstructured":"Wu, H.Y., N\u00f6llenburg, M., Sousa, F.L., Viola, I.: Metabopolis: scalable network layout for biological pathway diagrams in urban map style. BMC Bioinform. 20(1), 1\u201320 (2019). https:\/\/doi.org\/10.1186\/s12859-019-2779-4","journal-title":"BMC Bioinform."},{"key":"17_CR38","doi-asserted-by":"publisher","unstructured":"Wu, H.Y., N\u00f6llenburg, M., Viola, I.: Multi-level area balancing of clustered graphs. IEEE Trans. Visualization Comput. Graph., 1\u201315 (2020). https:\/\/doi.org\/10.1109\/TVCG.2020.3038154","DOI":"10.1109\/TVCG.2020.3038154"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22203-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:04:38Z","timestamp":1704351878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_17","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":"19 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"70","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":"25","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":"7","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":"36% - 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.01","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":"7.03","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)"}}]}}