| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Addition machines, automatic functions and open problems of Floyd and Knuth
|
Jain, Sanjay
|
|
|
136 |
C |
p. 135-156
|
article
|
| 2 |
Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words
|
Adsul, Bharat
|
|
|
136 |
C |
p. 302-326
|
article
|
| 3 |
Complexity of verification in self-assembly with prebuilt assemblies
|
Caballero, David
|
|
|
136 |
C |
p. 1-16
|
article
|
| 4 |
Controlling entity integrity with key sets
|
Hannula, Miika
|
|
|
136 |
C |
p. 195-219
|
article
|
| 5 |
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes
|
Jacob, Ashwin
|
|
|
136 |
C |
p. 280-301
|
article
|
| 6 |
Editorial Board
|
|
|
|
136 |
C |
p. ii
|
article
|
| 7 |
From symmetry to asymmetry: Generalizing TSP approximations by parametrization
|
Behrendt, Lukas
|
|
|
136 |
C |
p. 157-170
|
article
|
| 8 |
Galactic token sliding
|
Bartier, Valentin
|
|
|
136 |
C |
p. 220-248
|
article
|
| 9 |
Grid recognition: Classical and parameterized computational perspectives
|
Gupta, Siddharth
|
|
|
136 |
C |
p. 17-62
|
article
|
| 10 |
Markov chains and unambiguous automata
|
Baier, Christel
|
|
|
136 |
C |
p. 113-134
|
article
|
| 11 |
Parameterized complexity of categorical clustering with size constraints
|
Fomin, Fedor V.
|
|
|
136 |
C |
p. 171-194
|
article
|
| 12 |
Reducing the vertex cover number via edge contractions
|
Lima, Paloma T.
|
|
|
136 |
C |
p. 63-87
|
article
|
| 13 |
Synchronizing Boolean networks asynchronously
|
Aracena, Julio
|
|
|
136 |
C |
p. 249-279
|
article
|
| 14 |
The 2CNF Boolean formula satisfiability problem and the linear space hypothesis
|
Yamakami, Tomoyuki
|
|
|
136 |
C |
p. 88-112
|
article
|
Journal description