© 2020

Computer Science – Theory and Applications

15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings

  • Henning Fernau
Conference proceedings CSR 2020

Part of the Lecture Notes in Computer Science book series (LNCS, volume 12159)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 12159)

Table of contents

  1. Front Matter
    Pages i-xi
  2. Farid Ablayev, Marat Ablayev, Alexander Vasiliev
    Pages 1-15
  3. Akanksha Agrawal, Meirav Zehavi
    Pages 16-29
  4. Ulrik Brandes
    Pages 30-45
  5. Alexsander Andrade de Melo, Mateus de Oliveira Oliveira
    Pages 46-63
  6. Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanisław Szufa, Nimrod Talmon
    Pages 64-78
  7. Maxim Akhmedov
    Pages 103-116
  8. Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka
    Pages 117-129
  9. Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh
    Pages 155-168
  10. Iovka Boneva, Joachim Niehren, Momar Sakho
    Pages 169-183
  11. Anastasiya Chistopolskaya, Vladimir V. Podolskii
    Pages 198-210
  12. Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
    Pages 211-223
  13. Fedor V. Fomin, Vijayaragunathan Ramamoorthi
    Pages 224-236
  14. Vladimir Gurvich, Mikhail Vyalyi
    Pages 237-249
  15. Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh
    Pages 250-262
  16. Jaeyoon Kim, Ilya Volkovich, Nelson Xuzhi Zhang
    Pages 263-275

About these proceedings


This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020.

The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data.

 The conference was cancelled as a live conference due to the corona pandemic.


computability enumeration logic grammars and context-free languages tree languages quantum computation theory parameterized complexity and exact algorithms graph algorithms analysis problems, reductions and completeness complexity classes computational geometry network structure combinatorics computer networks engineering graph theory internet mathematics network protocols theoretical computer science

Editors and affiliations

  1. 1.University of TrierTrierGermany

Bibliographic information

Industry Sectors
IT & Software
Consumer Packaged Goods
Finance, Business & Banking