{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:45:20Z","timestamp":1760244320077,"version":"build-2065373602"},"reference-count":6,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T00:00:00Z","timestamp":1668384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The 15th International Computer Science Symposium in Russia (CSR 2020) was organized by the Ural Federal University located in Ekaterinburg, Russian Federation [...]<\/jats:p>","DOI":"10.3390\/a15110426","type":"journal-article","created":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T04:21:45Z","timestamp":1668399705000},"page":"426","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Special Issue \u201cSelected Algorithmic Papers From CSR 2020\u201d"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4444-3220","authenticated-orcid":false,"given":"Henning","family":"Fernau","sequence":"first","affiliation":[{"name":"Informatikwissenschaften, Fachbereich 4, Universit\u00e4t Trier, Universit\u00e4tsring 15, 54296 Trier, Germany"}]}],"member":"1968","published-online":{"date-parts":[[2022,11,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Fernau, H. (2020). Computer Science\u2014Theory and Applications\u201415th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, 29 June\u20133 July 2020, Proceedings, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-030-50026-9"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Costalonga, J.P., Kingan, R.J., and Kingan, S.R. (2021). Constructing Minimally 3-Connected Graphs. Algorithms, 14.","DOI":"10.3390\/a14010009"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Genitrini, A., and P\u00e9pin, M. (2021). Lexicographic Unranking of Combinations Revisited. Algorithms, 14.","DOI":"10.3390\/a14030097"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Gurvich, V., and Vyalyi, M. (2021). On Computational Hardness of Multidimensional Subtraction Games. Algorithms, 14.","DOI":"10.37247\/PAAl.1.2021.6"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Niehren, J., and Sakho, M. (2021). Determinization and Minimization of Automata for Nested Words Revisited. Algorithms, 14.","DOI":"10.3390\/a14030068"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Rupp, T., and Funke, S. (2021). A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema. Algorithms, 14.","DOI":"10.3390\/a14060164"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/11\/426\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:17:30Z","timestamp":1760145450000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/11\/426"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,14]]},"references-count":6,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2022,11]]}},"alternative-id":["a15110426"],"URL":"https:\/\/doi.org\/10.3390\/a15110426","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2022,11,14]]}}}