| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Comparing Representations for Function Spaces in Computable Analysis
|
Pauly, Arno
|
|
2017
|
62 |
3 |
p. 557-582
|
article
|
| 2 |
Computing and Listing st-Paths in Public Transportation Networks
|
Böhmová, Kateřina
|
|
2017
|
62 |
3 |
p. 600-621
|
article
|
| 3 |
Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems
|
Nutov, Zeev
|
|
2017
|
62 |
3 |
p. 510-532
|
article
|
| 4 |
Level Two of the Quantifier Alternation Hierarchy Over Infinite Words
|
Kufleitner, Manfred
|
|
2017
|
62 |
3 |
p. 467-480
|
article
|
| 5 |
On Approximating (Connected) 2-Edge Dominating Set by a Tree
|
Fujito, Toshihiro
|
|
2017
|
62 |
3 |
p. 533-556
|
article
|
| 6 |
On Slepian–Wolf Theorem with Interaction
|
Kozachinskiy, Alexander
|
|
2017
|
62 |
3 |
p. 583-599
|
article
|
| 7 |
Parameterizing Edge Modification Problems Above Lower Bounds
|
Bevern, René van
|
|
2017
|
62 |
3 |
p. 739-770
|
article
|
| 8 |
Prediction of Infinite Words with Automata
|
Smith, Tim
|
|
2016
|
62 |
3 |
p. 653-681
|
article
|
| 9 |
Preface to the Special Issue on Computer Science in Russia 2016
|
Kulikov, Alexander S.
|
|
2018
|
62 |
3 |
p. 465-466
|
article
|
| 10 |
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
|
Mahajan, Meena
|
|
2017
|
62 |
3 |
p. 622-652
|
article
|
| 11 |
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
|
Kufleitner, Manfred
|
|
2017
|
62 |
3 |
p. 682-738
|
article
|
| 12 |
Tropically Convex Constraint Satisfaction
|
Bodirsky, Manuel
|
|
2017
|
62 |
3 |
p. 481-509
|
article
|
Journal description