{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:57:37Z","timestamp":1770541057972,"version":"3.49.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319501055","type":"print"},{"value":"9783319501062","type":"electronic"}],"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_31","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"399-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Bundled Crossing Number"],"prefix":"10.1007","author":[{"given":"Md. Jawaherul","family":"Alam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Fink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00454-013-9493-1","volume":"49","author":"E Ackerman","year":"2013","unstructured":"Ackerman, E., Pinchasi, R.: On the degenerate crossing number. Discret. Comput. Geom. 49(3), 695\u2013702 (2013)","journal-title":"Discret. Comput. Geom."},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0304-0208(08)73484-4","volume":"60","author":"M Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M.M., Szemer\u00e9di, E.: Crossing-free subgraphs. N.-Holl. Math. Stud. 60, 9\u201312 (1982)","journal-title":"N.-Holl. Math. Stud."},{"key":"31_CR3","first-page":"399","volume-title":"Lecture Notes in Computer Science","author":"Md. Jawaherul Alam","year":"2016","unstructured":"Alam, M.J., Fink, M., Pupyrev, S.: The bundled crossing number. CoRR, cs.CG\/1608.08161 (2016)"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-30559-0_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Baur","year":"2004","unstructured":"Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 332\u2013343. Springer, Heidelberg (2004). doi:\n                      10.1007\/978-3-540-30559-0_28"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Bouts, Q.W., Speckmann, B.: Clustered edge routing. In: PacificVis 2015, pp. 55\u201362 (2015)","DOI":"10.1109\/PACIFICVIS.2015.7156356"},{"key":"31_CR6","unstructured":"Buchheim, C., Chimani, M., Gutwenger, C., J\u00fcnger, M., Mutzel, P.: Crossings and planarization. In: Handbook of Graph Drawing and Visualization. CRC Press (2013)"},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/s00454-012-9440-6","volume":"49","author":"S Cabello","year":"2013","unstructured":"Cabello, S.: Hardness of approximation for crossing number. Discret. Comput. Geom. 49(2), 348\u2013358 (2013)","journal-title":"Discret. Comput. Geom."},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J.: An algorithm for the graph crossing number problem. In: STOC 2011, pp. 303\u2013312 (2011)","DOI":"10.1145\/1993636.1993678"},{"issue":"6","key":"31_CR9","first-page":"1277","volume":"14","author":"W Cui","year":"2008","unstructured":"Cui, W., Zhou, H., Qu, H., Wong, P.C., Li, X.: Geometry-based edge clustering for graph visualization. TVCG 14(6), 1277\u20131284 (2008)","journal-title":"TVCG"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-24595-7_7","volume-title":"Graph Drawing","author":"H Fraysseix","year":"2004","unstructured":"Fraysseix, H., Mendez, P.O.: Stretching of Jordan arc contact systems. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 71\u201385. Springer, Heidelberg (2004). doi:\n                      10.1007\/978-3-540-24595-7_7"},{"issue":"1","key":"31_CR11","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. JGAA 9(1), 31\u201352 (2005)","journal-title":"JGAA"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-319-03841-4_31","volume-title":"Graph Drawing","author":"D Eppstein","year":"2013","unstructured":"Eppstein, D., Holten, D., L\u00f6ffler, M., N\u00f6llenburg, M., Speckmann, B., Verbeek, K.: Strict confluent drawing. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 352\u2013363. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-319-03841-4_31"},{"issue":"12","key":"31_CR13","first-page":"2364","volume":"17","author":"O Ersoy","year":"2011","unstructured":"Ersoy, O., Hurter, C., Paulovich, F.V., Cantareiro, G., Telea, A.: Skeleton-based edge bundling for graph visualization. TVCG 17(12), 2364\u20132373 (2011)","journal-title":"TVCG"},{"issue":"3","key":"31_CR14","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s00454-011-9366-4","volume":"46","author":"S Felsner","year":"2011","unstructured":"Felsner, S., Valtr, P.: Coding and counting arrangements of pseudolines. Discret. Comput. Geom. 46(3), 405\u2013416 (2011)","journal-title":"Discret. Comput. Geom."},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-662-49529-2_34","volume-title":"LATIN 2016: Theoretical Informatics","author":"M Fink","year":"2016","unstructured":"Fink, M., Hershberger, J., Suri, S., Verbeek, K.: Bundled crossings in embedded graphs. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 454\u2013468. Springer, Heidelberg (2016). doi:\n                      10.1007\/978-3-662-49529-2_34"},{"issue":"1","key":"31_CR16","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. JGAA 19(1), 111\u2013153 (2015)","journal-title":"JGAA"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Gansner, E. Hu, Y., North, S., Scheidegger, C.: Multilevel agglomerative edge bundling for visualizing large graphs. In: PacificVis 2011, pp. 187\u2013194. IEEE (2011)","DOI":"10.1109\/PACIFICVIS.2011.5742389"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70904-6_37","volume-title":"Graph Drawing","author":"ER Gansner","year":"2007","unstructured":"Gansner, E.R., Koren, Y.: Improved circular layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 386\u2013398. Springer, Heidelberg (2007). doi:\n                      10.1007\/978-3-540-70904-6_37"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.jda.2014.11.006","volume":"30","author":"F Giordano","year":"2015","unstructured":"Giordano, F., Liotta, G., Mchedlidze, T., Symvonis, A., Whitesides, S.: Computing upward topological book embeddings of upward planar digraphs. J. Discret. Algorithms 30, 45\u201369 (2015)","journal-title":"J. Discret. Algorithms"},{"issue":"5","key":"31_CR20","first-page":"741","volume":"12","author":"D Holten","year":"2006","unstructured":"Holten, D.: Hierarchical edge bundles: visualization of adjacency relations in hierarchical data. TVCG 12(5), 741\u2013748 (2006)","journal-title":"TVCG"},{"issue":"3","key":"31_CR21","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)","journal-title":"Comput. Graph. Forum"},{"issue":"3","key":"31_CR22","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1111\/j.1467-8659.2009.01700.x","volume":"29","author":"A Lambert","year":"2010","unstructured":"Lambert, A., Bourqui, R., Auber, D.: Winding roads: routing edges into bundles. Comput. Graph. Forum 29(3), 853\u2013862 (2010)","journal-title":"Comput. Graph. Forum"},{"key":"31_CR23","doi-asserted-by":"crossref","unstructured":"Lazarus, F., Pocchiola, M., Vegter, G., Verroust, A.: Computing a canonical polygonal schema of an orientable triangulated surface. In: SoCG 2001, pp. 80\u201389. ACM (2001)","DOI":"10.1145\/378583.378630"},{"issue":"2","key":"31_CR24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.26493\/1855-3974.21.157","volume":"2","author":"B Mohar","year":"2009","unstructured":"Mohar, B.: The genus crossing number. ARS Math. Contempo. 2(2), 157\u2013162 (2009)","journal-title":"ARS Math. Contempo."},{"issue":"3","key":"31_CR25","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/s00454-009-9141-y","volume":"41","author":"J Pach","year":"2009","unstructured":"Pach, J., T\u00f3th, G.: Degenerate crossing numbers. Discret. Comput. Geom. 41(3), 376\u2013384 (2009)","journal-title":"Discret. Comput. Geom."},{"key":"31_CR26","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.comgeo.2015.10.005","volume":"52","author":"S Pupyrev","year":"2016","unstructured":"Pupyrev, S., Nachmanson, L., Bereg, S., Holroyd, A.E.: Edge routing with ordered bundles. Comput. Geom. 52, 18\u201333 (2016)","journal-title":"Comput. Geom."},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Comb. Dyn. Surv. 21 (2013)","DOI":"10.37236\/2713"},{"key":"31_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-319-27261-0_6","volume-title":"Graph Drawing and Network Visualization","author":"M Schaefer","year":"2015","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: The degenerate crossing number and higher-genus embeddings. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 63\u201374. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-27261-0_6"},{"key":"31_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-59071-4_53","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F Shahrokhi","year":"1995","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt\u2019o, I.: Book embeddings and crossing numbers. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903, pp. 256\u2013268. Springer, Heidelberg (1995). doi:\n                      10.1007\/3-540-59071-4_53"},{"issue":"4","key":"31_CR30","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)","journal-title":"J. Algorithms"},{"issue":"16\u201318","key":"31_CR31","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.1016\/j.tcs.2010.01.002","volume":"411","author":"K Yamanaka","year":"2010","unstructured":"Yamanaka, K., Nakano, S., Matsui, Y., Uehara, R., Nakada, K.: Efficient enumeration of all ladder lotteries and its application. Theor. Comput. Sci. 411(16\u201318), 1714\u20131722 (2010)","journal-title":"Theor. Comput. Sci."}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:43:03Z","timestamp":1600476183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}]}}