{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:26:00Z","timestamp":1754486760363,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492716"},{"type":"electronic","value":"9783031492723"}],"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-49272-3_5","type":"book-chapter","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:04:34Z","timestamp":1704963874000},"page":"69-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On RAC Drawings of\u00a0Graphs with\u00a0Two Bends per\u00a0Edge"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8769-3190","authenticated-orcid":false,"given":"Csaba D.","family":"T\u00f3th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,1]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/100819564","volume":"26","author":"E Ackerman","year":"2012","unstructured":"Ackerman, E., Fulek, R., T\u00f3th, C.D.: Graphs that admit polyline drawings with few crossing angles. SIAM J. Discret. Math. 26(1), 305\u2013320 (2012). https:\/\/doi.org\/10.1137\/100819564","journal-title":"SIAM J. Discret. Math."},{"key":"5_CR2","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_CR3","doi-asserted-by":"publisher","unstructured":"Angelini, P., Bekos, M.A., Katheder, J., Kaufmann, M., Pfister, M.: RAC drawings of graphs with low degree. In: Proceedings of the 47th Symposium on Mathematical Foundations of Computer Science (MFCS). LIPIcs, vol. 241, pp. 11:1\u201311:15. Schloss Dagstuhl (2022). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2022.11","DOI":"10.4230\/LIPIcs.MFCS.2022.11"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Angelini, P., Bekos, M.A., Katheder, J., Kaufmann, M., Pfister, M., Ueckerdt, T.: Axis-parallel right angle crossing graphs (2023). https:\/\/doi.org\/10.48550\/arXiv.2306.17073, preprint arXiv:2306.17073","DOI":"10.48550\/arXiv.2306.17073"},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.comgeo.2011.11.008","volume":"45","author":"K Arikushi","year":"2012","unstructured":"Arikushi, K., Fulek, R., Keszegh, B., Moric, F., T\u00f3th, C.D.: Graphs that admit right angle crossing drawings. Comput. Geom. 45(4), 169\u2013177 (2012). https:\/\/doi.org\/10.1016\/j.comgeo.2011.11.008","journal-title":"Comput. Geom."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2018.05.029","volume":"745","author":"SW Bae","year":"2018","unstructured":"Bae, S.W., et al.: Gap-planar graphs. Theor. Comput. Sci. 745, 36\u201352 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.05.029","journal-title":"Theor. Comput. Sci."},{"key":"5_CR7","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":"39","key":"5_CR8","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. Theor. Comput. Sci. 412(39), 5156\u20135166 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.025","journal-title":"Theor. Comput. Sci."},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Surv. 52(1), 4:1\u20134:37 (2019). https:\/\/doi.org\/10.1145\/3301281","DOI":"10.1145\/3301281"},{"key":"5_CR10","unstructured":"Dujmovi\u0107, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. Chic. J. Theor. Comput. Sci. 2011 (2011). http:\/\/cjtcs.cs.uchicago.edu\/articles\/CATS2010\/4\/contents.html"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"F\u00f6rster, H., Kaufmann, M.: On compact RAC drawings. In: Grandoni, F., Herman, G., Sanders, P. (eds.) Proceedings of the 28th European Symposium on Algorithms (ESA). LIPIcs, vol. 173, pp. 53:1\u201353:21. Schloss Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.53","DOI":"10.4230\/LIPIcs.ESA.2020.53"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"105945","DOI":"10.1016\/j.ipl.2020.105945","volume":"159\u2013160","author":"Z Rahmati","year":"2020","unstructured":"Rahmati, Z., Emami, F.: RAC drawings in subcubic area. Inf. Process. Lett. 159\u2013160, 105945 (2020). https:\/\/doi.org\/10.1016\/j.ipl.2020.105945","journal-title":"Inf. Process. Lett."},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-030-92931-2_5","volume-title":"Graph Drawing and Network Visualization","author":"M Schaefer","year":"2021","unstructured":"Schaefer, M.: $$\\rm RAC$$-drawability is $$\\exists \\mathbb{R}$$-complete. In: Purchase, H.C., Rutter, I. (eds.) GD 2021. LNCS, vol. 12868, pp. 72\u201386. Springer, Cham (2021). https:\/\/doi.org\/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-49272-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:05:49Z","timestamp":1704963949000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49272-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492716","9783031492723"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49272-3_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":"1 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)"}}]}}