nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algorithms to compute the Burrows-Wheeler Similarity Distribution
|
Louza, Felipe A. |
|
2019 |
782 |
C |
p. 145-156 |
artikel |
2 |
A new coding-based algorithm for finding closest pair of vectors
|
Xie, Ning |
|
2019 |
782 |
C |
p. 129-144 |
artikel |
3 |
Editorial Board
|
|
|
2019 |
782 |
C |
p. ii |
artikel |
4 |
Fast exact algorithms for some connectivity problems parameterized by clique-width
|
Bergougnoux, Benjamin |
|
2019 |
782 |
C |
p. 30-53 |
artikel |
5 |
Fast solution of single-machine scheduling problem with embedded jobs
|
Vakhania, Nodari |
|
2019 |
782 |
C |
p. 91-106 |
artikel |
6 |
Nondeterministic communication complexity with help and graph functions
|
Shraibman, Adi |
|
2019 |
782 |
C |
p. 1-10 |
artikel |
7 |
On structural parameterizations of firefighting
|
Das, Bireswar |
|
2019 |
782 |
C |
p. 79-90 |
artikel |
8 |
Randomness of formal languages via automatic martingales
|
Moldagaliyev, Birzhan |
|
2019 |
782 |
C |
p. 113-128 |
artikel |
9 |
The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs
|
Cohen, Johanne |
|
2019 |
782 |
C |
p. 54-78 |
artikel |
10 |
Unary Watson-Crick automata
|
Chatterjee, Kingshuk |
|
2019 |
782 |
C |
p. 107-112 |
artikel |
11 |
Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees
|
Bentz, Cédric |
|
2019 |
782 |
C |
p. 11-29 |
artikel |