nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Ancestors graph and an upper bound for the subword complexity function
|
Guillaume, Delalleau |
|
2013 |
468 |
C |
p. 69-82 14 p. |
artikel |
2 |
A parameterizable enumeration algorithm for sequence mining
|
David, J. |
|
2013 |
468 |
C |
p. 59-68 10 p. |
artikel |
3 |
Approximation schemes for two-agent scheduling on parallel machines
|
Zhao, Kejun |
|
2013 |
468 |
C |
p. 114-121 8 p. |
artikel |
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. |
artikel |
5 |
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case
|
Mou, Chenqi |
|
2013 |
468 |
C |
p. 102-113 12 p. |
artikel |
6 |
Editorial Board
|
|
|
2013 |
468 |
C |
p. iii-viii nvt p. |
artikel |
7 |
Enumeration and structure of trapezoidal words
|
Bucci, Michelangelo |
|
2013 |
468 |
C |
p. 12-22 11 p. |
artikel |
8 |
Exploring pairwise compatibility graphs
|
Calamoneri, T. |
|
2013 |
468 |
C |
p. 23-36 14 p. |
artikel |
9 |
Finding consensus and optimal alignment of circular strings
|
Lee, Taehyung |
|
2013 |
468 |
C |
p. 92-101 10 p. |
artikel |
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. |
artikel |
11 |
On the sensitivity complexity of bipartite graph properties
|
Gao, Yihan |
|
2013 |
468 |
C |
p. 83-91 9 p. |
artikel |
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. |
artikel |