| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A faster algorithm for the resource allocation problem with convex cost functions
|
Shi, Cong
|
|
2015
|
34 |
C |
p. 137-146
10 p.
|
artikel
|
| 2 |
Alphabet-independent algorithms for finding context-sensitive repeats in linear time
|
Ohlebusch, Enno
|
|
2015
|
34 |
C |
p. 23-36
14 p.
|
artikel
|
| 3 |
A note on the longest common compatible prefix problem for partial words
|
Crochemore, M.
|
|
2015
|
34 |
C |
p. 49-53
5 p.
|
artikel
|
| 4 |
A top down algorithm for constrained tree inclusion
|
Hsiao, Yu-Hsiang
|
|
2015
|
34 |
C |
p. 62-69
8 p.
|
artikel
|
| 5 |
Dynamic edit distance table under a general weighted cost function
|
Hyyrö, Heikki
|
|
2015
|
34 |
C |
p. 2-17
16 p.
|
artikel
|
| 6 |
Editorial
|
Bannai, Hideo
|
|
2015
|
34 |
C |
p. 1-
1 p.
|
artikel
|
| 7 |
Editorial Board
|
|
|
2015
|
34 |
C |
p. iii-
1 p.
|
artikel
|
| 8 |
Interval graph representation with given interval and intersection lengths
|
Köbler, Johannes
|
|
2015
|
34 |
C |
p. 108-117
10 p.
|
artikel
|
| 9 |
k-Abelian pattern matching
|
Ehlers, Thorsten
|
|
2015
|
34 |
C |
p. 37-48
12 p.
|
artikel
|
| 10 |
On a lemma of Crochemore and Rytter
|
Bai, Haoyue
|
|
2015
|
34 |
C |
p. 18-22
5 p.
|
artikel
|
| 11 |
On the hardness of full Steiner tree problems
|
Biniaz, Ahmad
|
|
2015
|
34 |
C |
p. 118-127
10 p.
|
artikel
|
| 12 |
On the kernel size of clique cover reductions for random intersection graphs
|
Friedrich, Tobias
|
|
2015
|
34 |
C |
p. 128-136
9 p.
|
artikel
|
| 13 |
The greedy approach to dictionary-based static text compression on a distributed system
|
De Agostino, Sergio
|
|
2015
|
34 |
C |
p. 54-61
8 p.
|
artikel
|
| 14 |
Tree based symmetric key broadcast encryption
|
Bhattacherjee, Sanjay
|
|
2015
|
34 |
C |
p. 78-107
30 p.
|
artikel
|
| 15 |
Uniqueness of Butson Hadamard matrices of small degrees
|
Hirasaka, Mitsugu
|
|
2015
|
34 |
C |
p. 70-77
8 p.
|
artikel
|
Tijdschrift beschrijving