The 15th International Computer Science Symposium in Russia (CSR 2020) was organized by the Ural Federal University located in Ekaterinburg, Russian Federation. This symposium traditionally covers a broad range of topics in Theoretical Computer Science, ranging from fundamental to application-related.
This Special Issue contains extended versions of selected contributions, having a clear algorithmic focus. They were previously presented at CSR 2020, see [] for the whole proceedings. This selection still indicates the breadth of the research topics typically present at CSR conferences and hence possibly inspires the readers to choose CSR as a venue for publishing their own research.
Let us briefly describe the papers chosen for this Special Issue, in alphabetical order of their first authors:
- Costalonga, Kingan and Kingan [] describe an algorithm to generate minimally 3-connected graphs, eliminating isomorphic duplicates using certificates generated by McKay’s isomorphism checker nauty.
- Genitrini and Pépin [] consider unranking algorithms of combinations from a fairly general perspective, concerning arbitrary combinatorial objects and analyze their complexities both analytically and empirically.
- (Vector) subtraction games, also known as invariant games, can be seen as a variation of nim games. Gurvich and Vyalyi [] show that there exist such games of finite dimension with a finite difference set that are EXP-complete.
- Niehren and Sakho [] consider the problem of determinizing and minimizing automata for nested words in practice. They explain why the usual strategy fails and how to overcome this difficulty.
- Rupp and Funke [] discuss two popular speed-up techniques for shortest path routing, contraction hierarchies as well as hub labels, and prove a square root lower bound on the query time.
We like to thank all referees that worked for this Special Issue, as well as the authors who extended their previously presented abstract to nice journal papers.
We hope that the readers of the Special Issue will enjoy these papers. If you like to read through other papers published at CSR and convince yourself both of the breadth and the depth of the submissions, we point once more to the conference proceedings of the 2020 edition [], as well as to another selection of extended papers collected in a Special Issue to be published with Theory of Computing Systems in the very near future.
Acknowledgments
We are very grateful for all support delivered especially by Mikhail Volkov from Ekaterinburg in many ways before, during and after the conference.
Conflicts of Interest
The author declares no conflict of interest.
Abbreviations
The following abbreviations are used in this manuscript:
| CSR | Computer Science in Russia |
| EXP | Exponential Time |
References
- Fernau, H. (Ed.) Computer Science—Theory and Applications—15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, 29 June–3 July 2020, Proceedings; Lecture Notes in Computer Science; Springer: Berlin, Germany, 2020; Volume 12159. [Google Scholar] [CrossRef]
- Costalonga, J.P.; Kingan, R.J.; Kingan, S.R. Constructing Minimally 3-Connected Graphs. Algorithms 2021, 14, 9. [Google Scholar] [CrossRef]
- Genitrini, A.; Pépin, M. Lexicographic Unranking of Combinations Revisited. Algorithms 2021, 14, 97. [Google Scholar] [CrossRef]
- Gurvich, V.; Vyalyi, M. On Computational Hardness of Multidimensional Subtraction Games. Algorithms 2021, 14, 71. [Google Scholar] [CrossRef]
- Niehren, J.; Sakho, M. Determinization and Minimization of Automata for Nested Words Revisited. Algorithms 2021, 14, 68. [Google Scholar] [CrossRef]
- Rupp, T.; Funke, S. A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema. Algorithms 2021, 14, 164. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).