{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:35:50Z","timestamp":1770978950068,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":60,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811565328","type":"print"},{"value":"9789811565335","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-981-15-6533-5_9","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:06:26Z","timestamp":1601471186000},"page":"149-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Right Angle Crossing Drawings of Graphs"],"prefix":"10.1007","author":[{"given":"Walter","family":"Didimo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"issue":"1","key":"9_CR1","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., Di Battista, G., 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."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Angelini, P., Di Battista, G., Didimo, W., Frati, F., Hong, S., Kaufmann, M., Liotta, G., Lubiw, A.: Large angle crossing drawings of planar graphs in subquadratic area. In: M\u00e1rquez, A., Ramos, P., Urrutia, J. (eds.) Computational Geometry - XIV Spanish Meeting on Computational Geometry, EGC 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Alcal\u00e1 de Henares, Spain, 27\u201330 June 2011, Revised Selected Papers. Lecture Notes in Computer Science, vol. 7579, pp. 200\u2013209. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-34191-5_19"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Angelini, P., Bekos, M.A., F\u00f6rster, H., Kaufmann, M.: On RAC drawings of graphs with one bend per edge. Graph Drawing. Lecture Notes in Computer Science, vol. 11282, pp. 123\u2013136. Springer, Berlin (2018)","DOI":"10.1007\/978-3-030-04414-5_9"},{"issue":"2","key":"9_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)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.7155\/jgaa.00282","volume":"17","author":"EN Argyriou","year":"2013","unstructured":"Argyriou, E.N., Bekos, M.A., Kaufmann, M., Symvonis, A.: Geometric RAC simultaneous drawings of graphs. J. Graph Algorithms Appl. 17(1), 11\u201334 (2013)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"9_CR6","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.: Theory Appl. 45(4), 169\u2013177 (2012)","journal-title":"Comput. Geom.: Theory Appl."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Auer, C., Brandenburg, F., Glei\u00dfner, A., Hanauer, K.: On sparse maximal 2-planar graphs. In: Didimo and Patrignani [37], pp. 555\u2013556","DOI":"10.1007\/978-3-642-36763-2_50"},{"key":"9_CR8","unstructured":"Avital, S., Hanani, H.: Graphs. Gilyonot Lematematika 3, 2\u20138 (1966)"},{"key":"9_CR9","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. Discret. Appl. Math. 232, 23\u201340 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.7155\/jgaa.00388","volume":"20","author":"MA 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)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR11","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)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR12","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 349\u2013381. Chapman and Hall\/CRC, London\/Boca Raton (2013)"},{"key":"9_CR13","volume-title":"Extremal Graph Theory","author":"B Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Academic, New York (1978)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Brandenburg, F., Eppstein, D., Glei\u00dfner, A., Goodrich, M.T., Hanauer, K., Reislhuber, J.: On the density of maximal 1-planar graphs. In: Didimo and Patrignani [37], pp. 327\u2013338","DOI":"10.1007\/978-3-642-36763-2_29"},{"key":"9_CR15","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)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P Bra\u00df","year":"2007","unstructured":"Bra\u00df, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom.: Theory Appl. 36(2), 117\u2013130 (2007)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0406017","volume":"6","author":"G Brightwell","year":"1993","unstructured":"Brightwell, G., Scheinerman, E.R.: Representations of planar graphs. SIAM J. Discret. Math. 6(2), 214\u2013229 (1993)","journal-title":"SIAM J. Discret. Math."},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact drawings of 1-planar graphs with right-angle crossings and few bends. In: Biedl, T.C., Kerren, A. (eds.) Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Barcelona, Spain, 26\u201328 September 2018, Proceedings. Lecture Notes in Computer Science, vol. 11282, pp. 137\u2013151. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_10","DOI":"10.1007\/978-3-030-04414-5_10"},{"issue":"4","key":"9_CR19","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-014-9935-z","volume":"73","author":"O Cheong","year":"2015","unstructured":"Cheong, O., Har-Peled, S., Kim, H., Kim, H.: On the number of edges of fan-crossing free graphs. Algorithmica 73(4), 673\u2013695 (2015)","journal-title":"Algorithmica"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Chimani, M., Zeranski, R.: Upward planarity testing in practice: SAT formulations and comparative study. ACM J. Exp. Algorithmics 20, 1.2:1.1\u20131.2:1.27 (2015)","DOI":"10.1145\/2699875"},{"key":"9_CR21","unstructured":"Comit\u00e9 Consultatif International T\u00e9l\u00e9phonique et T\u00e9l\u00e9graphique: Definition of numerical Petri nets - graphical representation, CCITT standards document, committee X (1985)"},{"issue":"6","key":"9_CR22","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1142\/S021819591250015X","volume":"22","author":"HR Dehkordi","year":"2012","unstructured":"Dehkordi, H.R., Eades, P.: Every outer-1-plane graph has a right angle crossing drawing. Int. J. Comput. Geom. Appl. 22(6), 543\u2013558 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61, 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G Di Battista","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I.G.: Area requirement and symmetry display of planar upward drawings. Discret. Comput. Geom. 7, 381\u2013401 (1992)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"9_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1142\/S0218195907002276","volume":"17","author":"E Di Giacomo","year":"2007","unstructured":"Di Giacomo, E., Liotta, G.: Simultaneous embedding of outerplanar graphs, paths, and cycles. Int. J. Comput. Geom. Appl. 17(2), 139\u2013160 (2007)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"9_CR26","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00224-010-9275-6","volume":"49","author":"E Di Giacomo","year":"2011","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing resolution of non-planar graph drawings. Theory Comput. Syst. 49(3), 565\u2013575 (2011)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"9_CR27","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":"9_CR28","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":"11","key":"9_CR29","doi-asserted-by":"publisher","first-page":"3126","DOI":"10.1093\/comjnl\/bxv048","volume":"58","author":"E Di Giacomo","year":"2015","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Wismath, S.K.: Planar and quasi-planar simultaneous geometric embedding. Comput. J. 58(11), 3126\u20133140 (2015)","journal-title":"Comput. J."},{"issue":"7","key":"9_CR30","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."},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Didimo, W.: Upward graph drawing. Encyclopedia of Algorithms, pp. 2308\u20132312. Springer, Berlin (2016)","DOI":"10.1007\/978-1-4939-2864-4_653"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Didimo, W., Liotta, G.: The crossing-angle resolution in graph drawing. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 167\u2013184. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-0110-0_10"},{"issue":"4","key":"9_CR33","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/070696854","volume":"23","author":"W Didimo","year":"2009","unstructured":"Didimo, W., Giordano, F., Liotta, G.: Upward spirality and upward planarity testing. SIAM J. Discret. Math. 23(4), 1842\u20131899 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. In: Dehne, F.K.H.A., Gavrilova, M.L., Sack, J., T\u00f3th, C.D. (eds.) Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, 21\u201323 August 2009. Proceedings. Lecture Notes in Computer Science, vol. 5664, pp. 206\u2013217. Springer (2009)","DOI":"10.1007\/978-3-642-03367-4_19"},{"issue":"16","key":"9_CR35","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)","journal-title":"Inf. Process. Lett."},{"issue":"39","key":"9_CR36","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":"9_CR37","unstructured":"Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. Chic. J. Theor. Comput. Sci. 2011 (2011)"},{"issue":"7\u20138","key":"9_CR38","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. Discret. Appl. Math. 161(7\u20138), 961\u2013969 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"9_CR39","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11(4), 379\u2013403 (1994)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"9_CR40","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(00)00172-4","volume":"103","author":"P Eades","year":"2000","unstructured":"Eades, P., Symvonis, A., Whitesides, S.: Three-dimensional orthogonal graph drawing algorithms. Discret. Appl. Math. 103(1\u20133), 55\u201387 (2000)","journal-title":"Discret. Appl. Math."},{"key":"9_CR41","unstructured":"Erten, C., Kobourov, S.G.: Simultaneous embedding of planar graphs with few bends. J. Graph Algorithms Appl. 9(3), 347\u2013364 (2005). http:\/\/jgaa.info\/accepted\/2005\/ErtenKobourov2005.9.3.pdf"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"Fink, M., Haunert, J., Mchedlidze, T., Spoerhase, J., Wolff, A.: Drawing graphs with vertices at specified positions and crossings at large angles. In: van Kreveld, M.J., Speckmann, B. (eds.) Graph Drawing - 19th International Symposium, GD 2011, Eindhoven, The Netherlands, 21\u201323 September 2011, Revised Selected Papers. Lecture Notes in Computer Science, vol. 7034, pp. 441\u2013442. Springer (2011)","DOI":"10.1007\/978-3-642-25878-7_43"},{"key":"9_CR43","doi-asserted-by":"publisher","unstructured":"Fink, M., Haunert, J., Mchedlidze, T., Spoerhase, J., Wolff, A.: Drawing graphs with vertices at specified positions and crossings at large angles. In: Rahman, M.S., Nakano, S. (eds.) WALCOM: Algorithms and Computation - 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, 15\u201317 February 2012. Proceedings. Lecture Notes in Computer Science, vol. 7157, pp. 186\u2013197. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-28076-4_19","DOI":"10.1007\/978-3-642-28076-4_19"},{"issue":"1","key":"9_CR44","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)","journal-title":"Combinatorica"},{"key":"9_CR45","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"2","key":"9_CR46","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"key":"9_CR47","doi-asserted-by":"crossref","unstructured":"Grilli, L.: On the NP-hardness of GRacSim drawing and $$k$$-SEFE problems. J. Graph Algorithms Appl. 22(1), 101\u2013116 (2018)","DOI":"10.7155\/jgaa.00456"},{"key":"9_CR48","doi-asserted-by":"crossref","unstructured":"Huang, W.: Using eye tracking to investigate graph layout effects. In: APVIS, pp. 97\u2013100 (2007)","DOI":"10.1109\/APVIS.2007.329282"},{"key":"9_CR49","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: PacificVis 2008, pp. 41\u201346 (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"issue":"4","key":"9_CR50","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. Visual Lang. Comput. 25(4), 452\u2013465 (2014)","journal-title":"J. Visual Lang. Comput."},{"issue":"1","key":"9_CR51","doi-asserted-by":"publisher","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: few bends suffice for planar graphs. J. Graph Algorithms Appl. 6(1), 115\u2013129 (2002)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR52","doi-asserted-by":"crossref","unstructured":"van Kreveld, M.J.: The quality ratio of RAC drawings and planar drawings of planar graphs. In: Brandes, U., Cornelsen, S. (eds.) Graph Drawing - 18th International Symposium, GD 2010, Konstanz, Germany, 21\u201324 September 2010. Revised Selected Papers. Lecture Notes in Computer Science, vol. 6502, pp. 371\u2013376. Springer (2010)","DOI":"10.1007\/978-3-642-18469-7_34"},{"key":"9_CR53","unstructured":"Kupitz, Y.S.: Extremal Problems in Combinatorial Geometry. Lecture Notes Series. Matematisk institut, Aarhus universitet (1979)"},{"issue":"3","key":"9_CR54","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"},{"issue":"4","key":"9_CR55","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs Comb. 17(4), 717\u2013728 (2001)","journal-title":"Graphs Comb."},{"issue":"4","key":"9_CR56","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00454-006-1264-9","volume":"36","author":"J Pach","year":"2006","unstructured":"Pach, J., Radoicic, R., Tardos, G., T\u00f3th, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Discret. Comput. Geom. 36(4), 527\u2013552 (2006)","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"9_CR57","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s004539910006","volume":"26","author":"A Papakostas","year":"2000","unstructured":"Papakostas, A., Tollis, I.G.: Efficient orthogonal drawings of high degree graphs. Algorithmica 26(1), 100\u2013125 (2000)","journal-title":"Algorithmica"},{"key":"9_CR58","unstructured":"Roberts, M.J.: Underground Maps Unravelled: Explorations in Information Design. Maxwell J. Roberts (2012). https:\/\/books.google.it\/books?id=khtYMwEACAAJ"},{"issue":"2","key":"9_CR59","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"9_CR60","unstructured":"Vignelli, M.: New York subway map (2008). http:\/\/secondavenuesagas.com\/2008\/05\/02\/mens-vogue-calls-on-vignelli-for-a-long-awaited-update\/"}],"container-title":["Beyond Planar Graphs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-6533-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T10:31:50Z","timestamp":1669026710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-6533-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811565328","9789811565335"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-6533-5_9","relation":{},"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}