Skip to main content
  • Conference proceedings
  • © 2018

Computer Science – Theory and Applications

13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): CSR: International Computer Science Symposium in Russia

Conference proceedings info: CSR 2018.

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

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

Table of contents (27 papers)

  1. Front Matter

    Pages I-XXXII
  2. Complexity of Generation

    • Vladimir Gurvich
    Pages 1-14
  3. Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds

    • Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti
    Pages 29-40
  4. Distributed Symmetry-Breaking Algorithms for Congested Cliques

    • Leonid Barenboim, Victor Khazanov
    Pages 41-52
  5. The Clever Shopper Problem

    • Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette
    Pages 53-64
  6. A Tight Lower Bound for Steiner Orientation

    • Rajesh Chitnis, Andreas Emil Feldmann
    Pages 65-77
  7. Can We Create Large k-Cores by Adding Few Edges?

    • Rajesh Chitnis, Nimrod Talmon
    Pages 78-89
  8. Periodicity in Data Streams with Wildcards

    • Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
    Pages 90-105
  9. Maximum Colorful Cycles in Vertex-Colored Graphs

    • Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong Phong Pham
    Pages 106-117
  10. Grammar-Based Compression of Unranked Trees

    • Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber
    Pages 118-131
  11. Complement for Two-Way Alternating Automata

    • Viliam Geffert
    Pages 132-144
  12. Closure Under Reversal of Languages over Infinite Alphabets

    • Daniel Genkin, Michael Kaminski, Liat Peterfreund
    Pages 145-156
  13. Structural Parameterizations of Dominating Set Variants

    • Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
    Pages 157-168
  14. Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing

    • Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje
    Pages 169-180
  15. Operations on Boolean and Alternating Finite Automata

    • Michal Hospodár, Galina Jirásková, Ivana Krajňáková
    Pages 181-193
  16. Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized

    • Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra
    Pages 194-206
  17. Quadratically Tight Relations for Randomized Query Complexity

    • Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal et al.
    Pages 207-219
  18. On Vertex Coloring Without Monochromatic Triangles

    • Michał Karpiński, Krzysztof Piecuch
    Pages 220-231

Other Volumes

  1. Computer Science – Theory and Applications

About this book

This book constitutes the proceedings of the 13th International Computer Science Symposium in Russia, CSR 2018, held in Moscow, Russia, in May 2018.

The 24 full papers presented together with 7 invited lectures were carefully reviewed and selected from 42 submissions.  The papers cover a wide range of topics such as algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems; networks; and proof theory and applications of logic to computer science.  

Editors and Affiliations

  • Department of Informatics, University of Bergen, Bergen, Norway

    Fedor V. Fomin

  • Steklov Mathematical Institute, Moscow, Russia

    Vladimir V. Podolskii

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access