{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:31:49Z","timestamp":1760441509156,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030044138"},{"type":"electronic","value":"9783030044145"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04414-5_10","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T13:20:45Z","timestamp":1545052845000},"page":"137-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3501-4608","authenticated-orcid":false,"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7833-0454","authenticated-orcid":false,"given":"Fabian","family":"Lipp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Zink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.dam.2017.08.015","volume":"232","author":"C Bachmaier","year":"2017","unstructured":"Bachmaier, C., Brandenburg, F.J., Hanauer, K., Neuwirth, D., Reislhuber, J.: NIC-planar graphs. Discrete Appl. Math. 232, 23\u201340 (2017). https:\/\/doi.org\/10.1016\/j.dam.2017.08.015","journal-title":"Discrete Appl. Math."},{"key":"10_CR2","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."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.026","volume":"636","author":"FJ Brandenburg","year":"2016","unstructured":"Brandenburg, F.J., Didimo, W., Evans, W.S., Kindermann, P., Liotta, G., Montecchiani, F.: Recognizing and drawing IC-planar graphs. Theor. Comput. Sci. 636, 1\u201316 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.04.026","journal-title":"Theor. Comput. Sci."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact drawings of 1-planar graphs with right-angle crossings and few bends. Arxiv report (2018). http:\/\/arxiv.org\/abs\/1806.10044v4","DOI":"10.1007\/978-3-030-04414-5_10"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Inf. Process. Lett. 54(4), 241\u2013246 (1995). https:\/\/doi.org\/10.1016\/0020-0190(95)00020-D","journal-title":"Inf. Process. Lett."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Czap, J., Hud\u00e1k, D.: On drawings and decompositions of 1-planar graphs. Electr. J. Comb. 20(2), 54 (2013). http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i2p54","DOI":"10.37236\/2392"},{"issue":"39","key":"10_CR7","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":"10_CR8","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. Arxiv report (2018). http:\/\/arxiv.org\/abs\/1804.07257"},{"issue":"7\u20138","key":"10_CR9","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1016\/j.dam.2012.11.019","volume":"161","author":"P Eades","year":"2013","unstructured":"Eades, P., Liotta, G.: Right angle crossing graphs and 1-planarity. Discrete Appl. Math. 161(7\u20138), 961\u2013969 (2013). https:\/\/doi.org\/10.1016\/j.dam.2012.11.019","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990). https:\/\/doi.org\/10.1007\/BF02122694","journal-title":"Combinatorica"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/PL00009189","volume":"20","author":"D Harel","year":"1998","unstructured":"Harel, D., Sardas, M.: An algorithm for straight-line drawing of planar graphs. Algorithmica 20(2), 119\u2013135 (1998). https:\/\/doi.org\/10.1007\/PL00009189","journal-title":"Algorithmica"},{"issue":"6","key":"10_CR12","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973). https:\/\/doi.org\/10.1145\/362248.362272","journal-title":"Commun. ACM"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.jvlc.2014.03.001","volume":"25","author":"W Huang","year":"2014","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","journal-title":"J. Vis. Lang. Comput."},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Huang, W., Hong, S., Eades, P.: Effects of crossing angles. In: Proceedings IEEE VGTC Pacific Visualization Symposium (PacificVis 2008), pp. 41\u201346 (2008). https:\/\/doi.org\/10.1109\/PACIFICVIS.2008.4475457","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cosrev.2017.06.002","volume":"25","author":"SG Kobourov","year":"2017","unstructured":"Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49\u201367 (2017). https:\/\/doi.org\/10.1016\/j.cosrev.2017.06.002","journal-title":"Comput. Sci. Rev."},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ipl.2015.11.011","volume":"116","author":"G Liotta","year":"2016","unstructured":"Liotta, G., Montecchiani, F.: L-visibility drawings of IC-planar graphs. Inf. Process. Lett. 116(3), 217\u2013222 (2016). https:\/\/doi.org\/10.1016\/j.ipl.2015.11.011","journal-title":"Inf. Process. Lett."},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing","author":"H Purchase","year":"1997","unstructured":"Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248\u2013261. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63938-1_67"},{"issue":"1\u20132","key":"10_CR18","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02996313","volume":"29","author":"G Ringel","year":"1965","unstructured":"Ringel, G.: Ein Sechsfarbenproblem auf der Kugel. Abh. Math. Seminar Univ. Hamburg 29(1\u20132), 107\u2013117 (1965)","journal-title":"Abh. Math. Seminar Univ. Hamburg"},{"key":"10_CR19","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Johnson, D.S. (ed.) Proceedings 1st ACM-SIAM Symposium Discrete Algorithms (SODA 1990), pp. 138\u2013148 (1990). http:\/\/dl.acm.org\/citation.cfm?id=320176.320191"},{"key":"10_CR20","unstructured":"Wikipedia contributors: Farey sequence\u2014Wikipedia, the free encyclopedia (2018). https:\/\/en.wikipedia.org\/w\/index.php?title=Farey_sequence&oldid=844932264. Accessed 8 June 2018"},{"key":"10_CR21","unstructured":"Zink, J.: 1-planar RAC drawings with bends. Master\u2019s thesis, Institut f\u00fcr Informatik, Universit\u00e4t W\u00fcrzburg (2017). http:\/\/www1.pub.informatik.uni-wuerzburg.de\/pub\/theses\/2017-zink-master.pdf"}],"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-030-04414-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:53:35Z","timestamp":1710233615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04414-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030044138","9783030044145"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04414-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 December 2018","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":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dccg.upc.edu\/gd2018\/","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":"85","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":"41","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":"48% - 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.25","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":"3.92","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":"The book also contains 1 full invited paper and 1 contest report","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}