{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:44:35Z","timestamp":1757313875398,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492747"},{"type":"electronic","value":"9783031492754"}],"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-49275-4_5","type":"book-chapter","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:02:46Z","timestamp":1704715366000},"page":"66-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fixed-Parameter Algorithms for\u00a0Computing RAC Drawings of\u00a0Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1929-055X","authenticated-orcid":false,"given":"Cornelius","family":"Brand","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7762-8045","authenticated-orcid":false,"given":"Robert","family":"Ganian","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"R\u00f6der","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Schager","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,6]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2020.04.018","volume":"828\u2013829","author":"P Angelini","year":"2020","unstructured":"Angelini, P., Bekos, M.A., F\u00f6rster, H., Kaufmann, M.: On RAC drawings of graphs with one bend per edge. Theor. Comput. Sci. 828\u2013829, 42\u201354 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.04.018","journal-title":"Theor. Comput. Sci."},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Angelini, P., Bekos, M.A., Katheder, J., Kaufmann, M., Pfister, M.: RAC drawings of graphs with low degree. In: Szeider, S., Ganian, R., Silva, A. (eds.) 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22\u201326, 2022, Vienna, Austria. LIPIcs, vol. 241, pp. 11:1\u201311:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2022.11","DOI":"10.4230\/LIPIcs.MFCS.2022.11"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7155\/jgaa.00217","volume":"15","author":"P Angelini","year":"2011","unstructured":"Angelini, P., et al.: On the perspectives opened by right angle crossing drawings. J. Graph Algorithms Appl. 15(1), 53\u201378 (2011). https:\/\/doi.org\/10.7155\/jgaa.00217","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"569","DOI":"10.7155\/jgaa.00274","volume":"16","author":"EN Argyriou","year":"2012","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: The straight-line RAC drawing problem is np-hard. J. Graph Algorithms Appl. 16(2), 569\u2013597 (2012). https:\/\/doi.org\/10.7155\/jgaa.00274","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Balko, M., et al.: Bounding and computing obstacle numbers of graphs. In: Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.) 30th Annual European Symposium on Algorithms, ESA 2022, September 5\u20139, 2022, Berlin\/Potsdam, Germany. LIPIcs, vol. 244, pp. 11:1\u201311:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2022.11","DOI":"10.4230\/LIPIcs.ESA.2022.11"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.7155\/jgaa.00457","volume":"22","author":"MJ Bannister","year":"2018","unstructured":"Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. J. Graph Algorithms Appl. 22(1), 23\u201349 (2018). https:\/\/doi.org\/10.7155\/jgaa.00457","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Basu, S., Pollack, R., Roy, M.F.: Algorithms in Real Algebraic geometry, Algorithms and Computation in Mathematics, vol. 10. Springer, Cham (2006). https:\/\/doi.org\/10.1007\/3-540-33099-2, http:\/\/link.springer.com\/10.1007\/3-540-33099-2","DOI":"10.1007\/3-540-33099-2"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2017.05.039","volume":"689","author":"MA Bekos","year":"2017","unstructured":"Bekos, M.A., Didimo, W., Liotta, G., Mehrabi, S., Montecchiani, F.: On RAC drawings of 1-planar graphs. Theor. Comput. Sci. 689, 48\u201357 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.05.039","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"603","DOI":"10.7155\/jgaa.00526","volume":"24","author":"S Bhore","year":"2020","unstructured":"Bhore, S., Ganian, R., Montecchiani, F., N\u00f6llenburg, M.: Parameterized algorithms for book embedding problems. J. Graph Algorithms Appl. 24(4), 603\u2013620 (2020). https:\/\/doi.org\/10.7155\/jgaa.00526","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/jgaa.00597","volume":"26","author":"S Bhore","year":"2022","unstructured":"Bhore, S., Ganian, R., Montecchiani, F., N\u00f6llenburg, M.: Parameterized algorithms for queue layouts. J. Graph Algorithms Appl. 26(3), 335\u2013352 (2022). https:\/\/doi.org\/10.7155\/jgaa.00597","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR11","unstructured":"Bieker, N.: Complexity of graph drawing problems in relation to the existential theory of the reals. Ph.D. thesis, Bachelor\u2019s thesis, Karlsruhe Institute of Technology (August 2020) (2020)"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Brand, C., Ceylan, E., Ganian, R., Hatschka, C., Korchemna, V.: Edge-cut width: An algorithmically driven analogue of treewidth based on edge cuts. In: Bekos, M.A., Kaufmann, M. (eds.) Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, T\u00fcbingen, Germany, June 22\u201324, 2022, Revised Selected Papers. LNCS, vol. 13453, pp. 98\u2013113. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15914-5_8","DOI":"10.1007\/978-3-031-15914-5_8"},{"issue":"40\u201342","key":"5_CR13","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40\u201342), 3736\u20133756 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.06.026","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000). https:\/\/doi.org\/10.1007\/s002249910009","journal-title":"Theory Comput. Syst."},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. 1st edn. Springer Publishing Company, Inc., Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1007\/s00453-012-9706-7","volume":"68","author":"E Di Giacomo","year":"2014","unstructured":"Di Giacomo, E., Didimo, W., Eades, P., Liotta, G.: 2-layer right angle crossing drawings. Algorithmica 68(4), 954\u2013997 (2014). https:\/\/doi.org\/10.1007\/s00453-012-9706-7","journal-title":"Algorithmica"},{"issue":"5","key":"5_CR17","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1093\/comjnl\/bxu017","volume":"58","author":"E Di Giacomo","year":"2015","unstructured":"Di Giacomo, E., Didimo, W., Grilli, L., Liotta, G., Romeo, S.A.: Heuristics for the maximum 2-layer RAC subgraph problem. Comput. J. 58(5), 1085\u20131098 (2015). https:\/\/doi.org\/10.1093\/comjnl\/bxu017","journal-title":"Comput. J."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-981-15-6533-5_9","volume-title":"Beyond Planar Graphs","author":"W Didimo","year":"2020","unstructured":"Didimo, W.: Right angle crossing drawings of graphs. In: Hong, S.-H., Tokuyama, T. (eds.) Beyond Planar Graphs, pp. 149\u2013169. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5_9"},{"issue":"16","key":"5_CR19","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.ipl.2010.05.023","volume":"110","author":"W Didimo","year":"2010","unstructured":"Didimo, W., Eades, P., Liotta, G.: A characterization of complete bipartite RAC graphs. Inf. Process. Lett. 110(16), 687\u2013691 (2010). https:\/\/doi.org\/10.1016\/j.ipl.2010.05.023","journal-title":"Inf. Process. Lett."},{"issue":"39","key":"5_CR20","doi-asserted-by":"publisher","first-page":"5156","DOI":"10.1016\/j.tcs.2011.05.025","volume":"412","author":"W Didimo","year":"2011","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theoret. Comput. Sci. 412(39), 5156\u20135166 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.025","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/3301281","volume":"52","author":"W Didimo","year":"2019","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Surv. 52(1), 4:1-4:37 (2019). https:\/\/doi.org\/10.1145\/3301281","journal-title":"ACM Comput. Surv."},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph Theory. 5th Edn., Graduate Texts in Mathematics, vol. 173. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","DOI":"10.1007\/978-3-662-53622-3"},{"key":"5_CR23","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":"5_CR24","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.) 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24\u201328, 2020, Prague, Czech Republic. 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":"5_CR25","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.) 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8\u201311, 2020, Saarbr\u00fccken, Germany (Virtual Conference). 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":"1\u20132","key":"5_CR26","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10107-017-1199-3","volume":"171","author":"K Fleszar","year":"2018","unstructured":"Fleszar, K., Mnich, M., Spoerhase, J.: New algorithms for maximum disjoint paths based on tree-likeness. Math. Program. 171(1\u20132), 433\u2013461 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1199-3","journal-title":"Math. Program."},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"F\u00f6rster, H., Kaufmann, M.: On compact RAC drawings. In: Grandoni, F., Herman, G., Sanders, P. (eds.) 28th Annual European Symposium on Algorithms, ESA 2020, September 7\u20139, 2020, Pisa, Italy (Virtual Conference). LIPIcs, vol. 173, pp. 53:1\u201353:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.53","DOI":"10.4230\/LIPIcs.ESA.2020.53"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting f\u00e1ry embeddings of planar graphs. In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2\u20134, 1988, Chicago, Illinois, USA, pp. 426\u2013433. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62254","DOI":"10.1145\/62212.62254"},{"key":"5_CR29","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight lines representation of planar graphs. Acta Sci. Math. (Szeged) 11, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"5_CR30","doi-asserted-by":"publisher","unstructured":"Ganian, R.: Using neighborhood diversity to solve hard problems. CoRR abs\/1201.3091 (2012). https:\/\/doi.org\/10.48550\/arXiv.1201.3091","DOI":"10.48550\/arXiv.1201.3091"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Ganian, R., Korchemna, V.: Slim tree-cut width. In: Dell, H., Nederlof, J. (eds.) 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7\u20139, 2022, Potsdam, Germany. LIPIcs, vol. 249, pp. 15:1\u201315:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2022.15","DOI":"10.4230\/LIPIcs.IPEC.2022.15"},{"issue":"2","key":"5_CR32","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/s00453-020-00772-w","volume":"83","author":"R Ganian","year":"2021","unstructured":"Ganian, R., Ordyniak, S.: The power of cut-based parameters for computing edge-disjoint paths. Algorithmica 83(2), 726\u2013752 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00772-w","journal-title":"Algorithmica"},{"issue":"3","key":"5_CR33","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is np-complete. SIAM J. Algebraic Discret. Methods 4(3), 312\u2013316 (1983). https:\/\/doi.org\/10.1137\/0604033","journal-title":"SIAM J. Algebraic Discret. Methods"},{"issue":"2","key":"5_CR34","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.jcss.2003.07.008","volume":"68","author":"M Grohe","year":"2004","unstructured":"Grohe, M.: Computing crossing numbers in quadratic time. J. Comput. Syst. Sci. 68(2), 285\u2013302 (2004). https:\/\/doi.org\/10.1016\/j.jcss.2003.07.008","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Hlinen\u00fd, P., Sankaran, A.: Exact crossing number parameterized by vertex cover. In: Archambault, D., T\u00f3th, C.D. (eds.) Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17\u201320, 2019, Proceedings. LNCS, vol. 11904, pp. 307\u2013319. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_24","DOI":"10.1007\/978-3-030-35802-0_24"},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"Huang, W.: Using eye tracking to investigate graph layout effects. In: Hong, S., Ma, K. (eds.) APVIS 2007, 6th International Asia-Pacific Symposium on Visualization 2007, Sydney, Australia, 5\u20137 February 2007, pp. 97\u2013100. IEEE Computer Society (2007). https:\/\/doi.org\/10.1109\/APVIS.2007.329282","DOI":"10.1109\/APVIS.2007.329282"},{"key":"5_CR37","doi-asserted-by":"publisher","unstructured":"Huang, W., Eades, P., Hong, S.: Larger crossing angles make graphs easier to read. J. Vis. Lang. Comput. 25(4), 452\u2013465 (2014). https:\/\/doi.org\/10.1016\/j.jvlc.2014.03.001","DOI":"10.1016\/j.jvlc.2014.03.001"},{"key":"5_CR38","doi-asserted-by":"publisher","unstructured":"Huang, W., Hong, S., Eades, P.: Effects of crossing angles. In: IEEE VGTC Pacific Visualization Symposium 2008, PacificVis 2008, Kyoto, Japan, March 5\u20137, 2008, pp. 41\u201346. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/PACIFICVIS.2008.4475457","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"issue":"4","key":"5_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.23638\/LMCS-15(4:12)2019","volume":"15","author":"D Knop","year":"2019","unstructured":"Knop, D., Kouteck\u00fd, M., Masar\u00edk, T., Toufar, T.: Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. Log. Methods Comput. Sci. 15(4), 1\u201332 (2019). https:\/\/doi.org\/10.23638\/LMCS-15(4:12)2019","journal-title":"Log. Methods Comput. Sci."},{"key":"5_CR40","doi-asserted-by":"publisher","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. In: de Berg, M., Meyer, U. (eds.) Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6\u20138, 2010. Proceedings, Part I. LNCS, vol. 6346, pp. 549\u2013560. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-642-15775-2_47","DOI":"10.1007\/978-3-642-15775-2_47"},{"issue":"4","key":"5_CR41","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1137\/S1052623498334013","volume":"11","author":"P Mutzel","year":"2001","unstructured":"Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. SIAM J. Optim. 11(4), 1065\u20131080 (2001). https:\/\/doi.org\/10.1137\/S1052623498334013","journal-title":"SIAM J. Optim."},{"key":"5_CR42","doi-asserted-by":"publisher","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-642-27875-4","DOI":"10.1007\/978-3-642-27875-4"},{"key":"5_CR43","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar Tree-width. J. Comb. Theory, Ser. B. 36(1), 49\u201364 (1984). https:\/\/doi.org\/10.1016\/0095-8956(84)90013-3","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"5_CR44","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: RAC-drawability is $$\\exists \\mathbb{R} $$-complete. In: Graph Drawing and Network Visualization: 29th International Symposium, GD 2021, T\u00fcbingen, Germany, September 14\u201317, 2021, Revised Selected Papers, pp. 72\u201386. Springer-Verlag, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-92931-2_5","DOI":"10.1007\/978-3-030-92931-2_5"}],"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-49275-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:03:35Z","timestamp":1704715415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49275-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492747","9783031492754"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49275-4_5","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":"6 January 2024","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":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","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":"100","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":"31","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":"31% - 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":"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)"}},{"value":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","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)"}}]}}