Computer Science Symposium in Russia (2018)

ISSN: 1432-4350 (Print) 1433-0490 (Online)

In this topical collection (9 articles)

  1. EditorialNotes

    CSR 2018 Special Issue on TOCS

    Fedor V. Fomin, Vladimir V. Podolskii Pages 1-2
    Download PDF (113KB) View Article

  2. OriginalPaper

    Recognizing Read-Once Functions from Depth-Three Formulas

    Alexander Kozachinskiy Pages 3-16
    Download PDF (296KB) View Article

  3. OriginalPaper

    The Clever Shopper Problem

    Laurent Bulteau, Danny Hermelin, Dušan Knop, Anthony Labarre… Pages 17-34
    Download PDF (1291KB) View Article

  4. OriginalPaper

    Slopes of Multidimensional Subshifts

    Emmanuel Jeandel, Etienne Moutot, Pascal Vanier Pages 35-61
    Download PDF (5094KB) View Article

  5. OriginalPaper

    Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree

    Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi Pages 62-100
    Download PDF (2353KB) View Article

  6. OriginalPaper

    Quadratically Tight Relations for Randomized Query Complexity

    Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee… Pages 101-119
    Download PDF (784KB) View Article

  7. OriginalPaper

    Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing

    Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje Pages 120-140
    Download PDF (1038KB) View Article

  8. OriginalPaper

    Grammar-Based Compression of Unranked Trees

    Adrià Gascón, Markus Lohrey, Sebastian Maneth… Pages 141-176
    Download PDF (1705KB) View Article

  9. OriginalPaper

    Periodicity in Data Streams with Wildcards

    Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer… Pages 177-197
    Download PDF (1560KB) View Article