{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:30:58Z","timestamp":1770539458057,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":62,"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_11","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:06:26Z","timestamp":1601471186000},"page":"187-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Crossing Layout in Non-planar Graph Drawings"],"prefix":"10.1007","author":[{"given":"Martin","family":"N\u00f6llenburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Alam, M.J., Fink, M., Pupyrev, S.: The bundled crossing number. In: Y.\u00a0Hu, M.\u00a0N\u00f6llenburg (eds.) Graph Drawing (GD\u201916), LNCS, vol. 9801, pp. 399\u2013412. Springer International Publishing (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-50106-2_31","DOI":"10.1007\/978-3-319-50106-2_31"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Kindermann, P., Schneck, T.: 1-fan-bundle-planar drawings of graphs. Theor. Comput. Sci. 723, 23\u201350 (2018). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2018.03.005","DOI":"10.1016\/j.tcs.2018.03.005"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800249.807437","volume":"13","author":"A Appel","year":"1979","unstructured":"Appel, A., Rohlf, F.J., Stein, A.J.: The haloed line effect for hidden line elimination. SIGGRAPH Comput. Graph. 13(2), 151\u2013157 (1979). \nhttps:\/\/doi.org\/10.1145\/800249.807437","journal-title":"SIGGRAPH Comput. Graph."},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Argyriou, E., Cornelsen, S., F\u00f6rster, H., Kaufmann, M., N\u00f6llenburg, M., Okamoto, Y., Raftopoulou, C., Wolff, A.: Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity. In: T.\u00a0Biedl, A.\u00a0Kerren (eds.) Graph Drawing and Network Visualization (GD\u201918), LNCS, vol. 11282, pp. 509\u2013523. Springer International Publishing (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-04414-5_36","DOI":"10.1007\/978-3-030-04414-5_36"},{"key":"11_CR5","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., Baffier, J.F., Chun, J., Eades, P., Eickmeyer, K., Grilli, L., Hong, S.H., Korman, M., Montecchiani, F., Rutter, I., T\u00f3th, C.D.: Gap-planar graphs. Theor. Comput. Sci. 745, 36\u201352 (2018). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2018.05.029","journal-title":"Theor. Comput. Sci."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s004530010075","volume":"29","author":"R Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R., Rawitz, D.: Efficient algorithms for integer programs with two variables per constraint. Algorithmica 29, 595\u2013609 (2001). \nhttps:\/\/doi.org\/10.1007\/s004530010075","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/2945.468391","volume":"1","author":"RA Becker","year":"1995","unstructured":"Becker, R.A., Eick, S.G., Wilks, A.R.: Visualizing network data. IEEE Trans. Vis. Comput. Graph. 1(1), 16\u201328 (1995). \nhttps:\/\/doi.org\/10.1109\/2945.468391","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"5","key":"11_CR8","doi-asserted-by":"publisher","first-page":"575","DOI":"10.7155\/jgaa.00305","volume":"17","author":"MA Bekos","year":"2013","unstructured":"Bekos, M.A., Kaufmann, M., Kobourov, S.G., Symvonis, A.: Smooth orthogonal layouts. J. Graph Algorithms Appl. 17(5), 575\u2013595 (2013). \nhttps:\/\/doi.org\/10.7155\/jgaa.00305","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Kaufmann, M., Krug, R.: Sloggy drawings of graphs. In: Information, Intelligence, Systems and Applications (IISA\u201914) (2014). \nhttps:\/\/doi.org\/10.1109\/IISA.2014.6878764","DOI":"10.1109\/IISA.2014.6878764"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"459","DOI":"10.7155\/jgaa.00332","volume":"18","author":"MA Bekos","year":"2014","unstructured":"Bekos, M.A., Kaufmann, M., Krug, R., Ludwig, T., N\u00e4her, S., Roselli, V.: Slanted orthogonal drawings: model, algorithms and evaluations. J. Graph Algorithms Appl. 18(3), 459\u2013489 (2014). \nhttps:\/\/doi.org\/10.7155\/jgaa.00332","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Kaufmann, M., Krug, R.: Sloginsky drawings of graphs. In: Information, Intelligence, Systems and Applications (IISA\u201915) (2015). \nhttps:\/\/doi.org\/10.1109\/IISA.2015.7388121","DOI":"10.1109\/IISA.2015.7388121"},{"issue":"5","key":"11_CR12","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). \nhttps:\/\/doi.org\/10.1007\/s00453-018-0523-5","journal-title":"Algorithmica"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T Biedl","year":"1998","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. Theory Appl. 9(3), 159\u2013180 (1998). \nhttps:\/\/doi.org\/10.1016\/S0925-7721(97)00026-6","journal-title":"Comput. Geom. Theory Appl."},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Binucci, C., Liotta, G., Montecchiani, F., Tappini, A.: Partial edge drawing: Homogeneity is more important than crossings and ink. In: Information, Intelligence, Systems Applications (IISA\u201916), pp. 1\u20136 (2016). \nhttps:\/\/doi.org\/10.1109\/IISA.2016.7785427","DOI":"10.1109\/IISA.2016.7785427"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Bl\u00e4sius, T., Br\u00fcckner, G., Rutter, I.: Complexity of higher-degree orthogonal graph embedding in the Kandinsky model. In: A.S. Schulz, D.\u00a0Wagner (eds.) Algorithms (ESA\u201914), LNCS, vol. 8737, pp. 161\u2013172. Springer (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44777-2_14","DOI":"10.1007\/978-3-662-44777-2_14"},{"key":"11_CR16","unstructured":"Bruckdorfer, T.: Schematics of graphs and hypergraphs. Ph.D. thesis, Universit\u00e4t T\u00fcbingen (2015)"},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"757","DOI":"10.7155\/jgaa.00438","volume":"21","author":"T Bruckdorfer","year":"2017","unstructured":"Bruckdorfer, T., Cornelsen, S., Gutwenger, C., Kaufmann, M., Montecchiani, F., N\u00f6llenburg, M., Wolff, A.: Progress on partial edge drawings. J. Graph Algorithms Appl. 21(4), 757\u2013786 (2017). \nhttps:\/\/doi.org\/10.7155\/jgaa.00438","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Bruckdorfer, T., Kaufmann, M.: Mad at edge crossings? Break the edges! In: E.\u00a0Kranakis, D.\u00a0Krizanc, F.\u00a0Luccio (eds.) Fun with Algorithms (FUN\u201912), LNCS, vol. 7288, pp. 40\u201350. Springer (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-30347-0_7","DOI":"10.1007\/978-3-642-30347-0_7"},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.7155\/jgaa.00316","volume":"18","author":"T Bruckdorfer","year":"2014","unstructured":"Bruckdorfer, T., Kaufmann, M., Montecchiani, F.: 1-bend orthogonal partial edge drawings. J. Graph Algorithms Appl. 18(1), 111\u2013131 (2014). \nhttps:\/\/doi.org\/10.7155\/jgaa.00316","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Bruckdorfer, T., Kaufmann, M., Lauer, A.: A practical approach for 1\/4-SHPEDs. In: Information, Intelligence, Systems and Applications (IISA\u201915) (2015). \nhttps:\/\/doi.org\/10.1109\/IISA.2015.7387994","DOI":"10.1109\/IISA.2015.7387994"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Bruckdorfer, T., Kaufmann, M., Leib\u00dfle, S.: PED user study. In: E.\u00a0Di\u00a0Giacomo, A.\u00a0Lubiw (eds.) Graph Drawing (GD\u201915), LNCS, vol. 9411, pp. 551\u2013553. Springer International Publishing (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-27261-0_47","DOI":"10.1007\/978-3-319-27261-0_47"},{"key":"11_CR22","unstructured":"Buchheim, C., Chimani, M., Gutwenger, C., J\u00fcnger, M., Mutzel, P.: Crossings and planarization. In: R.\u00a0Tamassia (ed.) Handbook of Graph Drawing and Visualization, chap.\u00a02, pp. 43\u201385. CRC Press (2013)"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Burch, M., Vehlow, C., Konevtsova, N., Weiskopf, D.: Evaluating partially drawn links for directed graph edges. In: M.\u00a0van Kreveld, B.\u00a0Speckmann (eds.) Graph Drawing (GD\u201911), LNCS, vol. 7034, pp. 226\u2013237. Springer (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25878-7_22","DOI":"10.1007\/978-3-642-25878-7_22"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Chaplick, S., van Dijk, T.C., Kryven, M., Park, J., Ravsky, A., Wolff, A.: Bundled crossings revisited. In: D.\u00a0Archambault, C.D. T\u00f3th (eds.) Graph Drawing and Network Visualization (GD\u201919), LNCS, vol. 11904, pp. 63\u201377. Springer (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-35802-0_5","DOI":"10.1007\/978-3-030-35802-0_5"},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Burlingham, L.S.: Complement reducible graphs. Discrete Appl. Math. 3(3), 163\u2013174 (1981). \nhttps:\/\/doi.org\/10.1016\/0166-218X(81)90013-5","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"11_CR26","doi-asserted-by":"publisher","first-page":"31","DOI":"10.7155\/jgaa.00099","volume":"9","author":"M Dickerson","year":"2005","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: visualizing non-planar diagrams in a planar way. J. Graph Algorithms Appl. 9(1), 31\u201352 (2005). \nhttps:\/\/doi.org\/10.7155\/jgaa.00099","journal-title":"J. Graph Algorithms Appl."},{"issue":"39","key":"11_CR27","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). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2011.05.025","journal-title":"Theor. Comput. Sci."},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Dujmovi, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. Chicago J. Theor. Comput. Sci. 4, 1\u201314 (2011). \nhttps:\/\/doi.org\/10.4086\/cjtcs.2011.004","DOI":"10.4086\/cjtcs.2011.004"},{"key":"11_CR29","unstructured":"Duncan, C.A., Goodrich, M.T.: Planar orthogonal and polyline drawing algorithms. In: R.\u00a0Tamassia (ed.) Handbook of Graph Drawing and Visualization, chap.\u00a07, pp. 223\u2013246. CRC Press (2013)"},{"key":"11_CR30","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, 379\u2013403 (1994). \nhttps:\/\/doi.org\/10.1007\/BF01187020","journal-title":"Algorithmica"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Eppstein, D., Goodrich, M.T., Meng, J.Y.: Delta-confluent drawings. In: P.\u00a0Healy, N.\u00a0Nikolov (eds.) Graph Drawing (GD\u201905), LNCS, vol. 3843, pp. 165\u2013176. Springer (2006). \nhttps:\/\/doi.org\/10.1007\/11618058_16","DOI":"10.1007\/11618058_16"},{"key":"11_CR32","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00453-006-0159-8","volume":"47","author":"D Eppstein","year":"2007","unstructured":"Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent layered drawings. Algorithmica 47, 439\u2013452 (2007). \nhttps:\/\/doi.org\/10.1007\/s00453-006-0159-8","journal-title":"Algorithmica"},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1016\/j.comgeo.2008.05.005","volume":"42","author":"D Eppstein","year":"2009","unstructured":"Eppstein, D., van Kreveld, M., Mumford, E., Speckmann, B.: Edges and switches, tunnels and bridges. Comput. Geom. Theory Appl. 42, 790\u2013802 (2009). \nhttps:\/\/doi.org\/10.1016\/j.comgeo.2008.05.005","journal-title":"Comput. Geom. Theory Appl."},{"issue":"7","key":"11_CR34","doi-asserted-by":"publisher","first-page":"689","DOI":"10.7155\/jgaa.00312","volume":"17","author":"D Eppstein","year":"2013","unstructured":"Eppstein, D., Simons, J.A.: Confluent Hasse diagrams. J. Graph Algorithms Appl. 17(7), 689\u2013710 (2013). \nhttps:\/\/doi.org\/10.7155\/jgaa.00312","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR35","doi-asserted-by":"publisher","unstructured":"Eppstein, D., Holten, D., L\u00f6ffler, M., N\u00f6llenburg, M., Speckmann, B., Verbeek, K.: Strict confluent drawing. J. Comput. Geom. 7(1), 22\u201346 (2016). \nhttps:\/\/doi.org\/10.20382\/jocg.v7i1a2","DOI":"10.20382\/jocg.v7i1a2"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Fink, M., Hershberger, J., Suri, S., Verbeek, K.: Bundled crossings in embedded graphs. In: E.\u00a0Kranakis, G.\u00a0Navarro, E.\u00a0Ch\u00e1vez (eds.) Theoretical Informatics (LATIN\u201916), LNCS, vol. 9644, pp. 454\u2013468. Springer Berlin Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49529-2_34","DOI":"10.1007\/978-3-662-49529-2_34"},{"key":"11_CR37","doi-asserted-by":"publisher","unstructured":"F\u00f6rster, H., Ganian, R., Klute, F., N\u00f6llenburg, M.: On strict (outer-)confluent graphs. In: D.\u00a0Archambault, C.D. T\u00f3th (eds.) Graph Drawing and Network Visualization (GD\u201919), LNCS, vol. 11904, pp. 147\u2013161. Springer (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-35802-0_12","DOI":"10.1007\/978-3-030-35802-0_12"},{"key":"11_CR38","doi-asserted-by":"publisher","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: F.J. Brandenburg (ed.) Graph Drawing (GD\u201995), LNCS, vol. 1027, pp. 254\u2013266. Springer (1996). \nhttps:\/\/doi.org\/10.1007\/BFb0021809","DOI":"10.1007\/BFb0021809"},{"key":"11_CR39","doi-asserted-by":"publisher","unstructured":"Gansner, E.R., Koren, Y.: Improved circular layouts. In: M.\u00a0Kaufmann, D.\u00a0Wagner (eds.) Graph Drawing (GD\u201906), LNCS, vol. 4372, pp. 386\u2013398. Springer Berlin Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/978-3-540-70904-6_37","DOI":"10.1007\/978-3-540-70904-6_37"},{"key":"11_CR40","doi-asserted-by":"publisher","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. on Algebraic and Discrete Methods 4(3), 312\u2013316 (1983). \nhttps:\/\/doi.org\/10.1137\/0604033","DOI":"10.1137\/0604033"},{"key":"11_CR41","doi-asserted-by":"publisher","unstructured":"Hachul, S., J\u00fcnger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: J.\u00a0Pach (ed.) Graph Drawing (GD\u201904), LNCS, vol. 3383, pp. 285\u2013295. Springer (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-31843-9_29","DOI":"10.1007\/978-3-540-31843-9_29"},{"key":"11_CR42","unstructured":"Healy, P., Nikolov, N.S.: Hierarchical drawing algorithms. In: R.\u00a0Tamassia (ed.) Handbook of Graph Drawing and Visualization, chap.\u00a013, pp. 409\u2013454. CRC Press (2014)"},{"key":"11_CR43","doi-asserted-by":"publisher","unstructured":"Hirsch, M., Meijer, H., Rappaport, D.: Biclique edge cover graphs and confluent drawings. In: Graph Drawing (GD\u201906), LNCS, vol. 4372, pp. 405\u2013416. Springer (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-70904-6_39","DOI":"10.1007\/978-3-540-70904-6_39"},{"key":"11_CR44","doi-asserted-by":"publisher","unstructured":"Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: Pacific Visualization Symposium (PacificVis\u201908), pp. 41\u201346. IEEE (2008). \nhttps:\/\/doi.org\/10.1109\/PACIFICVIS.2008.4475457","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"11_CR45","doi-asserted-by":"publisher","unstructured":"Huang, W., Eades, P., Hong, S.H.: A graph reading behavior: Geodesic-path tendency. In: Pacific Visualization Symposium (PacificVis\u201909), pp. 137\u2013144. IEEE (2009). \nhttps:\/\/doi.org\/10.1109\/PACIFICVIS.2009.4906848","DOI":"10.1109\/PACIFICVIS.2009.4906848"},{"key":"11_CR46","doi-asserted-by":"publisher","unstructured":"Hui, P., Pelsmajer, M.J., Schaefer, M., \u0161tefankovi\u010d, D.: Train tracks and confluent drawings. Algorithmica 47, 465\u2013479 (2007). \nhttps:\/\/doi.org\/10.1007\/s00453-006-0165-x","DOI":"10.1007\/s00453-006-0165-x"},{"key":"11_CR47","doi-asserted-by":"publisher","unstructured":"Hummel, M., Klute, F., Nickel, S., N\u00f6llenburg, M.: Maximizing ink in partial edge drawings of k-plane graphs. In: D.\u00a0Archambault, C.D. T\u00f3th (eds.) Graph Drawing and Network Visualization (GD\u201919), LNCS, vol. 11904, pp. 323\u2013336. Springer (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-35802-0_25","DOI":"10.1007\/978-3-030-35802-0_25"},{"key":"11_CR48","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR abs\/1403.6184 (2014). \nhttp:\/\/arxiv.org\/abs\/1403.6184"},{"issue":"1","key":"11_CR49","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/TVCG.2015.2467451","volume":"22","author":"S Kieffer","year":"2016","unstructured":"Kieffer, S., Dwyer, T., Marriott, K., Wybrow, M.: HOLA: human-like orthogonal network layout. IEEE Trans. Vis. Comput. Graph. 22(1), 349\u2013358 (2016). \nhttps:\/\/doi.org\/10.1109\/TVCG.2015.2467451","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"11_CR50","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1111\/cgf.13213","volume":"36","author":"A Lhuillier","year":"2017","unstructured":"Lhuillier, A., Hurter, C., Telea, A.: State of the art in edge and trail bundling techniques. Comput. Graph. Forum 36(3), 619\u2013645 (2017). \nhttps:\/\/doi.org\/10.1111\/cgf.13213","journal-title":"Comput. Graph. Forum"},{"key":"11_CR51","doi-asserted-by":"publisher","unstructured":"Nguyen, Q., Eades, P., Hong, S.H.: On the faithfulness of graph visualizations. In: Pacific Visualization Symposium (PacificVis\u201913), pp. 209\u2013216. IEEE (2013). \nhttps:\/\/doi.org\/10.1109\/PacificVis.2013.6596147","DOI":"10.1109\/PacificVis.2013.6596147"},{"key":"11_CR52","doi-asserted-by":"crossref","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. Lecture Notes Series on Computing, vol. 12. World Scientific (2004)","DOI":"10.1142\/5648"},{"key":"11_CR53","doi-asserted-by":"publisher","unstructured":"Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: Graph Drawing (GD\u201997), LNCS, vol. 1353, pp. 248\u2013261. Springer (1997). \nhttps:\/\/doi.org\/10.1007\/3-540-63938-1_67","DOI":"10.1007\/3-540-63938-1_67"},{"key":"11_CR54","doi-asserted-by":"publisher","unstructured":"Purchase, H.C., Cohen, R.F., James, M.: Validating graph drawing aesthetics. In: F.J. Brandenburg (ed.) Graph Drawing (GD\u201995), LNCS, vol. 1027, pp. 435\u2013446. Springer (1996). \nhttps:\/\/doi.org\/10.1007\/BFb0021827","DOI":"10.1007\/BFb0021827"},{"issue":"1","key":"11_CR55","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TVCG.2010.269","volume":"18","author":"HC Purchase","year":"2012","unstructured":"Purchase, H.C., Pilcher, C., Plimmer, B.: Graph drawing aesthetics created by users, not algorithms. IEEE Trans. Vis. Comput. Graph. 18(1), 81\u201392 (2012). \nhttps:\/\/doi.org\/10.1109\/TVCG.2010.269","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"11_CR56","doi-asserted-by":"publisher","unstructured":"Rusu, A., Fabian, A.J., Jianu, R., Rusu, A.: Using the gestalt principle of closure to alleviate the edge crossing problem in graph drawings. In: Proceedings of 15th International Conference on Information Visualisation (IV\u201911), pp. 488\u2013493. IEEE (2011). \nhttps:\/\/doi.org\/10.1109\/IV.2011.63","DOI":"10.1109\/IV.2011.63"},{"issue":"3","key":"11_CR57","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"J Spinrad","year":"1987","unstructured":"Spinrad, J., Brandst\u00e4dt, A., Stewart, L.: Bipartite permutation graphs. Discrete Appl. Math. 18(3), 279\u2013292 (1987). \nhttps:\/\/doi.org\/10.1016\/S0166-218X(87)80003-3","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"11_CR58","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). \nhttps:\/\/doi.org\/10.1109\/TSMC.1981.4308636","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"11_CR59","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421\u2013444 (1987). \nhttps:\/\/doi.org\/10.1137\/0216030","journal-title":"SIAM J. Comput."},{"issue":"4","key":"11_CR60","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/0196-6774(89)90006-0","volume":"10","author":"C Thomassen","year":"1989","unstructured":"Thomassen, C.: The graph genus problem is NP-complete. J. Algorithms 10(4), 568\u2013576 (1989). \nhttps:\/\/doi.org\/10.1016\/0196-6774(89)90006-0","journal-title":"J. Algorithms"},{"key":"11_CR61","unstructured":"Vismara, L.: Planar straight-line drawing algorithms. In: R.\u00a0Tamassia (ed.) Handbook of Graph Drawing and Visualization, chap.\u00a06, pp. 193\u2013222. CRC Press (2013)"},{"key":"11_CR62","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., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Inf. Vis. 1, 103\u2013110 (2002). \nhttps:\/\/doi.org\/10.1057\/palgrave.ivs.9500013","journal-title":"Inf. Vis."}],"container-title":["Beyond Planar Graphs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-6533-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:42:15Z","timestamp":1601473335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-6533-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811565328","9789811565335"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-6533-5_11","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"}}]}}