{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:28:54Z","timestamp":1743082134313,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_26","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"335-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["1-Bend RAC Drawings of 1-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Walter","family":"Didimo","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Saeed","family":"Mehrabi","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.dam.2014.05.025","volume":"175","author":"Eyal Ackerman","year":"2014","unstructured":"Ackerman, E.: A note on 1-planar graphs. Discrete Appl. Math. 175, 104\u2013108 (2014). \n                      http:\/\/dx.doi.org\/10.1016\/j.dam.2014.05.025","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-03841-4_8","volume-title":"Graph Drawing","author":"MJ Alam","year":"2013","unstructured":"Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: Straight-line grid drawings of 3-connected 1-planar graphs. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 83\u201394. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-319-03841-4_8"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7155\/jgaa.00217","volume":"15","author":"P Angelini","year":"2011","unstructured":"Angelini, P., Cittadini, L., Didimo, W., Frati, F., Battista, G.D., Kaufmann, M., Symvonis, A.: On the perspectives opened by right angle crossing drawings. J. Graph Algorithms Appl. 15(1), 53\u201378 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"7","key":"26_CR4","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1093\/comjnl\/bxs088","volume":"56","author":"EN Argyriou","year":"2013","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: Maximizing the total resolution of graphs. Comput. J. 56(7), 887\u2013900 (2013)","journal-title":"Comput. J."},{"issue":"4","key":"26_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., Mori\u0107, F., T\u00f3th, C.D.: Graphs that admit right angle crossing drawings. Comput. Geom. 45(4), 169\u2013177 (2012)","journal-title":"Comput. Geom."},{"issue":"1","key":"26_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.7155\/jgaa.00388","volume":"20","author":"Michael A. Bekos","year":"2016","unstructured":"Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous drawing of planar graphs with right-angle crossings and few bends. J. Graph Algorithms Appl. 20(1), 133\u2013158 (2016). \n                      http:\/\/dx.doi.org\/10.7155\/jgaa.00388","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"26_CR7","unstructured":"Biedl, T.C., Liotta, G., Montecchiani, F.: On visibility representations of non-planar graphs. In: Fekete, S.P., Lubiw, A. (eds.) SoCG 2016. LIPIcs, vol. 51, pp. 19:1\u201319:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). \n                      http:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-009-5"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"421","DOI":"10.7155\/jgaa.00330","volume":"18","author":"FJ Brandenburg","year":"2014","unstructured":"Brandenburg, F.J.: 1-visibility representations of 1-planar graphs. J. Graph Algorithms Appl. 18(3), 421\u2013438 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.026","volume":"636","author":"Franz J. 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). \n                      http:\/\/dx.doi.org\/10.1016\/j.tcs.2016.04.026","journal-title":"Theoretical Computer Science"},{"key":"26_CR10","unstructured":"Chiba, N., Yamanouchi, T., Nishizeki, T.: Linear algorithms for convex drawings of planar graphs. In: Progress in Graph Theory, pp. 153\u2013173 (1984)"},{"key":"26_CR11","volume-title":"Graph Drawing","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"issue":"5","key":"26_CR12","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"26_CR13","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)","journal-title":"Algorithmica"},{"issue":"5","key":"26_CR14","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)","journal-title":"Comput. J."},{"issue":"8","key":"26_CR15","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1016\/j.comgeo.2013.03.001","volume":"46","author":"E Di Giacomo","year":"2013","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F.: Area requirement of graph drawings with few crossings per edge. Comput. Geom. 46(8), 909\u2013916 (2013)","journal-title":"Comput. Geom."},{"key":"26_CR16","unstructured":"Didimo, W., Liotta, G., Mehrabi, S., Montecchiani, F.: 1-Bend RAC Drawings of 1-Planar Graphs. ArXiv e-prints abs\/1608.08418 (2016). \n                      http:\/\/arxiv.org\/abs\/1608.08418v1"},{"issue":"7","key":"26_CR17","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.ipl.2013.01.013","volume":"113","author":"W Didimo","year":"2013","unstructured":"Didimo, W.: Density of straight-line 1-planar graph drawings. Inf. Process. Lett. 113(7), 236\u2013240 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"39","key":"26_CR18","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)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR19","volume-title":"Thirty Essays on Geometric Graph Theory","author":"W Didimo","year":"2012","unstructured":"Didimo, W., Liotta, G.: The crossing angle resolution in graph drawing. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Springer, New York (2012)"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-18469-7_15","volume-title":"Graph Drawing","author":"W Didimo","year":"2011","unstructured":"Didimo, W., Liotta, G., Romeo, S.A.: Topology-driven force-directed algorithms. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 165\u2013176. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-18469-7_15"},{"issue":"2","key":"26_CR21","doi-asserted-by":"publisher","first-page":"229","DOI":"10.7155\/jgaa.00224","volume":"15","author":"W Didimo","year":"2011","unstructured":"Didimo, W., Liotta, G., Romeo, S.A.: A graph drawing application to web site traffic analysis. J. Graph Algorithms Appl. 15(2), 229\u2013251 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"7\u20138","key":"26_CR22","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)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"26_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","volume":"49","author":"A Grigoriev","year":"2007","unstructured":"Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49(1), 1\u201311 (2007)","journal-title":"Algorithmica"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-32241-9_29","volume-title":"Computing and Combinatorics","author":"S-H Hong","year":"2012","unstructured":"Hong, S.-H., Eades, P., Liotta, G., Poon, S.-H.: F\u00e1ry\u2019s theorem for 1-planar graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 335\u2013346. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-32241-9_29"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Huang, W.: Using eye tracking to investigate graph layout effects. In: APVIS 2007, pp. 97\u2013100 (2007)","DOI":"10.1109\/APVIS.2007.329282"},{"issue":"4","key":"26_CR26","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)","journal-title":"J. Vis. Lang. Comput."},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Huang, W., Eades, P., Hong, S., Lin, C.: Improving force-directed graph drawings by making compromises between aesthetics. In: VL\/HCC, pp. 176\u2013183. IEEE (2010)","DOI":"10.1109\/VLHCC.2010.32"},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: PacificVis 2008, pp. 41\u201346. IEEE (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"issue":"1","key":"26_CR29","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"VP Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. J. Graph Theory 72(1), 30\u201371 (2013)","journal-title":"J. Graph Theory"},{"key":"26_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-18469-7_40","volume-title":"Graph Drawing","author":"Q Nguyen","year":"2011","unstructured":"Nguyen, Q., Eades, P., Hong, S.-H., Huang, W.: Large crossing angles in circular layouts. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 397\u2013399. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-18469-7_40"},{"issue":"3","key":"26_CR31","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"26_CR32","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). doi:\n                      10.1007\/3-540-63938-1_67"},{"issue":"2","key":"26_CR33","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0953-5438(00)00032-1","volume":"13","author":"HC Purchase","year":"2000","unstructured":"Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interact. Comput. 13(2), 147\u2013162 (2000)","journal-title":"Interact. Comput."},{"issue":"3","key":"26_CR34","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1016344215610","volume":"7","author":"HC Purchase","year":"2002","unstructured":"Purchase, H.C., Carrington, D.A., Allder, J.: Empirical evaluation of aesthetics-based graph layout. Empirical Softw. Eng. 7(3), 233\u2013255 (2002)","journal-title":"Empirical Softw. Eng."},{"issue":"1\u20132","key":"26_CR35","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. Semin. Univ. Hambg. 29(1\u20132), 107\u2013117 (1965)","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"issue":"4","key":"26_CR36","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1137\/090746835","volume":"24","author":"Y Suzuki","year":"2010","unstructured":"Suzuki, Y.: Re-embeddings of maximum 1-planar graphs. SIAM J. Discrete Math. 24(4), 1527\u20131540 (2010)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"26_CR37","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/jgt.3190120306","volume":"12","author":"C Thomassen","year":"1988","unstructured":"Thomassen, C.: Rectilinear drawings of graphs. J. Graph Theory 12(3), 335\u2013341 (1988)","journal-title":"J. Graph Theory"},{"issue":"2","key":"26_CR38","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C Ware","year":"2002","unstructured":"Ware, C., Purchase, H.C., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Inf. Vis. 1(2), 103\u2013110 (2002)","journal-title":"Inf. Vis."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:42:26Z","timestamp":1600476146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","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":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}