{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T05:09:23Z","timestamp":1770527363362,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662495285","type":"print"},{"value":"9783662495292","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_34","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T04:09:41Z","timestamp":1458533381000},"page":"454-468","source":"Crossref","is-referenced-by-count":7,"title":["Bundled Crossings in Embedded Graphs"],"prefix":"10.1007","author":[{"given":"Martin","family":"Fink","sequence":"first","affiliation":[]},{"given":"John","family":"Hershberger","sequence":"additional","affiliation":[]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Verbeek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"issue":"4","key":"34_CR1","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864\u2013894 (1994). \n                    http:\/\/dx.doi.org\/10.1137\/S0097539792225297","journal-title":"SIAM J. Comput."},{"issue":"8","key":"34_CR2","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.J., Mumford, E., Speckmann, B.: Edges and switches, tunnels and bridges. Comput. Geom. 42(8), 790\u2013802 (2009). \n                    http:\/\/dx.doi.org\/10.1016\/j.comgeo.2008.05.005","journal-title":"Comput. Geom."},{"issue":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.7155\/jgaa.00351","volume":"19","author":"M Fink","year":"2015","unstructured":"Fink, M., Pupyrev, S., Wolff, A.: Ordering metro lines by block crossings. J. Graph Algorithms Appl. 19(1), 111\u2013153 (2015). \n                    http:\/\/dx.doi.org\/10.7155\/jgaa.00351","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"34_CR4","doi-asserted-by":"publisher","first-page":"561","DOI":"10.2307\/2045427","volume":"92","author":"Z F\u00fcredi","year":"1984","unstructured":"F\u00fcredi, Z., Pal\u00e1sti, I.: Arrangements of lines with a large number of triangles. Proc. Am. Math. Soc. 92(4), 561\u2013566 (1984). \n                    http:\/\/dx.doi.org\/10.1090\/S0002-9939-1984-0760946-2","journal-title":"Proc. Am. Math. Soc."},{"issue":"3","key":"34_CR5","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4(3), 312\u2013316 (1983). \n                    http:\/\/epubs.siam.org\/doi\/abs\/10.1137\/0604033","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"5","key":"34_CR6","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TVCG.2006.147","volume":"12","author":"D Holten","year":"2006","unstructured":"Holten, D.: Hierarchical edge bundles: visualization of adjacency relations in hierarchical data. IEEE Trans. Vis. Comput. Graph. 12(5), 741\u2013748 (2006). \n                    http:\/\/doi.ieeecomputersociety.org\/10.1109\/TVCG.2006.147","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"34_CR7","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1111\/j.1467-8659.2009.01450.x","volume":"28","author":"D Holten","year":"2009","unstructured":"Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. Comput. Graph. Forum 28(3), 983\u2013990 (2009). \n                    http:\/\/dx.doi.org\/10.1111\/j.1467-8659.2009.01450.x","journal-title":"Comput. Graph. Forum"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-662-45803-7_8","volume-title":"Graph Drawing","author":"Y Hu","year":"2014","unstructured":"Hu, Y., Shi, L.: A coloring algorithm for disambiguating graph and map drawings. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 89\u2013100. Springer, Heidelberg (2014). \n                    http:\/\/dx.doi.org\/10.1007\/978-3-662-45803-7_8"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: Proceedings of 7th International IEEE Asia-Pacific Symposium Information Visualisation (PacificVIS 2008), pp. 41\u201346 (2008). \n                    http:\/\/dx.doi.org\/10.1109\/PACIFICVIS.2008.4475457","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"34_CR10","first-page":"1","volume":"21","author":"M Schaefer","year":"2013","unstructured":"Schaefer, M.: The graph crossing number and its variants: asurvey. Electron. J. Comb. Dyn. Surv. 21, 1\u2013100 (2013). \n                    http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/DS21","journal-title":"Electron. J. Comb. Dyn. Surv."},{"issue":"1","key":"34_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02189307","volume":"9","author":"V Soltan","year":"1993","unstructured":"Soltan, V., Gorpinevich, A.: Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles. Discrete Comp. Geom. 9(1), 57\u201379 (1993). \n                    http:\/\/dx.doi.org\/10.1007\/BF02189307","journal-title":"Discrete Comp. Geom."}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T16:34:05Z","timestamp":1559406845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}