Skip to main content
Springer Nature Link
Log in

Computer Science – Theory and Applications

17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 – July 1, 2022, Proceedings

  • Conference proceedings
  • © 2022

Overview

Editors:
  1. Alexander S. Kulikov

    1. Steklov Institute of Mathematics, St. Petersburg, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Sofya Raskhodnikova

    1. Boston University, Boston, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: CSR 2022.

  • 8024 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the proceedings of the 17th International Computer Science Symposium in Russia, CSR 2022, held in St. Petersburg, Russia, June 29-July 3, 2022.
The 21 full papers were carefully reviewed and selected from 51 submissions. The papers cover a broad range of topics, such as formal languages and automata theory, geometry and discrete structures; theory and algorithms for application domains and much more.

Similar content being viewed by others

Keywords

Table of contents (21 papers)

  1. Front Matter

    Pages i-xvi
    Download chapter PDF

  2. Parameterized Algorithms for Finding Highly Connected Solution

    • Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh
    Pages 1-16

  3. Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring

    • V. P. Abidha, Pradeesha Ashok, Avi Tomar, Dolly Yadav
    Pages 17-34

  4. Quotient Structures and Groups Computable in Polynomial Time

    • Pavel Alaev
    Pages 35-45

  5. Parameterized Complexity of List Coloring and Max Coloring

    • Bardiya Aryanfard, Fahad Panolan
    Pages 46-63

  6. Eternal Vertex Cover on Bipartite Graphs

    • Jasine Babu, Neeldhara Misra, Saraswati Girish Nanoti
    Pages 64-76

  7. Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time

    • Lorenzo Balzotti, Paolo G. Franciosa
    Pages 77-95

  8. Lossy Kernelization of Same-Size Clustering

    • Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Siminov
    Pages 96-114

  9. Output Sensitive Fault Tolerant Maximum Matching

    • Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh
    Pages 115-132

  10. Bounds for Synchronizing Markov Decision Processes

    • Laurent Doyen, Marie van den Bogaard
    Pages 133-151

  11. Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs

    • Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh
    Pages 152-169

  12. Discrete Versions of the KKM Lemma and Their PPAD-Completeness

    • Alexander Grishutin, Daniil Musatov
    Pages 170-189

  13. The Fast Algorithm for Online k-server Problem on Trees

    • Kamil Khadiev, Maxim Yagafarov
    Pages 190-208

  14. Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields

    • Peter Kostolányi
    Pages 209-223

  15. New Bounds for the Flock-of-Birds Problem

    • Alexander Kozachinskiy
    Pages 224-237

  16. Heterogeneous Multi-commodity Network Flows over Time

    • Yifen Li, Xiaohui Bei, Youming Qiao, Dacheng Tao, Zhiya Chen
    Pages 238-255

  17. On the Determinization of Event-Clock Input-Driven Pushdown Automata

    • Mizuhito Ogawa, Alexander Okhotin
    Pages 256-268

  18. The GKK Algorithm is the Fastest over Simple Mean-Payoff Games

    • Pierre Ohlmann
    Pages 269-288

  19. Partial Vertex Cover on Graphs of Bounded Degeneracy

    • Fahad Panolan, Hannane Yaghoubizade
    Pages 289-301

  20. Abelian Repetition Threshold Revisited

    • Elena A. Petrova, Arseny M. Shur
    Pages 302-319
Back to top

Other volumes

  1. Computer Science – Theory and Applications

Editors and Affiliations

  • Steklov Institute of Mathematics, St. Petersburg, Russia

    Alexander S. Kulikov

  • Boston University, Boston, USA

    Sofya Raskhodnikova

Bibliographic Information

  • Book Title: Computer Science – Theory and Applications

  • Book Subtitle: 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 – July 1, 2022, Proceedings

  • Editors: Alexander S. Kulikov, Sofya Raskhodnikova

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/978-3-031-09574-0

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer Nature Switzerland AG 2022

  • Softcover ISBN: 978-3-031-09573-3Published: 24 June 2022

  • eBook ISBN: 978-3-031-09574-0Published: 23 June 2022

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XVI, 351

  • Number of Illustrations: 16 b/w illustrations, 38 illustrations in colour

  • Topics: Theory of Computation

Publish with us

Policies and ethics

Back to top