{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:24:35Z","timestamp":1755217475818,"version":"3.43.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826696"},{"type":"electronic","value":"9783031826702"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-82670-2_17","type":"book-chapter","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T04:40:09Z","timestamp":1738816809000},"page":"225-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Monotone Spanning Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9794-1928","authenticated-orcid":false,"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-6059","authenticated-orcid":false,"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1001-1411","authenticated-orcid":false,"given":"Eleni","family":"Katsanou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7043-1867","authenticated-orcid":false,"given":"Lena","family":"Schlipf","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0280-741X","authenticated-orcid":false,"given":"Antonios","family":"Symvonis","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":[[2025,2,7]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-36763-2_23","volume-title":"Graph Drawing","author":"S Alamdari","year":"2013","unstructured":"Alamdari, S., Chan, T.M., Grant, E., Lubiw, A., Pathak, V.: Self-approaching graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 260\u2013271. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_23"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ipl.2016.12.004","volume":"120","author":"P Angelini","year":"2017","unstructured":"Angelini, P.: Monotone drawings of graphs with few directions. Inform. Process. Lett. 120, 16\u201322 (2017). https:\/\/doi.org\/10.1016\/j.ipl.2016.12.004","journal-title":"Inform. Process. Lett."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/J.TCS.2019.07.019","volume":"795","author":"P Angelini","year":"2019","unstructured":"Angelini, P., et al.: Greedy rectilinear drawings. Theor. Comput. Sci. 795, 375\u2013397 (2019). https:\/\/doi.org\/10.1016\/J.TCS.2019.07.019","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00249","volume":"16","author":"P Angelini","year":"2012","unstructured":"Angelini, P., Colasante, E., Di Battista, G., Frati, F., Patrignani, M.: Monotone drawings of graphs. J. Graph Algorithms Appl. 16(1), 5\u201335 (2012). https:\/\/doi.org\/10.7155\/jgaa.00249","journal-title":"J. Graph Algorithms Appl."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00453-013-9790-3","volume":"71","author":"P Angelini","year":"2015","unstructured":"Angelini, P., et al.: Monotone drawings of graphs with fixed embedding. Algorithmica 71, 233\u2013257 (2015). https:\/\/doi.org\/10.1007\/s00453-013-9790-3","journal-title":"Algorithmica"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7155\/jgaa.00197","volume":"14","author":"P Angelini","year":"2010","unstructured":"Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. J. Graph Algorithms Appl. 14(1), 19\u201351 (2010). https:\/\/doi.org\/10.7155\/jgaa.00197","journal-title":"J. Graph Algorithms Appl."},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Arkin, E.M., Connelly, R., Mitchell, J.S.B.: On monotone paths among obstacles with applications to planning assemblies. In: Proceedings of the 5th Ann. ACM Symposium on Computational Geometry (SoCG), pp. 334\u2013343 (1989). https:\/\/doi.org\/10.1145\/73833.73870","DOI":"10.1145\/73833.73870"},{"key":"17_CR8","unstructured":"Bahoo, Y., Durocher, S., Mehrpour, S., Mondal, D.: Exploring increasing-chord paths and trees. In: Gudmundsson, J., Smid, M. (eds.) Proceedings of 29th Canadian Conference on Computational Geometry (CCCG), pp. 19\u201324 (2017). https:\/\/2017.cccg.ca\/proceedings\/Session1B-paper1.pdf"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.comgeo.2018.10.002","volume":"78","author":"D Bakhshesh","year":"2019","unstructured":"Bakhshesh, D., Farshi, M.: (Weakly) Self-approaching geometric graphs and spanners. Comput. Geom. 78, 20\u201336 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2018.10.002","journal-title":"Comput. Geom."},{"key":"17_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2020.101711","volume":"94","author":"D Bakhshesh","year":"2021","unstructured":"Bakhshesh, D., Farshi, M.: Angle-monotonicity of Delaunay triangulation. Comput. Geom. 94, 101711 (2021). https:\/\/doi.org\/10.1016\/j.comgeo.2020.101711","journal-title":"Comput. Geom."},{"key":"17_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2021.101818","volume":"100","author":"D Bakhshesh","year":"2022","unstructured":"Bakhshesh, D., Farshi, M.: On the plane angle-monotone graphs. Comput. Geom. 100, 101818 (2022). https:\/\/doi.org\/10.1016\/j.comgeo.2021.101818","journal-title":"Comput. Geom."},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-319-50106-2_40","volume-title":"Graph Drawing and Network Visualization","author":"N Bonichon","year":"2016","unstructured":"Bonichon, N., Bose, P., Carmi, P., Kostitsyna, I., Lubiw, A., Verdonschot, S.: Gabriel triangulations and angle-monotone graphs: local routing and recognition. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 519\u2013531. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_40"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0022-0000(78)90022-3","volume":"16","author":"F Chin","year":"1978","unstructured":"Chin, F., Houck, D.: Algorithms for updating minimal spanning trees. J. Comput. Syst. Sci. 16(3), 333\u2013344 (1978). https:\/\/doi.org\/10.1016\/0022-0000(78)90022-3","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-662-45803-7_39","volume-title":"Graph Drawing","author":"HR Dehkordi","year":"2014","unstructured":"Dehkordi, H.R., Frati, F., Gudmundsson, J.: Increasing-chord graphs on point sets. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 464\u2013475. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_39"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00454-009-9235-6","volume":"43","author":"R Dhandapani","year":"2010","unstructured":"Dhandapani, R.: Greedy drawings of triangulations. Discrete. Comput. Geom. 43, 375\u2013392 (2010). https:\/\/doi.org\/10.1007\/s00454-009-9235-6","journal-title":"Discrete. Comput. Geom."},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Didimo, W.: Upward graph drawing. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 2308\u20132312. Springer (2016). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_653","DOI":"10.1007\/978-1-4939-2864-4_653"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01994879","volume":"32","author":"D Eppstein","year":"1992","unstructured":"Eppstein, D.: Finding the $$k$$ smallest spanning trees. BIT 32, 237\u2013248 (1992). https:\/\/doi.org\/10.1007\/BF01994879","journal-title":"BIT"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425\u2013461. North-Holland, Amsterdam (2000). https:\/\/doi.org\/10.1016\/B978-044482537-7\/50010-3","DOI":"10.1016\/B978-044482537-7\/50010-3"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Felsner, S., Igamberdiev, A., Kindermann, P., Klemz, B., Mchedlidze, T., Scheucher, M.: Strongly monotone drawings of planar graphs. In: Fekete, S., Lubiw, A. (eds.) Proceedings of 32nd International Symposium on Computational Geometry (SoCG). LIPIcs, vol.\u00a051, pp. 37:1\u201337:15. Schloss Dagstuhl\u00a0\u2013 Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2016.37","DOI":"10.4230\/LIPIcs.SoCG.2016.37"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Francke, A., Hoffmann, M.: The Euclidean degree-4 minimum spanning tree problem is NP-hard. In: Proceedings of 25th Annual ACM Symposium on Computational Geometry (SoCG), pp. 179\u2013188 (2009). https:\/\/doi.org\/10.1145\/1542362.1542399","DOI":"10.1145\/1542362.1542399"},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/S0097539792226825","volume":"26","author":"GN Frederickson","year":"1997","unstructured":"Frederickson, G.N.: Ambivalent data structures for dynamic 2-edge-connectivity and $$k$$ smallest spanning trees. SIAM J. Comput. 26(2), 484\u2013538 (1997). https:\/\/doi.org\/10.1137\/S0097539792226825","journal-title":"SIAM J. Comput."},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1137\/0206011","volume":"6","author":"HN Gabow","year":"1977","unstructured":"Gabow, H.N.: Two algorithms for generating weighted spanning trees in order. SIAM J. Comput. 6, 139\u2013150 (1977). https:\/\/doi.org\/10.1137\/0206011","journal-title":"SIAM J. Comput."},{"issue":"2","key":"17_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01108622","volume":"12","author":"A Garg","year":"1995","unstructured":"Garg, A., Tamassia, R.: Upward planarity testing. Order 12(2), 109\u2013133 (1995). https:\/\/doi.org\/10.1007\/BF01108622","journal-title":"Order"},{"issue":"1","key":"17_CR24","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/0196-6774(87)90032-0","volume":"8","author":"G Georgakopoulos","year":"1987","unstructured":"Georgakopoulos, G., Papadimitriou, C.H.: The 1-Steiner tree problem. J. Algorithms 8(1), 122\u2013130 (1987). https:\/\/doi.org\/10.1016\/0196-6774(87)90032-0","journal-title":"J. Algorithms"},{"key":"17_CR25","unstructured":"Giacomo, E.D., Didimo, W., Katsanou, E., Schlipf, L., Symvonis, A., Wolff, A.: Minimum monotone spanning trees. arXiv report (2024). http:\/\/arxiv.org\/abs\/2411.14038"},{"issue":"1","key":"17_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","volume":"7","author":"RL Graham","year":"1985","unstructured":"Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7(1), 43\u201357 (1985). https:\/\/doi.org\/10.1109\/MAHC.1985.10011","journal-title":"Ann. Hist. Comput."},{"issue":"1\u20132","key":"17_CR27","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF02559543","volume":"101","author":"F Harary","year":"1959","unstructured":"Harary, F., Prins, G.: The number of homeomorphically irreducible trees, and other species. Acta Math. 101(1\u20132), 141\u2013162 (1959). https:\/\/doi.org\/10.1007\/BF02559543","journal-title":"Acta Math."},{"issue":"4","key":"17_CR28","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1017\/S1446788700016190","volume":"20","author":"F Harary","year":"1975","unstructured":"Harary, F., Robinson, R.W., Schwenk, A.J.: Twenty-step algorithm for determining the asymptotic number of trees of various species. J. Austral. Math. Soc. 20(4), 483\u2013503 (1975). https:\/\/doi.org\/10.1017\/S1446788700016190","journal-title":"J. Austral. Math. Soc."},{"issue":"3","key":"17_CR29","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1137\/16M1080045","volume":"31","author":"D He","year":"2017","unstructured":"He, D., He, X.: Optimal monotone drawings of trees. SIAM J. Discrete Math. 31(3), 1867\u20131877 (2017). https:\/\/doi.org\/10.1137\/16M1080045","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/978-3-662-48350-3_61","volume-title":"Algorithms - ESA 2015","author":"X He","year":"2015","unstructured":"He, X., He, D.: Monotone drawings of 3-connected plane graphs. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 729\u2013741. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_61"},{"key":"17_CR31","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.tcs.2015.09.004","volume":"607","author":"MI Hossain","year":"2015","unstructured":"Hossain, M.I., Rahman, M.S.: Good spanning trees in graph drawing. Theoret. Comput. Sci. 607, 149\u2013165 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.09.004","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-662-45803-7_41","volume-title":"Graph Drawing","author":"P Kindermann","year":"2014","unstructured":"Kindermann, P., Schulz, A., Spoerhase, J., Wolff, A.: On monotone drawings of trees. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 488\u2013500. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_41"},{"issue":"2","key":"17_CR33","doi-asserted-by":"publisher","first-page":"345","DOI":"10.7155\/jgaa.00494","volume":"23","author":"A Lubiw","year":"2019","unstructured":"Lubiw, A., Mondal, D.: Construction and local routing for angle-monotone graphs. J. Graph Algorithms Appl. 23(2), 345\u2013369 (2019). https:\/\/doi.org\/10.7155\/jgaa.00494","journal-title":"J. Graph Algorithms Appl."},{"key":"17_CR34","unstructured":"Mastakas, K.: Uniform 2D-monotone minimum spanning graphs. In: Durocher, S., Kamali, S. (eds.) Proceedings of 30th Canadian Conference on Computational Geometry (CCCG), pp. 318\u2013325 (2018). https:\/\/arxiv.org\/abs\/1806.08770"},{"key":"17_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2020.106035","volume":"166","author":"K Mastakas","year":"2021","unstructured":"Mastakas, K.: Drawing a rooted tree as a rooted $$y$$-monotone minimum spanning tree. Inform. Process. Lett. 166, 106035 (2021). https:\/\/doi.org\/10.1016\/j.ipl.2020.106035","journal-title":"Inform. Process. Lett."},{"key":"17_CR36","doi-asserted-by":"publisher","unstructured":"Mastakas, K., Symvonis, A.: On the construction of increasing-chord graphs on convex point sets. In: Proceedings of 6th International Conference on Information, Intelligence, Systems and Applications (IISA), pp. 1\u20136 (2015). https:\/\/doi.org\/10.1109\/IISA.2015.7388028","DOI":"10.1109\/IISA.2015.7388028"},{"key":"17_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-319-57586-5_34","volume-title":"Algorithms and Complexity","author":"K Mastakas","year":"2017","unstructured":"Mastakas, K., Symvonis, A.: Rooted uniform monotone minimum spanning trees. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 405\u2013417. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_34"},{"key":"17_CR38","doi-asserted-by":"publisher","unstructured":"N\u00f6llenburg, M., Prutkin, R., Rutter, I.: On self-approaching and increasing-chord drawings of 3-connected planar graphs. J. Comput. Geom. 7(1), 47\u201369 (2016). https:\/\/doi.org\/10.20382\/jocg.v7i1a3","DOI":"10.20382\/jocg.v7i1a3"},{"key":"17_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-73915-1_26","volume-title":"Graph Drawing and Network Visualization","author":"A Oikonomou","year":"2018","unstructured":"Oikonomou, A., Symvonis, A.: Simple compact monotone tree drawings. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 326\u2013333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_26"},{"key":"17_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-030-04414-5_24","volume-title":"Graph Drawing and Network Visualization","author":"A Oikonomou","year":"2018","unstructured":"Oikonomou, A., Symvonis, A.: Monotone drawings of k-inner planar graphs. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 347\u2013353. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_24"},{"issue":"1","key":"17_CR41","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"CH Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci. 344(1), 3\u201314 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.06.022","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"17_CR42","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","volume":"5","author":"CH Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the travelling salesman problem. J. Algorithms 5(2), 231\u2013246 (1984). https:\/\/doi.org\/10.1016\/0196-6774(84)90029-4","journal-title":"J. Algorithms"},{"key":"17_CR43","doi-asserted-by":"publisher","unstructured":"Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. In: Proceedings of 9th Annual ACM Conference on Mobile Computing and Networking (MobiCom), pp. 96\u2013108 (2003). https:\/\/doi.org\/10.1145\/938985.938996","DOI":"10.1145\/938985.938996"},{"key":"17_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-10631-6_30","volume-title":"Algorithms and Computation","author":"DY Seo","year":"2009","unstructured":"Seo, D.Y., Lee, D.T., Lin, T.-C.: Geometric minimum diameter minimum cost spanning tree problem. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 283\u2013292. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_30"},{"key":"17_CR45","doi-asserted-by":"publisher","unstructured":"Shamos, M.I., Hoey, D.: Closest-point problems. In: Proceedings of 16th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 151\u2013162 (1975). https:\/\/doi.org\/10.1109\/SFCS.1975.8","DOI":"10.1109\/SFCS.1975.8"},{"issue":"3","key":"17_CR46","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/0204032","volume":"4","author":"PM Spira","year":"1975","unstructured":"Spira, P.M., Pan, A.: On finding and updating spanning trees and shortest paths. SIAM J. Comput. 4(3), 375\u2013380 (1975). https:\/\/doi.org\/10.1137\/0204032","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82670-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T15:25:23Z","timestamp":1754407523000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82670-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826696","9783031826702"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82670-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"7 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}