{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:31:32Z","timestamp":1774333892384,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_3","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:10Z","timestamp":1770977230000},"page":"33-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Vertical Length in\u00a0Linked Bar Charts"],"prefix":"10.1007","author":[{"given":"Steven","family":"van den Broek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wouter","family":"Meulemans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arjen","family":"Simons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theory, Ser. B 27(3), 320\u2013331 (1979)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"3_CR2","unstructured":"van Beusekom, N., et al.: Visualizing set sizes with dependent and independent uncertainties. In: Abstracts of the 17th IEEE Pacific Visualization Symposium (PacificVis, poster) (2024)"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2838736","volume":"12","author":"T Bl\u00e4sius","year":"2016","unstructured":"Bl\u00e4sius, T., Rutter, I., Wagner, D.: Optimal orthogonal graph drawing with convex bend costs. ACM Trans. Algorithms 12(3), 1\u201332 (2016)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209(1), 1\u201345 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Bonsma, P., Lokshtanov, D.: The fine details of fast dynamic programming over tree decompositions. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 41\u201353. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_5","DOI":"10.1007\/978-3-319-03898-8_5"},{"key":"3_CR6","unstructured":"van\u00a0den Broek, S., van Kreveld, M., Meulemans, W., Simons, A.: Minimizing vertical length in linked bar charts. CoRR (ArXiv.org), 2511.16812v1 (2025)"},{"key":"3_CR7","unstructured":"Buchheim, C., Chimani, M., Gutwenger, C., J\u00fcnger, M., Mutzel, P.: Crossings and planarization. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, pp. 43\u201385. Chapman and Hall\/CRC (2013)"},{"key":"3_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015)"},{"issue":"6","key":"3_CR9","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1109\/TVCG.2010.184","volume":"16","author":"A Dasgupta","year":"2010","unstructured":"Dasgupta, A., Kosara, R.: Pargnostics: screen-space metrics for parallel coordinates. IEEE Trans. Visual Comput. Graph. 16(6), 1017\u20131026 (2010)","journal-title":"IEEE Trans. Visual Comput. Graph."},{"key":"3_CR10","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Hoboken (1999)"},{"key":"3_CR11","unstructured":"Dobler, A., Hegemann, T., N\u00f6llenburg, M., Wolff, A.: Optimizing wiggle in storylines. CoRR (ArXiv.org), 2508.19802v1 (2025). to appear at GD 2025"},{"issue":"5","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/0222063","volume":"22","author":"M Formann","year":"1993","unstructured":"Formann, M., et al.: Drawing graphs in the plane with high resolution. SIAM J. Comput. 22(5), 1035\u20131052 (1993)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/31.1745","volume":"35","author":"GN Frederickson","year":"1988","unstructured":"Frederickson, G.N., Hambrusch, S.E.: Planar linear arrangements of outerplanar graphs. IEEE Trans. Circuits Syst. 35(3), 323\u2013333 (1988)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"3_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA (1990)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Purchase, H.C., Cohen, R.F., James, M.: Validating graph drawing aesthetics. In: Proceedings of Graph Drawing (GD), LNCS 1027, pp. 435\u2013446 (1996)","DOI":"10.1007\/BFb0021827"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Radermacher, M., Reichard, K., Rutter, I., Wagner, D.: A geometric heuristic for rectilinear crossing minimization. In: Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 129\u2013138 (2018)","DOI":"10.1137\/1.9781611975055.12"},{"issue":"3","key":"3_CR17","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)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R Tamassia","year":"1988","unstructured":"Tamassia, R., Di Battista, G., Batini, C.: Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern. 18(1), 61\u201379 (1988)","journal-title":"IEEE Trans. Syst. Man Cybern."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:10:12Z","timestamp":1774325412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}