Volume 62, Issue 3

Search all Theory of Computing Systems articles

April 2018

Computer Science Symposium in Russia

Issue Editors:

Alexander S. Kulikov,
Gerhard J. Woeginger

12 articles in this issue

Preface to the Special Issue on Computer Science in Russia 2016
Alexander S. Kulikov
Gerhard J. Woeginger
EditorialNotes 24 February 2018 Pages: 465 - 466
Level Two of the Quantifier Alternation Hierarchy Over Infinite Words
Manfred Kufleitner
Tobias Walter
OriginalPaper 04 August 2017 Pages: 467 - 480
Tropically Convex Constraint Satisfaction
Manuel Bodirsky
Marcello Mamino
OriginalPaper 17 April 2017 Pages: 481 - 509
Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems
Zeev Nutov
OriginalPaper 02 June 2017 Pages: 510 - 532
On Approximating (Connected) 2-Edge Dominating Set by a Tree
Toshihiro Fujito
Tomoaki Shimoda
OriginalPaper 03 April 2017 Pages: 533 - 556
Comparing Representations for Function Spaces in Computable Analysis
Arno Pauly
Florian Steinberg
OriginalPaper Open access 12 January 2017 Pages: 557 - 582
On Slepian–Wolf Theorem with Interaction
Alexander Kozachinskiy
OriginalPaper 07 January 2017 Pages: 583 - 599
Computing and Listing st-Paths in Public Transportation Networks
Kateřina Böhmová
Luca Häfliger
Marie-France Sagot
OriginalPaper 11 January 2017 Pages: 600 - 621
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
Meena Mahajan
Nitin Saurabh
OriginalPaper 13 March 2017 Pages: 622 - 652
Prediction of Infinite Words with Automata
Tim Smith
OriginalPaper 12 December 2016 Pages: 653 - 681
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
Manfred Kufleitner
Jan Philipp Wächter
OriginalPaper 16 May 2017 Pages: 682 - 738
Parameterizing Edge Modification Problems Above Lower Bounds
René van Bevern
Vincent Froese
Christian Komusiewicz
OriginalPaper 18 January 2017 Pages: 739 - 770

Volume 62, Issue 3

Search

Navigation