default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSR 2018: Moscow, Russia
- Fedor V. Fomin, Vladimir V. Podolskii:
Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings. Lecture Notes in Computer Science 10846, Springer 2018, ISBN 978-3-319-90529-7 - Vladimir Gurvich:
Complexity of Generation. 1-14 - Alexander S. Kulikov
:
Lower Bounds for Unrestricted Boolean Circuits: Open Problems. 15-22 - Michael E. Saks:
Online Labeling: Algorithms, Lower Bounds and Open Questions. 23-28 - Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti:
Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. 29-40 - Leonid Barenboim, Victor Khazanov:
Distributed Symmetry-Breaking Algorithms for Congested Cliques. 41-52 - Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. 53-64 - Rajesh Chitnis, Andreas Emil Feldmann:
A Tight Lower Bound for Steiner Orientation. 65-77 - Rajesh Chitnis, Nimrod Talmon:
Can We Create Large k-Cores by Adding Few Edges? 78-89 - Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Periodicity in Data Streams with Wildcards. 90-105 - Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Maximum Colorful Cycles in Vertex-Colored Graphs. 106-117 - Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber:
Grammar-Based Compression of Unranked Trees. 118-131 - Viliam Geffert:
Complement for Two-Way Alternating Automata. 132-144 - Daniel Genkin, Michael Kaminski, Liat Peterfreund:
Closure Under Reversal of Languages over Infinite Alphabets. 145-156 - Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman:
Structural Parameterizations of Dominating Set Variants. 157-168 - Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje:
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. 169-180 - Michal Hospodár, Galina Jirásková, Ivana Krajnáková:
Operations on Boolean and Alternating Finite Automata. 181-193 - Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra:
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. 194-206 - Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. 207-219 - Michal Karpinski, Krzysztof Piecuch:
On Vertex Coloring Without Monochromatic Triangles. 220-231 - Alexander Kozachinskiy:
Recognizing Read-Once Functions from Depth-Three Formulas. 232-243 - Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi:
Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. 244-256 - Etienne Moutot, Pascal Vanier:
Slopes of 3-Dimensional Subshifts of Finite Type. 257-268 - N. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan:
Facility Location on Planar Graphs with Unreliable Links. 269-281 - Artur Riazanov:
On the Decision Trees with Symmetries. 282-294 - Alexander A. Rubtsov, Mikhail N. Vyalyi:
On Emptiness and Membership Problems for Set Automata. 295-307 - Dominik Wojtczak:
On Strong NP-Completeness of Rational Problems. 308-320 - Ning Xie, Shuai Xu, Yekun Xu:
A New Algorithm for Finding Closest Pair of Vectors (Extended Abstract). 321-333
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-02 21:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
