| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Abstract geometrical computation 8: Small machines, accumulations & rationality
|
Becker, Florent
|
|
2018
|
97 |
C |
p. 182-198
|
article
|
| 2 |
AC0∘MOD2 lower bounds for the Boolean Inner Product
|
Cheraghchi, Mahdi
|
|
2018
|
97 |
C |
p. 45-59
|
article
|
| 3 |
An improved algorithm for the minmax regret path centdian problem on trees
|
Ye, Jhih-Hong
|
|
2018
|
97 |
C |
p. 94-105
|
article
|
| 4 |
A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees
|
Shi, Feng
|
|
2018
|
97 |
C |
p. 28-44
|
article
|
| 5 |
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
|
Eiben, Eduard
|
|
2018
|
97 |
C |
p. 121-146
|
article
|
| 6 |
Editorial Board
|
|
|
2018
|
97 |
C |
p. ii
|
article
|
| 7 |
Finding even subgraphs even faster
|
Goyal, Prachi
|
|
2018
|
97 |
C |
p. 1-13
|
article
|
| 8 |
Optimal separation in exact query complexities for Simon's problem
|
Cai, Guangya
|
|
2018
|
97 |
C |
p. 83-93
|
article
|
| 9 |
Strong bounds for evolution in networks
|
Mertzios, George B.
|
|
2018
|
97 |
C |
p. 60-82
|
article
|
| 10 |
Towards a characterization of constant-factor approximable finite-valued CSPs
|
Dalmau, Víctor
|
|
2018
|
97 |
C |
p. 14-27
|
article
|
| 11 |
Visibly pushdown transducers
|
Filiot, Emmanuel
|
|
2018
|
97 |
C |
p. 147-181
|
article
|
| 12 |
What can be verified locally?
|
Balliu, Alkida
|
|
2018
|
97 |
C |
p. 106-120
|
article
|
Journal description