{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:39:59Z","timestamp":1767314399263,"version":"3.48.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","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-3-032-11835-6_2","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:36:36Z","timestamp":1767314196000},"page":"18-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unbent Collections of\u00a0Orthogonal Drawings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6521-7987","authenticated-orcid":false,"given":"Todor","family":"Anti\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8524-4036","authenticated-orcid":false,"given":"Tom\u00e1\u0161","family":"Masa\u0159\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giacomo","family":"Ortali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5378-1694","authenticated-orcid":false,"given":"Matthias","family":"Pfretzschner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0531-9769","authenticated-orcid":false,"given":"Peter","family":"Stumpf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7398-718X","authenticated-orcid":false,"given":"Johannes","family":"Zink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0012-365X(89)90073-3","volume":"75","author":"I Algor","year":"1989","unstructured":"Algor, I., Alon, N.: The star arboricity of graphs. Disc. Math. 75(1), 11\u201322 (1989). https:\/\/doi.org\/10.1016\/0012-365X(89)90073-3","journal-title":"Disc. Math."},{"key":"2_CR2","unstructured":"Anti?, T., et al.: Unbent collections of orthogonal drawings (2025). https:\/\/arxiv.org\/abs\/2502.18390"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Balko, M., Hlin\u011bn\u00fd, P., Masa\u0159\u00edk, T., Orthaber, J., Vogtenhuber, B., Wagner, M.H.: On the uncrossed number of graphs. In: Felsner, S., Klein, K. (eds.) Graph Drawing & Network Vis. (GD). LIPIcs, vol.\u00a0320, pp. 18:1\u201318:13. Schloss Dagstuhl\u00a0\u2013 Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPIcs.GD.2024.18","DOI":"10.4230\/LIPIcs.GD.2024.18"},{"issue":"8","key":"2_CR4","doi-asserted-by":"publisher","first-page":"651","DOI":"10.7155\/JGAA.00639","volume":"27","author":"GD Battista","year":"2023","unstructured":"Battista, G.D., et al.: Small point-sets supporting graph stories. J. Graph Algor. Appl. 27(8), 651\u2013677 (2023). https:\/\/doi.org\/10.7155\/JGAA.00639","journal-title":"J. Graph Algor. Appl."},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Binucci, C., et al.: On the complexity of the storyplan problem. J. Comput. Syst. Sci. 139, 103466 (2024). https:\/\/doi.org\/10.1016\/J.JCSS.2023.103466","DOI":"10.1016\/J.JCSS.2023.103466"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"van\u00a0den Brand, J., et al.: A deterministic almost-linear time algorithm for minimum-cost flow. In: Foundation of Computer Science (FOCS), pp. 503\u2013514. IEEE (2023). https:\/\/doi.org\/10.1109\/FOCS57990.2023.00037","DOI":"10.1109\/FOCS57990.2023.00037"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Didimo, W., Liotta, G., Ortali, G., Patrignani, M.: Optimal orthogonal drawings of planar 3-graphs in linear time. In: Chawla, S. (ed.) Discrete Algorithms (SODA), pp. 806\u2013825 (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.49","DOI":"10.1137\/1.9781611975994.49"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Fiala, J., Firman, O., Liotta, G., Wolff, A., Zink, J.: Outerplanar and forest storyplans. In: Fernau, H., Gaspers, S., Klasing, R. (eds.) Theory & Practice Comput. Sci. (SOFSEM). LNCS, vol. 14519, pp. 211\u2013225. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-52113-3_15","DOI":"10.1007\/978-3-031-52113-3_15"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601\u2013625 (2001). https:\/\/doi.org\/10.1137\/S0097539794277123","journal-title":"SIAM J. Comput."},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Hlin\u011bn\u00fd, P., Masa\u0159\u00edk, T.: Minimizing an uncrossed collection of drawings. In: Bekos, M., Chimani, M. (eds.) Graph Drawing & Network Vis. (GD). LNCS, vol. 14466, pp. 110\u2013123. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-49272-3_8","DOI":"10.1007\/978-3-031-49272-3_8"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Nash-Williams, C.S.J.A.: Edge-disjoint spanning trees of finite graphs. J. Lond. Math. Soc. 36(1), 445\u2013450 (1961). https:\/\/doi.org\/10.1112\/jlms\/s1-36.1.445","DOI":"10.1112\/jlms\/s1-36.1.445"},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.7155\/JGAA.00017","volume":"3","author":"MS Rahman","year":"1999","unstructured":"Rahman, M.S., Nakano, S., Nishizeki, T.: A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs. J. Graph Algor. Appl. 3(4), 31\u201362 (1999). https:\/\/doi.org\/10.7155\/JGAA.00017","journal-title":"J. Graph Algor. Appl."},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/JGAA.00074","volume":"7","author":"MS Rahman","year":"2003","unstructured":"Rahman, M.S., Nishizeki, T., Naznin, M.: Orthogonal drawings of plane graphs without bends. J. Graph Algor. Appl. 7(4), 335\u2013362 (2003). https:\/\/doi.org\/10.7155\/JGAA.00074","journal-title":"J. Graph Algor. Appl."},{"key":"2_CR14","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Johnson, D.S. (ed.) Discrete Algorithms (SODA), pp. 138\u2013148. SIAM (1990). http:\/\/dl.acm.org\/citation.cfm?id=320176.320191"},{"issue":"3","key":"2_CR15","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). https:\/\/doi.org\/10.1137\/0216030","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11835-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:36:37Z","timestamp":1767314197000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_2","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":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}