{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:56Z","timestamp":1770921416983,"version":"3.50.1"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","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-17801-5_35","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:28Z","timestamp":1770918808000},"page":"475-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Rectilinear Steiner Forest Arborescence"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5873-9834","authenticated-orcid":false,"given":"\u0141ukasz","family":"Mielewczyk","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8630-3835","authenticated-orcid":false,"given":"Leonidas","family":"Palios","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6378-7742","authenticated-orcid":false,"given":"Pawe\u0142","family":"\u017byli\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"issue":"12","key":"35_CR1","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1109\/43.552083","volume":"15","author":"MJ Alexander","year":"1996","unstructured":"Alexander, M.J., Robins, G.: New performance-driven FPGA routing algorithms. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(12), 1505\u20131517 (1996). https:\/\/doi.org\/10.1109\/43.552083","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"5","key":"35_CR2","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753\u2013782 (1998). https:\/\/doi.org\/10.1145\/290179.290180","journal-title":"J. ACM"},{"key":"35_CR3","doi-asserted-by":"publisher","unstructured":"Brazil, M., Thomas, D.A., Weng, J.F.: Rectilinear Steiner minimal trees on parallel lines. In: Du, D.-Z., Smith, J.M., Rubinstein, J.H. (eds.) Advances in Steiner Trees. Combinatorial Optimization, vol. 6, pp. 27\u201337. Springer, Boston (2000). https:\/\/doi.org\/10.1007\/978-1-4757-3171-2_3","DOI":"10.1007\/978-1-4757-3171-2_3"},{"key":"35_CR4","doi-asserted-by":"publisher","unstructured":"Benkert, M., Wolff, A., Widmann, F.: The minimum Manhattan network problem: a fast factor-3 approximation. In: Akiyama, J., Kano, M., Tan, X. (eds.) DCG 2004. LNCS, vol. 3742, pp. 16\u201328. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11589440_2","DOI":"10.1007\/11589440_2"},{"issue":"3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.comgeo.2005.09.004","volume":"35","author":"M Benkert","year":"2006","unstructured":"Benkert, M., Wolff, A., Widmann, F., Shirabe, T.: The minimum Manhattan network problem: approximations and exact solutions. Comput. Geom. Theory Appl. 35(3), 188\u2013208 (2006). https:\/\/doi.org\/10.1016\/j.comgeo.2005.09.004","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"35_CR6","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1007\/s00453-013-9867-z","volume":"72","author":"K Buchin","year":"2015","unstructured":"Buchin, K., Speckmann, B., Verbeek, K.: Angle-restricted Steiner arborescences for flow map layout. Algorithmica 72(2), 656\u2013685 (2015). https:\/\/doi.org\/10.1007\/s00453-013-9867-z","journal-title":"Algorithmica"},{"issue":"2","key":"35_CR7","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.ejor.2018.03.042","volume":"270","author":"H Cambazard","year":"2018","unstructured":"Cambazard, H., Catusse, N.: Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane. Eur. J. Oper. Res. 270(2), 419\u2013429 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2018.03.042","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"35_CR8","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1012730702524","volume":"21","author":"X Cheng","year":"2001","unstructured":"Cheng, X., DasGupta, B., Lu, B.: Polynomial time approximation scheme for the symmetric rectilinear Steiner arborescence problem. J. Global Optim. 21(4), 385\u2013396 (2001). https:\/\/doi.org\/10.1023\/A:1012730702524","journal-title":"J. Global Optim."},{"key":"35_CR9","doi-asserted-by":"publisher","unstructured":"Cheng, X., Du, D.-Z., Kim, J.-M., Ngo, H.Q.: Guillotine cut in approximation algorithms. In: Murphey, R., Pardalos, P.M. (eds.) Cooperative Control and Optimization. Applied Optimization, vol. 66, pp. 21\u201334. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/0-306-47536-7_2","DOI":"10.1007\/0-306-47536-7_2"},{"issue":"1","key":"35_CR10","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2007.10.013","volume":"390","author":"C Chepoi","year":"2008","unstructured":"Chepoi, C., Nouioua, K., Vaxes, Y.: A rounding algorithm for approximating minimum Manhattan networks. Theoret. Comput. Sci. 390(1), 56\u201369 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2007.10.013","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"35_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/s00454-011-9342-z","volume":"45","author":"FYL Chin","year":"2011","unstructured":"Chin, F.Y.L., Guo, Z., Sun, H.: Minimum Manhattan network problem is NP-complete. Discret. Comput. Geom. 45(4), 701\u2013722 (2011). https:\/\/doi.org\/10.1007\/s00454-011-9342-z","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"35_CR12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/43.673630","volume":"17","author":"J Cong","year":"1999","unstructured":"Cong, J., Kahng, A.B., Leung, K.-S.: Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(1), 24\u201339 (1999). https:\/\/doi.org\/10.1109\/43.673630","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"35_CR13","doi-asserted-by":"publisher","unstructured":"Cong, J., Leung, K.-S., Zhou, D.: Performance-driven interconnect design based on distributed RC delay model. In: Proceedings of the 30th international Design Automation Conference, pp. 606\u2013611 (1993). https:\/\/doi.org\/10.1145\/157485.165065","DOI":"10.1145\/157485.165065"},{"key":"35_CR14","unstructured":"C\u00f3rdova, J., Lee, Y.-H.: Fast optimal algorithms for the minimum rectilinear Steiner arborescence problem. Technical report TR-94-25, University of Florida (1994)"},{"key":"35_CR15","doi-asserted-by":"publisher","unstructured":"Czumaj, A., Czyzowicz, J., G\u0105sieniec, L., Jansson, J., Lingas, A., \u017byli\u0144ski, P.: Approximation algorithms for buy-at-bulk geometric network design. Int. J. Found. Comput. Sci. 22(8), 1949\u20131969 (2011). https:\/\/doi.org\/10.1007\/978-3-642-03367-4_15","DOI":"10.1007\/978-3-642-03367-4_15"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1007\/s00453-017-0298-0","volume":"80","author":"A Das","year":"2018","unstructured":"Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the generalized minimum Manhattan network problem. Algorithmica 80, 1170\u20131190 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0298-0","journal-title":"Algorithmica"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s00453-013-9778-z","volume":"71","author":"A Das","year":"2015","unstructured":"Das, A., Gansner, E.R., Kaufmann, M., Kobourov, S., Spoerhase, J., Wolff, A.: Approximating minimum Manhattan networks in higher dimensions. Algorithmica 71, 36\u201352 (2015). https:\/\/doi.org\/10.1007\/s00453-013-9778-z","journal-title":"Algorithmica"},{"issue":"3","key":"35_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195\u2013207 (1971). https:\/\/doi.org\/10.1002\/net.3230010302","journal-title":"Networks"},{"key":"35_CR19","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Kolay, S., Lokshtanov, D., Panolan, F., Saurabh, S.: Subexponential algorithms for rectilinear Steiner tree and arborescence problems. ACM Trans. Algorithms 16(2), 1\u201337, Article no. 21 (2020). https:\/\/doi.org\/10.1145\/338142","DOI":"10.1145\/338142"},{"key":"35_CR20","unstructured":"Gudmundsson, J., Klein, O., Knauer, C., Smid, M.: Small Manhattan networks and algorithmic applications for the Earth mover\u2019s distance. In: Proceedings of the 23rd European Workshop on Computational Geometry, Graz, Austria, pp. 174\u2013177 (2007)"},{"issue":"2","key":"35_CR21","first-page":"219","volume":"8","author":"J Gudmundsson","year":"2001","unstructured":"Gudmundsson, J., Levcopoulos, Ch., Narasimhan, G.: Approximating a minimum Manhattan network. Nordic J. Comput. 8(2), 219\u2013232 (2001)","journal-title":"Nordic J. Comput."},{"issue":"3","key":"35_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1142\/S0218195911003688","volume":"21","author":"Z Guo","year":"2011","unstructured":"Guo, Z., Sun, H., Zhu, H.: Greedy construction of $$2$$-approximation minimum Manhattan network. Int. J. Comput. Geom. Appl. 21(3), 331\u2013350 (2011). https:\/\/doi.org\/10.1142\/S0218195911003688","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"35_CR23","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/011402","volume":"14","author":"M Hanan","year":"1966","unstructured":"Hanan, M.: On Steiner\u2019s problem with rectilinear distance. SIAM J. Appl. Math. 14, 255\u2013265 (1966). https:\/\/doi.org\/10.1137\/011402","journal-title":"SIAM J. Appl. Math."},{"key":"35_CR24","doi-asserted-by":"publisher","unstructured":"Held, S., Rockel, B.: Exact algorithms for delay-bounded Steiner arborescences. In: Proceedings of the 55th Annual Design Automation Conference, San Francisco, USA, Article no. 44, pp. 1\u20136 (2018). https:\/\/doi.org\/10.1109\/DAC.2018.8465902","DOI":"10.1109\/DAC.2018.8465902"},{"key":"35_CR25","doi-asserted-by":"publisher","unstructured":"Ho, J.-M., Ko, M.T., Ma, T.H., Sung, T.Y.: Algorithms for rectilinear optimal multicast trees. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds.) ISAAC 1992. LNCS, vol. 650, pp.\u00a0106\u2013115. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-56279-6_63","DOI":"10.1007\/3-540-56279-6_63"},{"key":"35_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2021.101819","volume":"100","author":"S Jana","year":"2022","unstructured":"Jana, S., Maheshwari, A., Roy, S.: Linear-size planar Manhattan network for convex point sets. Comput. Geom. 100, 101819 (2022). https:\/\/doi.org\/10.1016\/j.comgeo.2021.101819","journal-title":"Comput. Geom."},{"key":"35_CR27","doi-asserted-by":"publisher","unstructured":"Kato, R., Imai, K., Asano, T.: An improved algorithm for the minimum Manhattan network problem. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 344\u2013356, Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36136-7_31","DOI":"10.1007\/3-540-36136-7_31"},{"key":"35_CR28","doi-asserted-by":"publisher","unstructured":"Klein, P.N., Marx, D.: A subexponential parameterized algorithm for Subset TSP on planar graphs. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, USA, pp. 1812\u20131830 (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.13","DOI":"10.1137\/1.9781611973402.13"},{"issue":"1","key":"35_CR29","doi-asserted-by":"publisher","first-page":"189","DOI":"10.20382\/jocg.v2i1a10","volume":"2","author":"C Knauer","year":"2011","unstructured":"Knauer, C., Spillner, A.: A fixed-parameter algorithm for the minimum Manhattan network problem. J. Comput. Geom. 2(1), 189\u2013204 (2011). https:\/\/doi.org\/10.20382\/jocg.v2i1a10","journal-title":"J. Comput. Geom."},{"key":"35_CR30","unstructured":"Laderia de Matos, R.R.: A rectilinear arborescence problem. Ph.D. thesis, University of Alabama, USA (1979)"},{"key":"35_CR31","doi-asserted-by":"publisher","unstructured":"Leung, K.-S., Cong J.: Fast optimal algorithms for the minimum rectilinear Steiner arborescence problem. In: Proceedings of the IEEE International Symposium on Circuits and Systems, Hong Kong, China, pp. 1568\u20131571 (1997). https:\/\/doi.org\/10.1109\/ISCAS.1997.621429","DOI":"10.1109\/ISCAS.1997.621429"},{"issue":"3","key":"35_CR32","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1023\/A:1009826311973","volume":"4","author":"B Lu","year":"2000","unstructured":"Lu, B., Ruan, L.: Polynomial time approximation scheme for the rectilinear Steiner arborescence problem. J. Comb. Optim. 4(3), 357\u2013363 (2000). https:\/\/doi.org\/10.1023\/A:1009826311973","journal-title":"J. Comb. Optim."},{"key":"35_CR33","unstructured":"Ma\u00dfberg, J.: The depth-restricted rectilinear Steiner arborescence problem is NP-complete. arXiv:1508.06792 (2015)"},{"key":"35_CR34","unstructured":"Mielewczyk, \u0141., Palios, L., \u017byli\u0144ski, P.: The rectilinear Steiner forest arborescence problem. Technical report, arXiv:2210.04576 (2022)"},{"issue":"4","key":"35_CR35","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1137\/S009753979630976","volume":"28","author":"JSB Mitchell","year":"1999","unstructured":"Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, $$k$$-MST, and related problems. SIAM J. Comput. 28(4), 1298\u20131309 (1999). https:\/\/doi.org\/10.1137\/S009753979630976","journal-title":"SIAM J. Comput."},{"issue":"12","key":"35_CR36","doi-asserted-by":"publisher","first-page":"3681","DOI":"10.1007\/s00453-021-00868-x","volume":"83","author":"Y Masumura","year":"2021","unstructured":"Masumura, Y., Oki, T., Yamaguchi, Y.: Dynamic programming approach to the generalized minimum Manhattan network problem. Algorithmica 83(12), 3681\u20133714 (2021). https:\/\/doi.org\/10.1007\/s00453-021-00868-x","journal-title":"Algorithmica"},{"key":"35_CR37","doi-asserted-by":"publisher","unstructured":"Mu\u00f1oz, X., Seibert, S., Unger, W.: The minimal Manhattan network problem in three dimensions. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 369\u2013380. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-642-00202-1_32","DOI":"10.1007\/978-3-642-00202-1_32"},{"key":"35_CR38","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01949715","volume":"18","author":"L Nastansky","year":"1974","unstructured":"Nastansky, L., Selkow, S.M., Stewart, N.F.: Cost minimum trees in directed acyclic graphs. Math. Methods Oper. Res. 18, 59\u201367 (1974). https:\/\/doi.org\/10.1007\/BF01949715","journal-title":"Math. Methods Oper. Res."},{"issue":"7","key":"35_CR39","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/TCAD.2003.814249","volume":"22","author":"S Ramnath","year":"2003","unstructured":"Ramnath, S.: New approximations for the rectilinear Steiner arborescence problem [VLSI layout]. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 22(7), 859\u2013869 (2003). https:\/\/doi.org\/10.1109\/TCAD.2003.814249","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"1\u20136","key":"35_CR40","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF01758762","volume":"7","author":"SK Rao","year":"1992","unstructured":"Rao, S.K., Sadayappan, P., Hwang, F.K., Shor, P.W.: The rectilinear Steiner arborescence problem. Algorithmica 7(1\u20136), 277\u2013288 (1992). https:\/\/doi.org\/10.1007\/BF01758762","journal-title":"Algorithmica"},{"issue":"3","key":"35_CR41","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1137\/S0097539704371353","volume":"35","author":"W Shi","year":"2006","unstructured":"Shi, W., Su, C.: The rectilinear Steiner arborescence problem is NP-complete. SIAM J. Comput. 35(3), 729\u2013740 (2006). https:\/\/doi.org\/10.1137\/S0097539704371353","journal-title":"SIAM J. Comput."},{"key":"35_CR42","doi-asserted-by":"publisher","unstructured":"Seibert, S., Unger, W.: A 1.5-approximation of the minimal Manhattan network problem. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 246\u2013255. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11602613_26","DOI":"10.1007\/11602613_26"},{"issue":"1","key":"35_CR43","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/ISCAS.1995.521476","volume":"7","author":"GE T\u00e9llez","year":"1998","unstructured":"T\u00e9llez, G.E., Sarrafzadeh, M.: On rectilinear distance-preserving trees. VLSI Des. 7(1), 15\u201330 (1998). https:\/\/doi.org\/10.1109\/ISCAS.1995.521476","journal-title":"VLSI Des."},{"key":"35_CR44","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01078826","volume":"21","author":"VA Trubin","year":"1995","unstructured":"Trubin, V.A.: Subclass of the Steiner problems on a plane with rectilinear metric. Cybernetics 21, 320\u2013322 (1995). https:\/\/doi.org\/10.1007\/BF01078826","journal-title":"Cybernetics"},{"issue":"12","key":"35_CR45","doi-asserted-by":"publisher","first-page":"2536","DOI":"10.1109\/TVCG.2011.202","volume":"17","author":"K Verbeek","year":"2011","unstructured":"Verbeek, K., Buchin, K., Speckmann, B.: Flow map layout via spiral trees. IEEE Trans. Visual Comput. Graph. 17(12), 2536\u20132544 (2011). https:\/\/doi.org\/10.1109\/TVCG.2011.202","journal-title":"IEEE Trans. Visual Comput. Graph."},{"key":"35_CR46","unstructured":"Zachariasen, M.: On the approximation of the rectilinear Steiner arborescence problem in the plane. Manuscript (2000)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:30Z","timestamp":1770918810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_35","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":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no relevant or material financial interests that relate to the research described in this paper.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","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":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}