Fomin, Fedor V. (ed.); Podolskii, Vladimir V. (ed.) Computer science – theory and applications. 13th international computer science symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018. Proceedings. (English) Zbl 1388.68008 Lecture Notes in Computer Science 10846. Cham: Springer (ISBN 978-3-319-90529-7/pbk; 978-3-319-90530-3/ebook). xxxii, 335 p. (2018). Show indexed articles as search result. The articles of this volume will be reviewed individually. For the preceding symposium see [Zbl 1362.68016].Indexed articles:Gurvich, Vladimir, Complexity of generation, 1-14 [Zbl 1484.68069]Kulikov, Alexander S., Lower bounds for unrestricted Boolean circuits: open problems, 15-22 [Zbl 1484.68065]Saks, Michael, Online labeling: algorithms, lower bounds and open questions, 23-28 [Zbl 1484.68344]Banerjee, Niranka; Raman, Venkatesh; Satti, Srinivasa Rao, Maintaining chordal graphs dynamically: improved upper and lower bounds, 29-40 [Zbl 1484.68148]Barenboim, Leonid; Khazanov, Victor, Distributed symmetry-breaking algorithms for congested cliques, 41-52 [Zbl 1484.68320]Bulteau, Laurent; Hermelin, Danny; Labarre, Anthony; Vialette, Stéphane, The clever shopper problem, 53-64 [Zbl 1434.68193]Chitnis, Rajesh; Feldmann, Andreas Emil, A tight lower bound for Steiner orientation, 65-77 [Zbl 1484.68155]Chitnis, Rajesh; Talmon, Nimrod, Can we create large \(k\)-cores by adding few edges?, 78-89 [Zbl 1485.68177]Ergün, Funda; Grigorescu, Elena; Sadeqi Azer, Erfan; Zhou, Samson, Periodicity in data streams with wildcards, 90-105 [Zbl 1434.68690]Italiano, Giuseppe F.; Manoussakis, Yannis; Kim Thang, Nguyen; Pham, Hong Phong, Maximum colorful cycles in vertex-colored graphs, 106-117 [Zbl 1484.68164]Gascón, Adrià; Lohrey, Markus; Maneth, Sebastian; Reh, Carl Philipp; Sieber, Kurt, Grammar-based compression of unranked trees, 118-131 [Zbl 1434.68128]Geffert, Viliam, Complement for two-way alternating automata, 132-144 [Zbl 1484.68086]Genkin, Daniel; Kaminski, Michael; Peterfreund, Liat, Closure under reversal of languages over infinite alphabets, 145-156 [Zbl 1484.68087]Goyal, Dishant; Jacob, Ashwin; Kumar, Kaushtubh; Majumdar, Diptapriyo; Raman, Venkatesh, Structural parameterizations of dominating set variants, 157-168 [Zbl 1484.68160]Henning, Sören; Jansen, Klaus; Rau, Malin; Schmarje, Lars, Complexity and inapproximability results for parallel task scheduling and strip packing, 169-180 [Zbl 1434.68187]Hospodár, Michal; Jirásková, Galina; Krajňáková, Ivana, Operations on Boolean and alternating finite automata, 181-193 [Zbl 1484.68089]Jain, Pallavi; Kanesh, Lawqueen; Misra, Pranabendu, Conflict free version of covering problems on graphs: classical and parameterized, 194-206 [Zbl 1453.68135]Jain, Rahul; Klauck, Hartmut; Kundu, Srijita; Lee, Troy; Santha, Miklos; Sanyal, Swagato; Vihrovs, Jevgēnijs, Quadratically tight relations for randomized query complexity, 207-219 [Zbl 1434.68198]Karpiński, Michał; Piecuch, Krzysztof, On vertex coloring without monochromatic triangles, 220-231 [Zbl 1484.68165]Kozachinskiy, Alexander, Recognizing read-once functions from depth-three formulas, 232-243 [Zbl 1434.68200]Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav, Max-Cut Above Spanning Tree is fixed-parameter tractable, 244-256 [Zbl 1434.68747]Moutot, Etienne; Vanier, Pascal, Slopes of 3-dimensional subshifts of finite type, 257-268 [Zbl 1440.37026]Narayanaswamy, N. S.; Nasre, Meghana; Vijayaragunathan, R., Facility location on planar graphs with unreliable links, 269-281 [Zbl 1485.68194]Riazanov, Artur, On the decision trees with symmetries, 282-294 [Zbl 1485.03237]Rubtsov, A.; Vyalyi, M., On emptiness and membership problems for set automata, 295-307 [Zbl 1485.68145]Wojtczak, Dominik, On strong NP-completeness of rational problems, 308-320 [Zbl 1484.68074]Xie, Ning; Xu, Shuai; Xu, Yekun, A new algorithm for finding closest pair of vectors (extended abstract), 321-333 [Zbl 1484.68348] Cited in 1 Review MSC: 68-06 Proceedings, conferences, collections, etc. pertaining to computer science 68Qxx Theory of computing 00B25 Proceedings of conferences of miscellaneous specific interest Citations:Zbl 1362.68016 PDFBibTeX XMLCite \textit{F. V. Fomin} (ed.) and \textit{V. V. Podolskii} (ed.), Computer science -- theory and applications. 13th international computer science symposium in Russia, CSR 2018, Moscow, Russia, June 6--10, 2018. Proceedings. Cham: Springer (2018; Zbl 1388.68008) Full Text: DOI