{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:31:07Z","timestamp":1743031867711,"version":"3.40.3"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826962"},{"type":"electronic","value":"9783031826979"}],"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-82697-9_18","type":"book-chapter","created":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T10:17:52Z","timestamp":1739614672000},"page":"238-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DAG Scheduling in\u00a0the\u00a0BSP Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6667-802X","authenticated-orcid":false,"given":"P\u00e1l Andr\u00e1s","family":"Papp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5730-5812","authenticated-orcid":false,"given":"Georg","family":"Anegg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8842-3689","authenticated-orcid":false,"given":"Albert-Jan N.","family":"Yzelman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,16]]},"reference":[{"key":"18_CR1","unstructured":"Berman, P.R., Scott, A., Karpinski, M.: Approximation hardness and satisfiability of bounded occurrence instances of sat. Tech. rep., SIS-2003-269 (2003)"},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198788348.001.0001","volume-title":"Parallel Scientific Computation: A Structured Approach Using BSP","author":"RH Bisseling","year":"2020","unstructured":"Bisseling, R.H.: Parallel Scientific Computation: A Structured Approach Using BSP. Oxford University Press, USA (2020)"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0167-6377(95)00031-9","volume":"18","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Fellows, M.R.: W [2]-hardness of precedence constrained k-processor scheduling. Oper. Res. Lett. 18(2), 93\u201397 (1995)","journal-title":"Oper. Res. Lett."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Chen, L., Jansen, K., Zhang, G.: On the optimality of approximation schemes for the classical scheduling problem. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 657\u2013668. SIAM (2014)","DOI":"10.1137\/1.9781611973402.50"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman","year":"1972","unstructured":"Coffman, E.G., Graham, R.L.: Optimal scheduling for two-processor systems. Acta Informatica 1(3), 200\u2013213 (1972)","journal-title":"Acta Informatica"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Culler, D., et al.: LogP: towards a realistic model of parallel computation. In: Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP), pp. 1\u201312 (1993)","DOI":"10.1145\/155332.155333"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Davies, S., Kulkarni, J., Rothvoss, T., Sandeep, S., Tarnawski, J., Zhang, Y.: On the hardness of scheduling with non-uniform communication delays. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 316\u2013328. SIAM (2022)","DOI":"10.1137\/1.9781611977073.15"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Davies, S., Kulkarni, J., Rothvoss, T., Tarnawski, J., Zhang, Y.: Scheduling with communication delays via LP hierarchies and clustering. In: 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 822\u2013833. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00081"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Davies, S., Kulkarni, J., Rothvoss, T., Tarnawski, J., Zhang, Y.: Scheduling with communication delays via LP hierarchies and clustering II: weighted completion times on related machines. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2958\u20132977. SIAM (2021)","DOI":"10.1137\/1.9781611976465.176"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0196-6774(84)90039-7","volume":"5","author":"D Dolev","year":"1984","unstructured":"Dolev, D., Warmuth, M.K.: Scheduling precedence graphs of bounded height. J. Algorithms 5(1), 48\u201359 (1984)","journal-title":"J. Algorithms"},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1137\/0606066","volume":"6","author":"D Dolev","year":"1985","unstructured":"Dolev, D., Warmuth, M.K.: Profile scheduling of opposing forests and level orders. SIAM J. Algebraic Discrete Methods 6(4), 665\u2013687 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0890-5401(91)90009-Q","volume":"92","author":"J Du","year":"1991","unstructured":"Du, J., Leung, J.Y., Young, G.H.: Scheduling chain-structured tasks to minimize makespan and mean flow time. Inf. Comput. 92(2), 219\u2013236 (1991)","journal-title":"Inf. Comput."},{"issue":"11","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1109\/TPDS.2003.1247678","volume":"14","author":"N Fujimoto","year":"2003","unstructured":"Fujimoto, N., Hagihara, K.: On approximation of the bulk synchronous task scheduling problem. IEEE Trans. Parallel Distrib. Syst. 14(11), 1191\u20131199 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1145\/322326.322335","volume":"29","author":"HN Gabow","year":"1982","unstructured":"Gabow, H.N.: An almost-linear algorithm for two-processor scheduling. J. ACM 29(3), 766\u2013780 (1982)","journal-title":"J. ACM"},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1137\/0604011","volume":"4","author":"M Garey","year":"1983","unstructured":"Garey, M., Johnson, D., Tarjan, R., Yannakakis, M.: Scheduling opposing forests. SIAM J. Algebraic Discrete Methods 4(1), 72\u201393 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"18_CR16","unstructured":"Garg, S.: Quasi-ptas for scheduling with precedences using LP hierarchies. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Goldman, A., Mouni\u00e9, G., Trystram, D.: Near optimal algorithms for scheduling independent chains in BSP. In: Proceedings. 5th International Conference on High Performance Computing, pp. 310\u2013317. IEEE (1998)","DOI":"10.1109\/HIPC.1998.738003"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Annals of Discrete Mathematics, vol.\u00a05, pp. 287\u2013326. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Hanen, C., Munier, A.: An approximation algorithm for scheduling dependent tasks on m processors with small communication delays. In: Proceedings 1995 INRIA\/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA 1995. vol.\u00a01, pp. 167\u2013189. IEEE (1995)","DOI":"10.1109\/ETFA.1995.496773"},{"issue":"14","key":"18_CR20","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/S0167-8191(98)00093-3","volume":"24","author":"JM Hill","year":"1998","unstructured":"Hill, J.M., et al.: BSPlib: the BSP programming library. Parallel Comput. 24(14), 1947\u20131980 (1998)","journal-title":"Parallel Comput."},{"issue":"3","key":"18_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0167-6377(94)90024-8","volume":"16","author":"J Hoogeveen","year":"1994","unstructured":"Hoogeveen, J., Lenstra, J.K., Veltman, B.: Three, four, five, six, or the complexity of scheduling with communication delays. Oper. Res. Lett. 16(3), 129\u2013137 (1994)","journal-title":"Oper. Res. Lett."},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Jenneskens, E.L., Bisseling, R.H.: Exact k-way sparse matrix partitioning. In: 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 754\u2013763. IEEE (2022)","DOI":"10.1109\/IPDPSW55747.2022.00129"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Kulkarni, J., Li, S., Tarnawski, J., Ye, M.: Hierarchy-based algorithms for minimizing makespan under precedence and communication constraints. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2770\u20132789. SIAM (2020)","DOI":"10.1137\/1.9781611975994.169"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Lenstra, J.K., Kan, A.R., Brucker, P.: Complexity of machine scheduling problems. In: Annals of Discrete Mathematics, vol.\u00a01, pp. 343\u2013362. Elsevier (1977)","DOI":"10.1016\/S0167-5060(08)70743-X"},{"issue":"1","key":"18_CR25","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra, J.K., Rinnooy Kan, A.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22\u201335 (1978)","journal-title":"Oper. Res."},{"issue":"1","key":"18_CR26","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(1), 259\u2013271 (1990)","journal-title":"Math. Program."},{"issue":"4","key":"18_CR27","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.2.4.346","volume":"2","author":"JYT Leung","year":"1990","unstructured":"Leung, J.Y.T., Young, G.H.: Minimizing total tardiness on a single machine with precedence constraints. ORSA J. Comput. 2(4), 346\u2013352 (1990)","journal-title":"ORSA J. Comput."},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Levey, E., Rothvoss, T.: A (1+ epsilon)-approximation for Makespan scheduling with precedence constraints using LP hierarchies. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC), pp. 168\u2013177 (2016)","DOI":"10.1145\/2897518.2897532"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Li, S.: Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations. In: IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 283\u2013294. IEEE Computer Society (2017)","DOI":"10.1109\/FOCS.2017.34"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Li, S.: Towards PTAS for precedence constrained scheduling via combinatorial algorithms. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2991\u20133010. SIAM (2021)","DOI":"10.1137\/1.9781611976465.178"},{"key":"18_CR31","unstructured":"Liu, Q.C., Purohit, M., Svitkina, Z., Vee, E., Wang, J.R.: Scheduling with communication delay in near-linear time. In: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Maiti, B., Rajaraman, R., Stalfa, D., Svitkina, Z., Vijayaraghavan, A.: Scheduling precedence-constrained jobs on related machines with communication delay. In: 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 834\u2013845. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00082"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Markenscoff, P., Li, Y.Y.: Scheduling a computational DAG on a parallel system with communication delays and replication of node execution. In: Proceedings of the 7th International Parallel Processing Symposium, pp. 113\u2013117. IEEE (1993)","DOI":"10.1109\/IPPS.1993.262865"},{"key":"18_CR34","unstructured":"McColl, B.: Mathematics, Models and Architectures, p. 653. Cambridge University Press (2021)"},{"key":"18_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BFb0015236","volume-title":"Computer Science Today","author":"WF McColl","year":"1995","unstructured":"McColl, W.F.: Scalable computing. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 46\u201361. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0015236"},{"issue":"3","key":"18_CR36","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/PL00008264","volume":"24","author":"WF McColl","year":"1999","unstructured":"McColl, W.F., Tiskin, A.: Memory-efficient matrix multiplication in the BSP model. Algorithmica 24(3), 287\u2013297 (1999)","journal-title":"Algorithmica"},{"issue":"1","key":"18_CR37","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10107-014-0830-9","volume":"154","author":"M Mnich","year":"2015","unstructured":"Mnich, M., Wiese, A.: Scheduling and fixed-parameter tractability. Math. Program. 154(1), 533\u2013562 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"18_CR38","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1287\/opre.45.1.145","volume":"45","author":"A Munier","year":"1997","unstructured":"Munier, A., K\u00f6nig, J.C.: A heuristic for a scheduling problem with communication delays. Oper. Res. 45(1), 145\u2013147 (1997)","journal-title":"Oper. Res."},{"key":"18_CR39","doi-asserted-by":"crossref","unstructured":"\u00d6zkaya, M.Y., Benoit, A., U\u00e7ar, B., Herrmann, J., \u00c7ataly\u00fcrek, \u00dc.V.: A scalable clustering-based task scheduler for homogeneous processors using DAG partitioning. In: IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 155\u2013165. IEEE (2019)","DOI":"10.1109\/IPDPS.2019.00026"},{"key":"18_CR40","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: Towards an architecture-independent analysis of parallel algorithms. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 510\u2013513 (1988)","DOI":"10.1145\/62212.62262"},{"key":"18_CR41","doi-asserted-by":"crossref","unstructured":"Papp, P.A., Anegg, G., Yzelman, A.J.N.: Partitioning hypergraphs is hard: Models, inapproximability, and applications. In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 415\u2013425 (2023)","DOI":"10.1145\/3558481.3591087"},{"key":"18_CR42","unstructured":"Papp, P.A., Anegg, G., Yzelman, A.N.: DAG scheduling in the BSP model. arXiv preprint arXiv:2303.05989 (2024)"},{"key":"18_CR43","unstructured":"Rajaraman, R., Stalfa, D., Yang, S.: Approximation algorithms for scheduling under non-uniform machine-dependent delays. arXiv preprint arXiv:2207.13121 (2022)"},{"key":"18_CR44","doi-asserted-by":"publisher","unstructured":"Sequential and Parallel Algorithms and Data Structures. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25209-0_9","DOI":"10.1007\/978-3-030-25209-0_9"},{"issue":"1","key":"18_CR45","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0205005","volume":"5","author":"R Sethi","year":"1976","unstructured":"Sethi, R.: Scheduling graphs on two processors. SIAM J. Comput. 5(1), 73\u201382 (1976)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"18_CR46","first-page":"249","volume":"6","author":"DB Skillicorn","year":"1997","unstructured":"Skillicorn, D.B., Hill, J., McColl, W.F.: Questions and answers about BSP. Sci. Program. 6(3), 249\u2013274 (1997)","journal-title":"Sci. Program."},{"key":"18_CR47","doi-asserted-by":"crossref","unstructured":"Svensson, O.: Conditional hardness of precedence constrained scheduling on identical machines. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), pp. 745\u2013754 (2010)","DOI":"10.1145\/1806689.1806791"},{"key":"18_CR48","doi-asserted-by":"crossref","unstructured":"Timkovsky, V.G.: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity. Eur. J. Oper. Res. 149(2), 355\u2013376 (2003)","DOI":"10.1016\/S0377-2217(02)00767-1"},{"key":"18_CR49","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 453\u2013461 (2001)","DOI":"10.1145\/380752.380839"},{"issue":"3","key":"18_CR50","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman, J.D.: Np-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384\u2013393 (1975)","journal-title":"J. Comput. Syst. Sci."},{"issue":"8","key":"18_CR51","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990)","journal-title":"Commun. ACM"},{"key":"18_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-87744-8_2","volume-title":"Algorithms - ESA 2008","author":"LG Valiant","year":"2008","unstructured":"Valiant, L.G.: A bridging model for multi-core computing. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 13\u201328. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87744-8_2"},{"issue":"1","key":"18_CR53","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.jcss.2010.06.012","volume":"77","author":"LG Valiant","year":"2011","unstructured":"Valiant, L.G.: A bridging model for multi-core computing. J. Comput. Syst. Sci. 77(1), 154\u2013166 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2\u20133","key":"18_CR54","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","volume":"16","author":"B Veltman","year":"1990","unstructured":"Veltman, B., Lageweg, B., Lenstra, J.K.: Multiprocessor scheduling with communication delays. Parallel Comput. 16(2\u20133), 173\u2013182 (1990)","journal-title":"Parallel Comput."},{"issue":"5","key":"18_CR55","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1002\/cpe.1843","volume":"24","author":"A Yzelman","year":"2012","unstructured":"Yzelman, A., Bisseling, R.H.: An object-oriented bulk synchronous parallel library for multicore programming. Concurr. Comput. Pract. Exp. 24(5), 533\u2013553 (2012)","journal-title":"Concurr. Comput. Pract. Exp."},{"issue":"4","key":"18_CR56","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10766-013-0262-9","volume":"42","author":"A Yzelman","year":"2014","unstructured":"Yzelman, A., Bisseling, R.H., Roose, D., Meerbergen, K.: MulticoreBSP for C: a high-performance library for shared-memory parallel programming. Int. J. Parallel Prog. 42(4), 619\u2013642 (2014)","journal-title":"Int. J. Parallel Prog."}],"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-82697-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T10:18:09Z","timestamp":1739614689000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82697-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826962","9783031826979"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82697-9_18","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":"16 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"}}]}}