| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
|
Galanis, Andreas
|
|
|
115 |
C |
p. 187-213
|
article
|
| 2 |
Assigning times to minimise reachability in temporal graphs
|
Enright, Jessica
|
|
|
115 |
C |
p. 169-186
|
article
|
| 3 |
Attack and defense in the layered cyber-security model and their (1 ± ϵ)-approximation schemes
|
Mukdasanit, Supachai
|
|
|
115 |
C |
p. 54-63
|
article
|
| 4 |
Circular pattern matching with k mismatches
|
Charalampopoulos, Panagiotis
|
|
|
115 |
C |
p. 73-85
|
article
|
| 5 |
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
|
Bollig, Benedikt
|
|
|
115 |
C |
p. 22-53
|
article
|
| 6 |
Deciding the point-to-fixed-point problem for skew tent maps on an interval
|
Kuijpers, Bart
|
|
|
115 |
C |
p. 113-120
|
article
|
| 7 |
Deterministic protocols in the SINR model without knowledge of coordinates
|
Moses Jr., William K.
|
|
|
115 |
C |
p. 121-145
|
article
|
| 8 |
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
|
Zhao, Shuang
|
|
|
115 |
C |
p. 64-72
|
article
|
| 9 |
Editorial Board
|
|
|
|
115 |
C |
p. ii
|
article
|
| 10 |
Equivalence of pushdown automata via first-order grammars
|
Jančar, Petr
|
|
|
115 |
C |
p. 86-112
|
article
|
| 11 |
Largest common prefix of a regular tree language
|
Lohrey, Markus
|
|
|
115 |
C |
p. 235-245
|
article
|
| 12 |
On the fast delivery problem with one or two packages
|
Carvalho, Iago A.
|
|
|
115 |
C |
p. 246-263
|
article
|
| 13 |
Preimage problems for deterministic finite automata
|
Berlinkov, Mikhail V.
|
|
|
115 |
C |
p. 214-234
|
article
|
| 14 |
Searching by heterogeneous agents
|
Dereniowski, Dariusz
|
|
|
115 |
C |
p. 1-21
|
article
|
| 15 |
Understanding PPA-completeness
|
Deng, Xiaotie
|
|
|
115 |
C |
p. 146-168
|
article
|
Journal description