{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T13:21:26Z","timestamp":1771334486526,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T00:00:00Z","timestamp":1692921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T00:00:00Z","timestamp":1692921600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"crossref","award":["20-15576\u00a0S"],"award-info":[{"award-number":["20-15576\u00a0S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"crossref","award":["20-15576\u00a0S"],"award-info":[{"award-number":["20-15576\u00a0S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"crossref","award":["20-15576\u00a0S"],"award-info":[{"award-number":["20-15576\u00a0S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"crossref","award":["20-15576\u00a0S"],"award-info":[{"award-number":["20-15576\u00a0S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Univerzita Karlova v Praze","award":["GAUK 1580119"],"award-info":[{"award-number":["GAUK 1580119"]}]},{"name":"Univerzita Karlova v Praze","award":["GAUK 1580119"],"award-info":[{"award-number":["GAUK 1580119"]}]},{"DOI":"10.13039\/501100004382","name":"Polska Akademia Nauk","doi-asserted-by":"publisher","award":["2018\/31\/D\/ST6\/00062"],"award-info":[{"award-number":["2018\/31\/D\/ST6\/00062"]}],"id":[{"id":"10.13039\/501100004382","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s00453-023-01163-7","type":"journal-article","created":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T05:01:45Z","timestamp":1692939705000},"page":"782-807","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["List Covering of Regular Multigraphs with Semi-edges"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7973-1361","authenticated-orcid":false,"given":"Jan","family":"Bok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8108-567X","authenticated-orcid":false,"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9518-6386","authenticated-orcid":false,"given":"Nikola","family":"Jedli\u010dkov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2620-6133","authenticated-orcid":false,"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7696-3848","authenticated-orcid":false,"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,25]]},"reference":[{"key":"1163_CR1","first-page":"103","volume":"4","author":"J Abello","year":"1991","unstructured":"Abello, J., Fellows, M.R., Stillwell, J.C.: On the complexity and combinatorics of covering finite complexes. Aust. J. Comb. 4, 103\u2013112 (1991)","journal-title":"Aust. J. Comb."},{"key":"1163_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"1163_CR3","unstructured":"Bard, S., Bellitto, T., Duffy, C., MacGillivray, G., Yang, F.: Complexity of locally-injective homomorphisms to tournaments. Discrete Math. Theor. Comput. Sci. 20(2), (2018). http:\/\/dmtcs.episciences.org\/4999"},{"key":"1163_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608704","volume-title":"Algebraic Graph Theory","author":"N Biggs","year":"1974","unstructured":"Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1974)"},{"key":"1163_CR5","doi-asserted-by":"publisher","unstructured":"B\u00edlka, O., Lidick\u00fd, B., Tesar, M.: Locally injective homomorphism to the simple weight graphs. In: Ogihara, M., Tarui, J. (eds.) Theory and Applications of Models of Computation\u20148th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings. Lecture Notes in Computer Science, vol.\u00a06648, pp. 471\u2013482. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-20877-5_46","DOI":"10.1007\/978-3-642-20877-5_46"},{"key":"1163_CR6","doi-asserted-by":"crossref","unstructured":"B\u00edlka, O., Jir\u00e1sek, J., Klav\u00edk, P., Tancer, M., Volec, J.: On the complexity of planar covering of small graphs. In: Kolman, P., Kratochv\u00edl, J. (eds.) Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol.\u00a06986, pp. 83\u201394. Springer (2011)","DOI":"10.1007\/978-3-642-25870-1_9"},{"key":"1163_CR7","doi-asserted-by":"publisher","unstructured":"Bok, J., Fiala, J., Hlin\u011bn\u00fd, P., Jedli\u010dkov\u00e1, N., Kratochv\u00edl, J.: Computational complexity of covering multigraphs with semi-edges: small cases. In: Bonchi, F., Puglisi, S.J. (eds.) 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia. LIPIcs, vol.\u00a0202, pp. 21:1\u201321:15. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. (2021), https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2021.21","DOI":"10.4230\/LIPIcs.MFCS.2021.21"},{"key":"1163_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-86593-1_6","volume-title":"Fundamentals of Computation Theory","author":"J Bok","year":"2021","unstructured":"Bok, J., Fiala, J., Jedli\u010dkov\u00e1, N., Kratochv\u00edl, J., Seifrtov\u00e1, M.: Computational complexity of covering disconnected multigraphs. In: Bampis, E., Pagourtzis, A. (eds.) Fundamentals of Computation Theory, pp. 85\u201399. Springer International Publishing, Cham (2021)"},{"key":"1163_CR9","doi-asserted-by":"publisher","unstructured":"Bok, J., Fiala, J., Jedli\u010dkov\u00e1, N., Kratochv\u00edl, J., Rz\u0105\u017cewski, P.: List covering of regular multigraphs. In: Bazgan, C., Fernau, H. (eds.) Combinatorial Algorithms\u201433rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings. Lecture Notes in Computer Science, vol. 13270, pp. 228\u2013242. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-06678-8_17","DOI":"10.1007\/978-3-031-06678-8_17"},{"key":"1163_CR10","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Fiala, J., van\u00a0\u2019t Hof, P., Paulusma, D., Tesa\u0159, M.: Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. 590, 86\u201395 (2015)","DOI":"10.1016\/j.tcs.2015.01.028"},{"key":"1163_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0095-8956(74)90070-7","volume":"16","author":"D\u017d Djokovi\u0107","year":"1974","unstructured":"Djokovi\u0107, D.\u017d: Automorphisms of graphs and coverings. J. Comb. Theory B 16, 243\u2013247 (1974)","journal-title":"J. Comb. Theory B"},{"key":"1163_CR12","unstructured":"Dvo\u0159\u00e1k, P., Krawczyk, M., Masa\u0159\u00edk, T., Novotn\u00e1, J., Rz\u0105\u017cewski, P., \u017buk, A.: List locally surjective homomorphisms in hereditary graph classes. (2022). CoRR arXiv:2202.12438"},{"issue":"4","key":"1163_CR13","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s004939970003","volume":"19","author":"T Feder","year":"1999","unstructured":"Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica 19(4), 487\u2013505 (1999)","journal-title":"Combinatorica"},{"key":"1163_CR14","unstructured":"Fiala, J., Klav\u00edk, P., Kratochv\u00edl, J., Nedela, R.: Algorithmic aspects of regular graph covers. (2016). arXiv:1609.03013"},{"issue":"2","key":"1163_CR15","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1002\/jgt.10088","volume":"43","author":"J Fiala","year":"2003","unstructured":"Fiala, J.: NP completeness of the edge precoloring extension problem on bipartite graphs. J. Graph Theory 43(2), 156\u2013160 (2003)","journal-title":"J. Graph Theory"},{"key":"1163_CR16","doi-asserted-by":"crossref","unstructured":"Fiala, J., Kratochv\u00edl, J.: Complexity of partial covers of graphs. In: Eades, P., Takaoka, T. (eds.) ISAAC. Lecture Notes in Computer Science, vol.\u00a02223, pp. 537\u2013549. Springer (2001)","DOI":"10.1007\/3-540-45678-3_46"},{"key":"1163_CR17","doi-asserted-by":"crossref","unstructured":"Fiala, J., Kratochv\u00edl, J.: Locally injective graph homomorphism: lists guarantee dichotomy. In: Fomin, F.V. (ed.) WG. Lecture Notes in Computer Science, vol.\u00a04271, pp. 15\u201326. Springer (2006)","DOI":"10.1007\/11917496_2"},{"issue":"7","key":"1163_CR18","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.dam.2007.05.051","volume":"156","author":"J Fiala","year":"2008","unstructured":"Fiala, J., Kratochv\u00edl, J., P\u00f3r, A.: On the computational complexity of partial covers of theta graphs. Discrete Appl. Math. 156(7), 1143\u20131149 (2008). https:\/\/doi.org\/10.1016\/j.dam.2007.05.051","journal-title":"Discrete Appl. Math."},{"key":"1163_CR19","unstructured":"Fiala, J.: Locally Injective Homomorphisms. Ph.D. thesis, Charles University, Prague (2000)"},{"issue":"3","key":"1163_CR20","first-page":"206","volume":"10","author":"J Fiala","year":"2003","unstructured":"Fiala, J., Heggernes, P., Kristiansen, P., Telle, J.A.: Generalized $$H$$-coloring and $$H$$-covering of trees. Nord. J. Comput. 10(3), 206\u2013224 (2003)","journal-title":"Nord. J. Comput."},{"key":"1163_CR21","doi-asserted-by":"crossref","unstructured":"Fiala, J., Klav\u00edk, P., Kratochv\u00edl, J., Nedela, R.: Algorithmic aspects of regular graph covers with applications to planar graphs. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP (1). Lecture Notes in Computer Science, vol.\u00a08572, pp. 489\u2013501. Springer (2014)","DOI":"10.1007\/978-3-662-43948-7_41"},{"key":"1163_CR22","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.ejc.2018.06.002","volume":"73","author":"J Fiala","year":"2018","unstructured":"Fiala, J., Klav\u00edk, P., Kratochv\u00edl, J., Nedela, R.: 3-connected reduction for regular graph covers. Eur. J. Comb. 73, 170\u2013210 (2018)","journal-title":"Eur. J. Comb."},{"key":"1163_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.7151\/dmgt.1159","volume":"22","author":"J Fiala","year":"2002","unstructured":"Fiala, J., Kratochv\u00edl, J.: Partial covers of graphs. Discuss. Math. Graph Theory 22, 89\u201399 (2002)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"2","key":"1163_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cosrev.2008.06.001","volume":"2","author":"J Fiala","year":"2008","unstructured":"Fiala, J., Kratochv\u00edl, J.: Locally constrained graph homomorphisms\u2014structure, complexity, and applications. Comput. Sci. Rev. 2(2), 97\u2013111 (2008)","journal-title":"Comput. Sci. Rev."},{"issue":"349","key":"1163_CR25","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2005.09.029","volume":"1","author":"J Fiala","year":"2005","unstructured":"Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theor. Comput. Sci. 1(349), 67\u201381 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"1163_CR26","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0095-8956(74)90072-0","volume":"16","author":"A Gardiner","year":"1974","unstructured":"Gardiner, A.: Antipodal covering graphs. J. Comb. Theory B 16, 255\u2013273 (1974)","journal-title":"J. Comb. Theory B"},{"issue":"1","key":"1163_CR27","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1023\/A:1000245600345","volume":"110","author":"E Getzler","year":"1998","unstructured":"Getzler, E., Kapranov, M.M.: Modular operads. Compos. Math. 110(1), 65\u2013125 (1998)","journal-title":"Compos. Math."},{"issue":"4","key":"1163_CR28","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5(4), 586\u2013595 (1992). https:\/\/doi.org\/10.1137\/0405048","journal-title":"SIAM J. Discrete Math."},{"key":"1163_CR29","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0012-365X(77)90131-5","volume":"18","author":"JL Gross","year":"1977","unstructured":"Gross, J.L., Tucker, T.W.: Generating all graph coverings by permutation voltage assignments. Discrete Math. 18, 273\u2013283 (1977)","journal-title":"Discrete Math."},{"issue":"1","key":"1163_CR30","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of $$H$$-coloring. J. Comb. Theory Ser. B 48(1), 92\u2013110 (1990)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1163_CR31","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J., Proskurowski, A., Telle, J.A.: Covering directed multigraphs I. Colored directed multigraphs. In: M\u00f6hring, R.H. (ed.) WG. Lecture Notes in Computer Science, vol.\u00a01335, pp. 242\u2013257. Springer (1997)","DOI":"10.1007\/BFb0024502"},{"issue":"1","key":"1163_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1996.1743","volume":"71","author":"J Kratochv\u00edl","year":"1997","unstructured":"Kratochv\u00edl, J., Proskurowski, A., Telle, J.A.: Covering regular graphs. J. Comb. Theory Ser. B 71(1), 1\u201316 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1163_CR33","first-page":"173","volume":"5","author":"J Kratochv\u00edl","year":"1998","unstructured":"Kratochv\u00edl, J., Proskurowski, A., Telle, J.A.: Complexity of graph covering problems. Nord. J. Comput. 5, 173\u2013195 (1998)","journal-title":"Nord. J. Comput."},{"key":"1163_CR34","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.tcs.2015.09.013","volume":"609","author":"J Kratochv\u00edl","year":"2016","unstructured":"Kratochv\u00edl, J., Telle, J.A., Tesa\u0159, M.: Computational complexity of covering three-vertex multigraphs. Theor. Comput. Sci. 609, 104\u2013117 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"1163_CR35","doi-asserted-by":"crossref","unstructured":"Kristiansen, P., Telle, J.A.: Generalized $$H$$-coloring of graphs. In: Lee, D.T., Teng, S.H. (eds.) ISAAC. Lecture Notes in Computer Science, vol. 1969, pp. 456\u2013466. Springer (2000)","DOI":"10.1007\/3-540-40996-3_39"},{"key":"1163_CR36","unstructured":"Kwak, J.H., Nedela, R.: Graphs and their coverings. Lecture Notes Series 17 (2007)"},{"key":"1163_CR37","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0095-8956(82)90042-9","volume":"33","author":"FT Leighton","year":"1982","unstructured":"Leighton, F.T.: Finite common coverings of graphs. J. Comb. Theory B 33, 231\u2013238 (1982)","journal-title":"J. Comb. Theory B"},{"key":"1163_CR38","doi-asserted-by":"publisher","unstructured":"Lidick\u00fd, B., Tesar, M.: Complexity of locally injective homomorphism to the theta graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds.) Combinatorial Algorithms\u201421st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers. Lecture Notes in Computer Science, vol. 6460, pp. 326\u2013336. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-19222-7_33","DOI":"10.1007\/978-3-642-19222-7_33"},{"issue":"1","key":"1163_CR39","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/B:JACO.0000047294.42633.25","volume":"20","author":"A Malni\u010d","year":"2004","unstructured":"Malni\u010d, A., Maru\u0161i\u010d, D., Poto\u010dnik, P.: Elementary abelian covers of graphs. J. Algebraic Comb. 20(1), 71\u201397 (2004)","journal-title":"J. Algebraic Comb."},{"issue":"7","key":"1163_CR40","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1006\/eujc.2000.0390","volume":"21","author":"A Malni\u010d","year":"2000","unstructured":"Malni\u010d, A., Nedela, R., \u0160koviera, M.: Lifting graph automorphisms by voltage assignments. Eur. J. Comb. 21(7), 927\u2013947 (2000)","journal-title":"Eur. J. Comb."},{"key":"1163_CR41","unstructured":"Mednykh, A.D., Nedela, R.: Harmonic Morphisms of Graphs: Part I: Graph Coverings, 1st edn. Vydavatelstvo Univerzity Mateja Bela v Banskej Bystrici (2015)"},{"issue":"2","key":"1163_CR42","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1006\/jctb.1996.0044","volume":"67","author":"R Nedela","year":"1996","unstructured":"Nedela, R., \u0160koviera, M.: Regular embeddings of canonical double coverings of graphs. J. Comb. Theory Ser. B 67(2), 249\u2013277 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1163_CR43","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jcss.2019.12.004","volume":"109","author":"K Okrasa","year":"2020","unstructured":"Okrasa, K., Rz\u0105a\u017cewski, P.: Subexponential algorithms for variants of the homomorphism problem in string graphs. J. Comput. Syst. Sci. 109, 126\u2013144 (2020). https:\/\/doi.org\/10.1016\/j.jcss.2019.12.004","journal-title":"J. Comput. Syst. Sci."},{"key":"1163_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-65759-7","volume-title":"Map Color Theorem","author":"G Ringel","year":"1974","unstructured":"Ringel, G.: Map Color Theorem, vol. 209. Springer, Berlin (1974)"},{"key":"1163_CR45","unstructured":"Shepherd, S., Gardam, G., Woodhouse, D.J.: Two generalisations of Leighton\u2019s theorem. (2019). arXiv:1908.00830"},{"issue":"3","key":"1163_CR46","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1017\/S0305004119000550","volume":"170","author":"DJ Woodhouse","year":"2021","unstructured":"Woodhouse, D.J.: Revisiting Leighton\u2019s theorem with the Haar measure. Math. Proc. Camb. Philos. Soc. 170(3), 615\u2013623 (2021). https:\/\/doi.org\/10.1017\/S0305004119000550","journal-title":"Math. Proc. Camb. Philos. Soc."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01163-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-023-01163-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01163-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T15:10:20Z","timestamp":1710169820000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-023-01163-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,25]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1163"],"URL":"https:\/\/doi.org\/10.1007\/s00453-023-01163-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,25]]},"assertion":[{"value":"30 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that the authors have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Confict of interest"}}]}}