| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Ancestors graph and an upper bound for the subword complexity function
|
Guillaume, Delalleau
|
|
2013
|
468 |
C |
p. 69-82
14 p.
|
article
|
| 2 |
A parameterizable enumeration algorithm for sequence mining
|
David, J.
|
|
2013
|
468 |
C |
p. 59-68
10 p.
|
article
|
| 3 |
Approximation schemes for two-agent scheduling on parallel machines
|
Zhao, Kejun
|
|
2013
|
468 |
C |
p. 114-121
8 p.
|
article
|
| 4 |
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
|
Chang, Ching-Lueh
|
|
2013
|
468 |
C |
p. 37-49
13 p.
|
article
|
| 5 |
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case
|
Mou, Chenqi
|
|
2013
|
468 |
C |
p. 102-113
12 p.
|
article
|
| 6 |
Editorial Board
|
|
|
2013
|
468 |
C |
p. iii-viii
nvt p.
|
article
|
| 7 |
Enumeration and structure of trapezoidal words
|
Bucci, Michelangelo
|
|
2013
|
468 |
C |
p. 12-22
11 p.
|
article
|
| 8 |
Exploring pairwise compatibility graphs
|
Calamoneri, T.
|
|
2013
|
468 |
C |
p. 23-36
14 p.
|
article
|
| 9 |
Finding consensus and optimal alignment of circular strings
|
Lee, Taehyung
|
|
2013
|
468 |
C |
p. 92-101
10 p.
|
article
|
| 10 |
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata
|
Briceño, Raimundo
|
|
2013
|
468 |
C |
p. 1-11
11 p.
|
article
|
| 11 |
On the sensitivity complexity of bipartite graph properties
|
Gao, Yihan
|
|
2013
|
468 |
C |
p. 83-91
9 p.
|
article
|
| 12 |
Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks
|
Chen, Yebin
|
|
2013
|
468 |
C |
p. 50-58
9 p.
|
article
|
Journal description