{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:28:23Z","timestamp":1767338903729,"version":"3.44.0"},"publisher-location":"Cham","reference-count":44,"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_16","type":"book-chapter","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T04:40:01Z","timestamp":1738816801000},"page":"209-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Pathways to Tractability for Geometric Thickness"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Depian","sequence":"first","affiliation":[]},{"given":"Simon Dominik","family":"Fink","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Firbas","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Ganian","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Angelini, P., et al.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4), 32:1\u201332:42 (2015). https:\/\/doi.org\/10.1145\/2629341","DOI":"10.1145\/2629341"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Balab\u00e1n, J., Ganian, R., Rocton, M.: Computing twin-width parameterized by the feedback edge number. In: Beyersdorff, O., Kant\u00e9, M.M., Kupferman, O., Lokshtanov, D. (eds.) 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France. LIPIcs, vol.\u00a0289, pp. 7:1\u20137:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2024.7","DOI":"10.4230\/LIPICS.STACS.2024.7"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Balko, M., Chaplick, S., Ganian, R., Gupta, S., Hoffmann, M., Valtr, P., Wolff, A.: Bounding and computing obstacle numbers of graphs. In: Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.) 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin\/Potsdam, Germany. LIPIcs, vol.\u00a0244, pp. 11:1\u201311:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2022.11","DOI":"10.4230\/LIPICS.ESA.2022.11"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. In: Dehne, F., Solis-Oba, R., Sack, J.R. (eds.) Algorithms and Data Structures, pp. 97\u2013108. Springer Berlin Heidelberg, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_9","DOI":"10.1007\/978-3-642-40104-6_9"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.7155\/JGAA.00457","volume":"22","author":"MJ Bannister","year":"2018","unstructured":"Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. J. Graph Algorithms Appl. 22(1), 23\u201349 (2018). https:\/\/doi.org\/10.7155\/JGAA.00457","journal-title":"J. Graph Algorithms Appl."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"850","DOI":"10.4153\/CJM-1965-084-2","volume":"17","author":"LW Beineke","year":"1965","unstructured":"Beineke, L.W., Harary, F.: The thickness of the complete graph. Can. J. Math. 17, 850\u2013859 (1965)","journal-title":"Can. J. Math."},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Bhore, S., Ganian, R., Khazaliya, L., Montecchiani, F., N\u00f6llenburg, M.: Extending orthogonal planar graph drawings is fixed-parameter tractable. In: Chambers, E.W., Gudmundsson, J. (eds.) 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA. LIPIcs, vol.\u00a0258, pp. 18:1\u201318:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.SOCG.2023.18","DOI":"10.4230\/LIPICS.SOCG.2023.18"},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"603","DOI":"10.7155\/JGAA.00526","volume":"24","author":"S Bhore","year":"2020","unstructured":"Bhore, S., Ganian, R., Montecchiani, F., N\u00f6llenburg, M.: Parameterized algorithms for book embedding problems. J. Graph Algorithms Appl. 24(4), 603\u2013620 (2020). https:\/\/doi.org\/10.7155\/JGAA.00526","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/JGAA.00597","volume":"26","author":"S Bhore","year":"2022","unstructured":"Bhore, S., Ganian, R., Montecchiani, F., N\u00f6llenburg, M.: Parameterized algorithms for queue layouts. J. Graph Algorithms Appl. 26(3), 335\u2013352 (2022). https:\/\/doi.org\/10.7155\/JGAA.00597","journal-title":"J. Graph Algorithms Appl."},{"key":"16_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/J.JCSS.2023.103466","volume":"139","author":"C Binucci","year":"2024","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","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Brand, C., Ganian, R., R\u00f6der, S., Schager, F.: Fixed-parameter algorithms for computing RAC drawings of graphs. In: Bekos, M.A., Chimani, M. (eds.) Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II. Lecture Notes in Computer Science, vol. 14466, pp. 66\u201381. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-49275-4_5","DOI":"10.1007\/978-3-031-49275-4_5"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-24595-7_55","volume-title":"Graph Drawing","author":"F Brandenburg","year":"2004","unstructured":"Brandenburg, F., Eppstein, D., Goodrich, M.T., Kobourov, S., Liotta, G., Mutzel, P.: Selected open problems in graph drawing. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 515\u2013539. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_55"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Cheong, O., Pfister, M., Schlipf, L.: The thickness of fan-planar graphs is at most three. In: Angelini, P., von Hanxleden, R. (eds.) Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers. Lecture Notes in Computer Science, vol. 13764, pp. 247\u2013260. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-22203-0_18","DOI":"10.1007\/978-3-031-22203-0_18"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"16_CR16","unstructured":"Depian, T., Fink, S.D., Firbas, A., Ganian, R., N\u00f6llenburg, M.: Pathways to tractability for geometric thickness (2024). https:\/\/arxiv.org\/abs\/2411.15864"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Depian, T., Fink, S.D., Ganian, R., N\u00f6llenburg, M.: The parameterized complexity of extending stack layouts. In: Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Vienna, Austria (2024). https:\/\/doi.org\/10.4230\/LIPIcs.GD.2024.12","DOI":"10.4230\/LIPIcs.GD.2024.12"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th Edition, Graduate texts in mathematics, vol.\u00a0173. Springer (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/JGAA.00023","volume":"4","author":"MB Dillencourt","year":"2000","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. J. Graph Algorithms Appl. 4(3), 5\u201317 (2000). https:\/\/doi.org\/10.7155\/JGAA.00023","journal-title":"J. Graph Algorithms Appl."},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science, Springer (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"4","key":"16_CR21","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/S00454-007-1318-7","volume":"37","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Graph treewidth and geometric thickness parameters. Discret. Comput. Geom. 37(4), 641\u2013670 (2007). https:\/\/doi.org\/10.1007\/S00454-007-1318-7","journal-title":"Discret. Comput. Geom."},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.COMGEO.2016.03.003","volume":"56","author":"S Durocher","year":"2016","unstructured":"Durocher, S., Gethner, E., Mondal, D.: Thickness and colorability of geometric graphs. Comput. Geom. 56, 1\u201318 (2016). https:\/\/doi.org\/10.1016\/J.COMGEO.2016.03.003","journal-title":"Comput. Geom."},{"issue":"4","key":"16_CR23","doi-asserted-by":"publisher","first-page":"2703","DOI":"10.1137\/16M1110042","volume":"32","author":"S Durocher","year":"2018","unstructured":"Durocher, S., Mondal, D.: Relating graph thickness to planar layers and bend complexity. SIAM J. Discret. Math. 32(4), 2703\u20132719 (2018). https:\/\/doi.org\/10.1137\/16M1110042","journal-title":"SIAM J. Discret. Math."},{"key":"16_CR24","doi-asserted-by":"publisher","unstructured":"Eiben, E., Ganian, R., Hamm, T., Klute, F., N\u00f6llenburg, M.: Extending nearly complete 1-planar drawings in polynomial time. In: Esparza, J., Kr\u00e1l\u2019, D. (eds.) 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic. LIPIcs, vol.\u00a0170, pp. 31:1\u201331:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPICS.MFCS.2020.31","DOI":"10.4230\/LIPICS.MFCS.2020.31"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Eiben, E., Ganian, R., Hamm, T., Klute, F., N\u00f6llenburg, M.: Extending partial 1-planar drawings. In: Czumaj, A., Dawar, A., Merelli, E. (eds.) 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbr\u00fccken, Germany (Virtual Conference). LIPIcs, vol.\u00a0168, pp. 43:1\u201343:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2020.43","DOI":"10.4230\/LIPICS.ICALP.2020.43"},{"key":"16_CR26","doi-asserted-by":"publisher","unstructured":"Eppstein, D.: Separating thickness from geometric thickness. In: Kobourov, S.G., Goodrich, M.T. (eds.) Graph Drawing, 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers. Lecture Notes in Computer Science, vol.\u00a02528, pp. 150\u2013161. Springer (2002). https:\/\/doi.org\/10.1007\/3-540-36151-0_15","DOI":"10.1007\/3-540-36151-0_15"},{"key":"16_CR27","doi-asserted-by":"publisher","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S., Nagamochi, H., Fukunaga, T. (eds.) Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15\u201317, 2008. Proceedings. Lecture Notes in Computer Science, vol.\u00a05369, pp. 294\u2013305. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_28","DOI":"10.1007\/978-3-540-92182-0_28"},{"issue":"4","key":"16_CR28","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1007\/S00453-017-0297-1","volume":"80","author":"FV Fomin","year":"2018","unstructured":"Fomin, F.V., Liedloff, M., Montealegre, P., Todinca, I.: Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Algorithmica 80(4), 1146\u20131169 (2018). https:\/\/doi.org\/10.1007\/S00453-017-0297-1","journal-title":"Algorithmica"},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"F\u00f6rster, H., Kindermann, P., Miltzow, T., Parada, I., Terziadis, S., Vogtenhuber, B.: Geometric thickness of multigraphs is $$\\exists \\mathbb{R}$$-complete. In: Soto, J.A., Wiese, A. (eds.) LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14578, pp. 336\u2013349. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-55598-5_22","DOI":"10.1007\/978-3-031-55598-5_22"},{"key":"16_CR30","doi-asserted-by":"publisher","unstructured":"Ganian, R., Hamm, T., Klute, F., Parada, I., Vogtenhuber, B.: Crossing-optimal extension of simple drawings. In: Bansal, N., Merelli, E., Worrell, J. (eds.) 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference). LIPIcs, vol.\u00a0198, pp. 72:1\u201372:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2021.72","DOI":"10.4230\/LIPICS.ICALP.2021.72"},{"issue":"6","key":"16_CR31","doi-asserted-by":"publisher","first-page":"82","DOI":"10.4230\/DAGREP.11.6.82","volume":"11","author":"R Ganian","year":"2021","unstructured":"Ganian, R., Montecchiani, F., N\u00f6llenburg, M., Zehavi, M.: Parameterized complexity in graph drawing (dagstuhl seminar 21293). Dagstuhl Rep. 11(6), 82\u2013123 (2021). https:\/\/doi.org\/10.4230\/DAGREP.11.6.82","journal-title":"Dagstuhl Rep."},{"key":"16_CR32","unstructured":"Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C.D. (eds.): Handbook of discrete and computational geometry. Discrete Mathematics and its Applications (Boca Raton), CRC Press, Boca Raton, FL, third edn. (2018)"},{"key":"16_CR33","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202001","volume":"2","author":"DY Grigoryev","year":"1992","unstructured":"Grigoryev, D.Y., Vorobjov, N.N., Jr.: Counting connected components of a semialgebraic set in subexponential time. Comput. Complex. 2, 133\u2013186 (1992). https:\/\/doi.org\/10.1007\/BF01202001","journal-title":"Comput. Complex."},{"key":"16_CR34","doi-asserted-by":"publisher","unstructured":"Jain, R., Ricci, M., Rollin, J., Schulz, A.: On the geometric thickness of 2-degenerate graphs. In: Chambers, E.W., Gudmundsson, J. (eds.) 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA. LIPIcs, vol.\u00a0258, pp. 44:1\u201344:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.SOCG.2023.44","DOI":"10.4230\/LIPICS.SOCG.2023.44"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Mansfield, A.: Determining the thickness of graphs is np-hard. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol.\u00a093, pp. 9\u201323. Cambridge University Press (1983)","DOI":"10.1017\/S030500410006028X"},{"issue":"1","key":"16_CR36","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/PL00007219","volume":"14","author":"P Mutzel","year":"1998","unstructured":"Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of graphs: a survey. Graphs Comb. 14(1), 59\u201373 (1998). https:\/\/doi.org\/10.1007\/PL00007219","journal-title":"Graphs Comb."},{"key":"16_CR37","doi-asserted-by":"publisher","unstructured":"Ne\u0161et\u0159il, J., de\u00a0Mendez, P.O.: Sparsity. Algorithms and Combinatorics 28, xxiv+\u2013457 (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4","DOI":"10.1007\/978-3-642-27875-4"},{"key":"16_CR38","doi-asserted-by":"publisher","unstructured":"Nesetril, J., de\u00a0Mendez, P.O.: Sparsity - Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol.\u00a028. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4","DOI":"10.1007\/978-3-642-27875-4"},{"key":"16_CR39","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. i. excluding a forest. J. Comb. Theory, Ser. B 35(1), 39\u201361 (1983). https:\/\/doi.org\/10.1016\/0095-8956(83)90079-5","DOI":"10.1016\/0095-8956(83)90079-5"},{"key":"16_CR40","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986). https:\/\/doi.org\/10.1016\/0196-6774(86)90023-4","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"16_CR41","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: Eppstein, D., Gansner, E.R. (eds.) Graph Drawing (GD\u201909). LNCS, vol.\u00a05849, pp. 334\u2013344. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_32","DOI":"10.1007\/978-3-642-11805-0_32"},{"key":"16_CR42","unstructured":"Toth, C.D., O\u2019Rourke, J., Goodman, J.E.: Handbook of discrete and computational geometry. CRC Press (2017)"},{"key":"16_CR43","first-page":"561","volume":"25","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: The thickness of a graph. Indag. Math. 25, 561\u2013577 (1963)","journal-title":"Indag. Math."},{"key":"16_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/J.COSREV.2022.100490","volume":"45","author":"M Zehavi","year":"2022","unstructured":"Zehavi, M.: Parameterized analysis and crossing minimization problems. Comput. Sci. Rev. 45, 100490 (2022). https:\/\/doi.org\/10.1016\/J.COSREV.2022.100490","journal-title":"Comput. Sci. Rev."}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T04:40:20Z","timestamp":1757133620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82670-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826696","9783031826702"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82670-2_16","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"}}]}}