Collection
Computer Science Symposium in Russia (CSR 2018)
- Submission status
- Closed
This collection of Theory of Computing Systems consists of extended journal papers originally presented at the 13th International Computer Science Symposium in Russia (CSR 2018) held on June 6–10, 2018 in Moscow, Russia. The event was hosted by National Research University Higher School of Economics and chaired by Vladimir V. Podolskii. Preliminary versions of these papers presented at the conference appeared in LNCS 10846. The Program Committee, chaired by Fedor V. Fomin, invited several authors to submit extended journal versions of their papers to this collection. All submissions were reviewed in accordance with customary high standards.
Editors
-
Fedor V. Fomin
Fedor V. Fomin is a professor of Computer Science at the University of Bergen. He is known for his work in algorithms and graph theory.
-
Vladimir V. Podolskii
Vladimir V. Podolskii is a senior research fellow at Steklov Institute of Mathematics in Moscow and an associate professor at Computer Science Department of Higher School of Economics in Moscow.
Articles (9 in this collection)
-
-
CSR 2018 Special Issue on TOCS
Authors
- Fedor V. Fomin
- Vladimir V. Podolskii
- Content type: EditorialNotes
- Published: 16 November 2019
- Pages: 1 - 2
-
Slopes of Multidimensional Subshifts
Authors
- Emmanuel Jeandel
- Etienne Moutot
- Pascal Vanier
- Content type: OriginalPaper
- Published: 27 August 2019
- Pages: 35 - 61
-
Quadratically Tight Relations for Randomized Query Complexity
Authors (first, second and last of 7)
- Rahul Jain
- Hartmut Klauck
- Jevgēnijs Vihrovs
- Content type: OriginalPaper
- Published: 10 August 2019
- Pages: 101 - 119
-
Grammar-Based Compression of Unranked Trees
Authors (first, second and last of 5)
- Adrià Gascón
- Markus Lohrey
- Kurt Sieber
- Content type: OriginalPaper
- Published: 08 August 2019
- Pages: 141 - 176
-
The Clever Shopper Problem
Authors (first, second and last of 5)
- Laurent Bulteau
- Danny Hermelin
- Stéphane Vialette
- Content type: OriginalPaper
- Published: 22 April 2019
- Pages: 17 - 34
-
Recognizing Read-Once Functions from Depth-Three Formulas
Authors
- Alexander Kozachinskiy
- Content type: OriginalPaper
- Published: 11 April 2019
- Pages: 3 - 16
-
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
Authors (first, second and last of 4)
- Sören Henning
- Klaus Jansen
- Lars Schmarje
- Content type: OriginalPaper
- Published: 18 February 2019
- Pages: 120 - 140
-
Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree
Authors
- Jayakrishnan Madathil
- Saket Saurabh
- Meirav Zehavi
- Content type: OriginalPaper
- Published: 18 February 2019
- Pages: 62 - 100