{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T03:51:53Z","timestamp":1782964313024,"version":"3.54.5"},"publisher-location":"Cham","reference-count":35,"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_29","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"367-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Crossing Minimization in Storyline Visualization"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gronemann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frauke","family":"Liers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Mambelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.12.019","volume":"571","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Roselli, V.: The importance of being proper: (in clustered-level planarity and $$T$$-level planarity). Theoret. Comput. Sci. 571, 1\u20139 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F Barahona","year":"1989","unstructured":"Barahona, F., J\u00fcnger, M., Reinelt, G.: Experiments in quadratic 0\u20131 programming. Math. Program. 44, 127\u2013137 (1989)","journal-title":"Math. Program."},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F Barahona","year":"1986","unstructured":"Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Program. 36(2), 157\u2013173 (1986)","journal-title":"Math. Program."},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-13193-6_11","volume-title":"Experimental Algorithms","author":"F Baumann","year":"2010","unstructured":"Baumann, F., Buchheim, C., Liers, F.: Exact bipartite crossing minimization under tree constraints. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 118\u2013128. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13193-6_11"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-540-77537-9_24","volume-title":"Graph Drawing","author":"MA Bekos","year":"2008","unstructured":"Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Line crossing minimization on metro maps. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 231\u2013242. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-77537-9_24"},{"issue":"1","key":"29_CR6","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1287\/ijoc.1090.0318","volume":"22","author":"C Buchheim","year":"2010","unstructured":"Buchheim, C., Wiegele, A., Zheng, L.: Exact algorithms for the quadratic linear ordering problem. INFORMS J. Comput. 22(1), 168\u2013177 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s00453-010-9456-3","volume":"62","author":"K Buchin","year":"2012","unstructured":"Buchin, K., Buchin, M., Byrka, J., N\u00f6llenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (Complete) binary tanglegrams. Algorithmica 62(1), 309\u2013332 (2012)","journal-title":"Algorithmica"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Chimani, M., Hungerl\u00e4nder, P., J\u00fcnger, M., Mutzel, P.: An SDP approach to multi-level crossing minimization. In: M\u00fcller-Hannemann, M., Werneck, R. (eds.) Proceedings of the 13th Workshop on Algorithm Engineering and Experiments, ALENEX 2011, pp. 116\u2013126. Society for Industrial and Applied Mathematics (2011)","DOI":"10.1137\/1.9781611972917.12"},{"issue":"12","key":"29_CR9","doi-asserted-by":"publisher","first-page":"2412","DOI":"10.1109\/TVCG.2011.239","volume":"17","author":"W Cui","year":"2011","unstructured":"Cui, W., Liu, S., Tan, L., Shi, C., Song, Y., Gao, Z.J., Tong, X., Qu, H.: TextFlow: towards better understanding of evolving topics in text. IEEE Trans. Vis. Comput. Graph. 17(12), 2412\u20132421 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"C De Simone","year":"1990","unstructured":"De Simone, C.: The cut polytope and the Boolean quadric polytope. Discrete Math. 79(1), 71\u201375 (1990)","journal-title":"Discrete Math."},{"issue":"7","key":"29_CR11","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.jcss.2009.10.014","volume":"76","author":"H Fernau","year":"2010","unstructured":"Fernau, H., Kaufmann, M., Poths, M.: Comparing trees via crossing minimization. J. Comput. Syst. Sci. 76(7), 593\u2013608 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-319-03841-4_29","volume-title":"Graph Drawing","author":"M Fink","year":"2013","unstructured":"Fink, M., Pupyrev, S.: Metro-line crossing minimization: hardness, approximations, and tractable cases. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 328\u2013339. Springer, Heidelberg (2013). doi: 10.1007\/978-3-319-03841-4_29"},{"issue":"3","key":"29_CR13","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. Algebr. Discrete Methods 4(3), 312\u2013316 (1983)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: Facets of the linear ordering polytope. Math. Program. 33(1), 43\u201360 (1985)","journal-title":"Math. Program."},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/opre.13.3.388","volume":"13","author":"P Hammer","year":"1965","unstructured":"Hammer, P.: Some network flow problems solved with pseudo-Boolean programming. Oper. Res. 13, 388\u2013399 (1965)","journal-title":"Oper. Res."},{"issue":"2\u20133","key":"29_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2004.02.033","volume":"320","author":"P Healy","year":"2004","unstructured":"Healy, P., Kuusik, A.: Algorithms for multi-level graph planarity testing and layout. Theoret. Comput. Sci. 320(2\u20133), 331\u2013344 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR17","unstructured":"IBM: IBM ILOG CPLEX Optimization Studio 12.6 (2014). http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-63938-1_46","volume-title":"Graph Drawing","author":"M J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., Lee, E.K., Mutzel, P., Odenthal, T.: A polyhedral approach to the multi-layer crossing minimization problem. In: Di Battista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 13\u201324. Springer, Heidelberg (1997). doi: 10.1007\/3-540-63938-1_46"},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-37623-2_17","volume-title":"Graph Drawing","author":"M J\u00fcnger","year":"1998","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P.: Level planarity testing in linear time. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 224\u2013237. Springer, Heidelberg (1998). doi: 10.1007\/3-540-37623-2_17"},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"M J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., Thienel, S.: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw. Pract. Exp. 30, 1325\u20131352 (2000)","journal-title":"Softw. Pract. Exp."},{"key":"29_CR21","unstructured":"Knuth, D.E.: The Stanford GraphBase source (1993). ftp:\/\/ftp.cs.stanford.edu\/pub\/sgb\/sgb.tar.gz"},{"key":"29_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-319-27261-0_16","volume-title":"Graph Drawing and Network Visualization","author":"I Kostitsyna","year":"2015","unstructured":"Kostitsyna, I., N\u00f6llenburg, M., Polishchuk, V., Schulz, A., Strash, D.: On minimizing crossings in storyline visualizations. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 192\u2013198. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-27261-0_16"},{"key":"29_CR23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/3527603794.ch4","volume-title":"New Optimization Algorithms in Physics","author":"F Liers","year":"2004","unstructured":"Liers, F., J\u00fcnger, M., Reinelt, G., Rinaldi, G.: Computing exact ground states of hard ising spin glass problems by branch-and-cut. In: Hartmann, A.K., Rieger, H. (eds.) New Optimization Algorithms in Physics, pp. 47\u201369. Wiley-VCH, Weinheim (2004)"},{"issue":"12","key":"29_CR24","doi-asserted-by":"publisher","first-page":"2436","DOI":"10.1109\/TVCG.2013.196","volume":"19","author":"S Liu","year":"2013","unstructured":"Liu, S., Wu, Y., Wei, E., Liu, M., Liu, Y.: StoryFlow: tracking the evolution of stories. IEEE Trans. Vis. Comput. Graph. 19(12), 2436\u20132445 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Muelder, C.W., Crnovrsanin, T., Sallaberry, A., Ma, K.L.: Egocentric storylines for visual analysis of large dynamic graphs. In: Proceedings of the 2013 IEEE International Conference on Big Data, pp. 56\u201362 (2013)","DOI":"10.1109\/BigData.2013.6691715"},{"key":"29_CR26","unstructured":"Munroe, R.: xkcd #657: Movie Narrative Charts (2009). http:\/\/xkcd.com\/657\/"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"N\u00f6llenburg, M., V\u00f6lker, M., Wolff, A., Holten, D.: Drawing binary tanglegrams: an experimental evaluation. In: Finocchi, I., Hershberger, J. (eds.) Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009, pp. 106\u2013119. Society for Industrial and Applied Mathematics (2009)","DOI":"10.1137\/1.9781611972894.11"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Ogawa, M., Ma, K.L.: Software evolution storylines. In: Telea, A.C. (ed.) Proceedings of the 5th International Symposium on Software Visualization, SOFTVIS 2010, pp. 35\u201342. ACM (2010)","DOI":"10.1145\/1879211.1879219"},{"issue":"2","key":"29_CR29","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":"29_CR30","unstructured":"Tanahashi, Y.: Movie data set (2013). http:\/\/vis.cs.ucdavis.edu\/~tanahashi\/data_downloads\/storyline_visualizations\/story_data.tar"},{"issue":"6","key":"29_CR31","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1109\/TVCG.2015.2392771","volume":"21","author":"Y Tanahashi","year":"2015","unstructured":"Tanahashi, Y., Hsueh, C.H., Ma, K.L.: An efficient framework for generating storyline visualizations from streaming data. IEEE Trans. Vis. Comput. Graph. 21(6), 730\u2013742 (2015)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"12","key":"29_CR32","doi-asserted-by":"publisher","first-page":"2679","DOI":"10.1109\/TVCG.2012.212","volume":"18","author":"Y Tanahashi","year":"2012","unstructured":"Tanahashi, Y., Ma, K.L.: Design considerations for optimizing storyline visualizations. IEEE Trans. Vis. Comput. Graph. 18(12), 2679\u20132688 (2012)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"29_CR33","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1111\/cgf.12512","volume":"34","author":"C Vehlow","year":"2015","unstructured":"Vehlow, C., Beck, F., Auw\u00e4rter, P., Weiskopf, D.: Visualizing the evolution of communities in dynamic graphs. Comput. Graph. Forum 34(1), 277\u2013288 (2015)","journal-title":"Comput. Graph. Forum"},{"issue":"16\u201317","key":"29_CR34","doi-asserted-by":"publisher","first-page":"2349","DOI":"10.1016\/j.dam.2012.05.028","volume":"160","author":"A Wotzlaw","year":"2012","unstructured":"Wotzlaw, A., Speckenmeyer, E., Porschen, S.: Generalized $$k$$-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation. Discrete Appl. Math. 160(16\u201317), 2349\u20132363 (2012)","journal-title":"Discrete Appl. Math."},{"key":"29_CR35","unstructured":"Zimmer, K.: Ein Branch-and-Cut-Algorithmus f\u00fcr Mehrschichten-Kreuzungsmini-mierung. Master\u2019s thesis, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln (2013)"}],"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_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T01:51:17Z","timestamp":1718934677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_29","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"}]}}