{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:48:18Z","timestamp":1743061698544,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819705658"},{"type":"electronic","value":"9789819705665"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-0566-5_3","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:03:28Z","timestamp":1709121808000},"page":"15-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Plane Multigraphs with\u00a0One-Bend and\u00a0Circular-Arc Edges of\u00a0a\u00a0Fixed Angle"],"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,2,29]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-981-15-6533-5_3","volume-title":"Beyond Planar Graphs: Communications of NII Shonan Meetings","author":"E Ackerman","year":"2020","unstructured":"Ackerman, E.: Quasi-planar graphs. In: Hong, S.H., Tokuyama, T. (eds.) Beyond Planar Graphs: Communications of NII Shonan Meetings, pp. 31\u201345. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5_3"},{"issue":"1","key":"3_CR2","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":"3_CR3","doi-asserted-by":"publisher","unstructured":"Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Comb. Theory, Ser. A 114(3), 563\u2013571 (2007). https:\/\/doi.org\/10.1016\/j.jcta.2006.08.002","DOI":"10.1016\/j.jcta.2006.08.002"},{"key":"3_CR4","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":"3_CR5","doi-asserted-by":"publisher","unstructured":"Angelini, P., Bekos, M.A., Katheder, J., Kaufmann, M., Pfister, M., Ueckerdt, T.: Axis-parallel right angle crossing graphs. In: Proceedings of 31st European Symposium on Algorithms (ESA). LIPIcs, vol. 274, pp. 9:1\u20139:15. Schloss Dagstuhl (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2023.9","DOI":"10.4230\/LIPIcs.ESA.2023.9"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.7155\/jgaa.00324","volume":"18","author":"P Angelini","year":"2014","unstructured":"Angelini, P., Eppstein, D., Frati, F., Kaufmann, M., Lazard, S., Mchedlidze, T., Teillaud, M., Wolff, A.: Universal point sets for drawing planar graphs with circular arcs. J. Graph Algorithms Appl. 18(3), 313\u2013324 (2014). https:\/\/doi.org\/10.7155\/jgaa.00324","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"3_CR7","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."},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.7155\/jgaa.00318","volume":"18","author":"MJ Bannister","year":"2014","unstructured":"Bannister, M.J., Cheng, Z., Devanny, W.E., Eppstein, D.: Superpatterns and universal point sets. J. Graph Algorithms Appl. 18(2), 177\u2013209 (2014). https:\/\/doi.org\/10.7155\/jgaa.00318","journal-title":"J. Graph Algorithms Appl."},{"issue":"5","key":"3_CR9","doi-asserted-by":"publisher","first-page":"2046","DOI":"10.1007\/s00453-018-0523-5","volume":"81","author":"MA Bekos","year":"2019","unstructured":"Bekos, M.A., F\u00f6rster, H., Kaufmann, M.: On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings. Algorithmica 81(5), 2046\u20132071 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0523-5","journal-title":"Algorithmica"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Chaplick, S., F\u00f6rster, H., Kryven, M., Wolff, A.: Drawing graphs with circular arcs and right-angle crossings. In: Proceedings of 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT). LIPIcs, vol. 162, pp. 21:1\u201321:14. Schloss Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2020.21","DOI":"10.4230\/LIPIcs.SWAT.2020.21"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/S0895480194264010","volume":"9","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Vismara, L.: Angles of planar triangular graphs. SIAM J. Discret. Math. 9(3), 349\u2013359 (1996). https:\/\/doi.org\/10.1137\/S0895480194264010","journal-title":"SIAM J. Discret. Math."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-981-15-6533-5_9","volume-title":"Beyond Planar Graphs, Communications of NII Shonan Meetings","author":"W Didimo","year":"2020","unstructured":"Didimo, W.: Right angle crossing drawings of graphs. In: Hong, S., Tokuyama, T. (eds.) Beyond Planar Graphs, Communications of NII Shonan Meetings, pp. 149\u2013169. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5_9"},{"issue":"39","key":"3_CR13","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":"3_CR14","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":"3_CR15","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"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"363","DOI":"10.7155\/jgaa.00599","volume":"26","author":"A Efrat","year":"2022","unstructured":"Efrat, A., Fulek, R., Kobourov, S.G., T\u00f3th, C.D.: Polygons with prescribed angles in 2D and 3D. J. Graph Algorithms Appl. 26(3), 363\u2013380 (2022). https:\/\/doi.org\/10.7155\/jgaa.00599","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/s00454-009-9149-3","volume":"43","author":"H Everett","year":"2010","unstructured":"Everett, H., Lazard, S., Liotta, G., Wismath, S.K.: Universal sets of n points for one-bend drawings of planar graphs with n vertices. Discret. Comput. Geom. 43(2), 272\u2013288 (2010). https:\/\/doi.org\/10.1007\/s00454-009-9149-3","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0925-7721(97)00016-3","volume":"9","author":"A Garg","year":"1998","unstructured":"Garg, A.: New results on drawing angle graphs. Comput. Geom. 9(1), 43\u201382 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(97)00016-3","journal-title":"Comput. Geom."},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-319-27261-0_35","volume-title":"Graph Drawing and Network Visualization","author":"M L\u00f6ffler","year":"2015","unstructured":"L\u00f6ffler, M., T\u00f3th, C.D.: Linear-size universal point sets for one-bend drawings. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 423\u2013429. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_35"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"T\u00f3th, C.D.: On RAC drawings of graphs with two bends per edge. In: Bekos, M.A., Chimani, M. (eds). GD 2023. LNCS, vol. 14465, pp. 69\u201377. Springer, Cham (2023). https:\/\/doi.org\/10.48550\/arXiv.2308.02663, https:\/\/doi.org\/10.1007\/978-3-031-49272-3_5","DOI":"10.48550\/arXiv.2308.02663 10.1007\/978-3-031-49272-3_5"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Vijayan, G.: Geometry of planar graphs with angles. In: Proceedings of 2nd Symposium on Computational Geometry (SoCG), pp. 116\u2013124. ACM Press, New York, NY (1986). https:\/\/doi.org\/10.1145\/10515.10528","DOI":"10.1145\/10515.10528"}],"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-981-97-0566-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:07:50Z","timestamp":1709654870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0566-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819705658","9789819705665"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0566-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","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":"Kanazawa","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.walcom-conference.org\/","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":"80","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":"28","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":"35% - 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":"1","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)"}}]}}