{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:02:13Z","timestamp":1743004933264,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_5","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"63-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Bundled Crossings Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3501-4608","authenticated-orcid":false,"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6553-7317","authenticated-orcid":false,"given":"Thomas C.","family":"van Dijk","sequence":"additional","affiliation":[]},{"given":"Myroslav","family":"Kryven","sequence":"additional","affiliation":[]},{"given":"Ji-won","family":"Park","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Ravsky","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-319-50106-2_31","volume-title":"Graph Drawing and Network Visualization","author":"MJ Alam","year":"2016","unstructured":"Alam, M.J., Fink, M., Pupyrev, S.: The bundled crossing number. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 399\u2013412. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_31. http:\/\/arxiv.org\/abs\/1608.08161"},{"key":"5_CR2","unstructured":"Arroyo, A., Bensmail, J., Richter, R.B.: Extending drawings of graphs to arrangements of pseudolines. ArXiv report (2018). https:\/\/arxiv.org\/abs\/1804.09317"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"577","DOI":"10.7155\/jgaa.00479","volume":"22","author":"MJ Bannister","year":"2018","unstructured":"Bannister, M.J., Eppstein, D.: Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth. J. Graph Algorithms Appl. 22(4), 577\u2013606 (2018). https:\/\/doi.org\/10.7155\/jgaa.00479","journal-title":"J. Graph Algorithms Appl."},{"issue":"6","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996). https:\/\/doi.org\/10.1137\/S0097539793251219","journal-title":"SIAM J. Comput."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Chaplick, S., van Dijk, T.C., Kryven, M., won Park, J., Ravsky, A., Wolff, A.: Bundled crossings revisited. ArXiv report (2019). https:\/\/arxiv.org\/abs\/1812.04263","DOI":"10.1007\/978-3-030-35802-0_5"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-319-73915-1_42","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2018","unstructured":"Chaplick, S., Kryven, M., Liotta, G., L\u00f6ffler, A., Wolff, A.: Beyond outerplanarity. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 546\u2013559. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_42"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Inform. Comput. 85(1), 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","journal-title":"Inform. Comput."},{"key":"5_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge Univ Press, Cambridge (2012)"},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1109\/TVCG.2008.135","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. IEEE Trans. Vis. Comput. Graph. 14(6), 1277\u20131284 (2008). https:\/\/doi.org\/10.1109\/TVCG.2008.135","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"5_CR10","unstructured":"de Verdi\u00e8re, \u00c9.C.: Computational topology of graphs on surfaces. In: T\u00f3th, C.D., O\u2019Rourke, J., Goodman, J.E. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn., chap. 23. CRC Press LLC, Boca Raton (2017)"},{"issue":"5","key":"5_CR11","doi-asserted-by":"publisher","first-page":"873","DOI":"10.7155\/jgaa.00443","volume":"21","author":"TC van Dijk","year":"2017","unstructured":"van Dijk, T.C., Fink, M., Fischer, N., Lipp, F., Markfelder, P., Ravsky, A., Suri, S., Wolff, A.: Block crossings in storyline visualizations. J. Graph Algorithms Appl. 21(5), 873\u2013913 (2017). https:\/\/doi.org\/10.7155\/jgaa.00443","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Felsner, S.: On the number of arrangements of pseudolines. In: SoCG, pp. 30\u201337. ACM (1996). https:\/\/doi.org\/10.1145\/237218.237232","DOI":"10.1145\/237218.237232"},{"key":"5_CR13","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). https:\/\/doi.org\/10.1007\/978-3-662-49529-2_34"},{"issue":"1","key":"5_CR14","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). https:\/\/doi.org\/10.7155\/jgaa.00351","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Gansner, E.R., Hu, Y., North, S., Scheidegger, C.: Multilevel agglomerative edge bundling for visualizing large graphs. In: Battista, G.D., Fekete, J.D., Qu, H. (eds.) PACIFICVIS, pp. 187\u2013194. IEEE (2011). https:\/\/doi.org\/10.1109\/PACIFICVIS.2011.5742389","DOI":"10.1109\/PACIFICVIS.2011.5742389"},{"issue":"5","key":"5_CR16","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). https:\/\/doi.org\/10.1109\/TVCG.2006.147","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"8","key":"5_CR17","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1109\/TVCG.2013.246","volume":"20","author":"C Hurter","year":"2014","unstructured":"Hurter, C., Ersoy, O., Fabrikant, S.I., Klein, T.R., Telea, A.C.: Bundled visualization of dynamicgraph and trail data. IEEE Trans. Vis. Comput. Graph. 20(8), 1141\u20131157 (2014). https:\/\/doi.org\/10.1109\/TVCG.2013.246","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1111\/j.1467-8659.2012.03079.x","volume":"31","author":"C Hurter","year":"2012","unstructured":"Hurter, C., Ersoy, O., Telea, A.: Graph bundling by kernel density estimation. Comput. Graph. Forum 31, 865\u2013874 (2012). https:\/\/doi.org\/10.1111\/j.1467-8659.2012.03079.x","journal-title":"Comput. Graph. Forum"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Kawarabayashi, K., Mohar, B., Reed, B.A.: A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width. In: FOCS, pp. 771\u2013780. IEEE (2008). https:\/\/doi.org\/10.1109\/FOCS.2008.53","DOI":"10.1109\/FOCS.2008.53"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Kawarabayashi, K., Reed, B.: Computing crossing number in linear time. In: STOC, pp. 382\u2013390. ACM (2007). https:\/\/doi.org\/10.1145\/1250790.1250848","DOI":"10.1145\/1250790.1250848"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Lazarus, F., Pocchiola, M., Vegter, G., Verroust, A.: Computing a canonical polygonal schema of an orientable triangulated surface. In: SoCG, pp. 80\u201389. ACM (2001). https:\/\/doi.org\/10.1145\/378583.378630","DOI":"10.1145\/378583.378630"},{"issue":"5","key":"5_CR22","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"SL Mitchell","year":"1979","unstructured":"Mitchell, S.L.: Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inform. Process. Lett. 9(5), 229\u2013232 (1979). https:\/\/doi.org\/10.1016\/0020-0190(79)90075-9","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1137\/S089548019529248X","volume":"12","author":"B Mohar","year":"1999","unstructured":"Mohar, B.: A linear time algorithm for embedding graphs in an arbitrary surface. SIAM J. Disc. Math. 12(1), 6\u201326 (1999)","journal-title":"SIAM J. Disc. Math."},{"key":"5_CR24","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. Theory Appl. 52, 18\u201333 (2016). https:\/\/doi.org\/10.1016\/j.comgeo.2015.10.005","journal-title":"Comput. Geom. Theory Appl."},{"key":"5_CR25","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electr. J. Combin. Dynamic Survey DS21 (2017). http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/DS21"},{"issue":"4","key":"5_CR26","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). https:\/\/doi.org\/10.1016\/0196-6774(89)90006-0","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35802-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:02:42Z","timestamp":1701133362000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12.55","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}