Journal: Theory Comput. Syst.

Volume 62, Issue 3

465 -- 466Alexander S. Kulikov, Gerhard J. Woeginger. Preface to the Special Issue on Computer Science in Russia 2016
467 -- 480Manfred Kufleitner, Tobias Walter. Level Two of the Quantifier Alternation Hierarchy Over Infinite Words
481 -- 509Manuel Bodirsky, Marcello Mamino. Tropically Convex Constraint Satisfaction
510 -- 532Zeev Nutov. Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems
533 -- 556Toshihiro Fujito, Tomoaki Shimoda. On Approximating (Connected) 2-Edge Dominating Set by a Tree
557 -- 582Arno Pauly, Florian Steinberg. Comparing Representations for Function Spaces in Computable Analysis
583 -- 599Alexander Kozachinskiy. On Slepian-Wolf Theorem with Interaction
600 -- 621Katerina Böhmová, Luca Häfliger, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot. Computing and Listing st-Paths in Public Transportation Networks
622 -- 652Meena Mahajan, Nitin Saurabh. Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
653 -- 681Tim Smith. Prediction of Infinite Words with Automata
682 -- 738Manfred Kufleitner, Jan Philipp Wächter. The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
739 -- 770René van Bevern, Vincent Froese, Christian Komusiewicz. Parameterizing Edge Modification Problems Above Lower Bounds