nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A constant-factor approximation for directed latency in quasi-polynomial time
|
Friggstad, Zachary |
|
|
126 |
C |
p. 44-58 |
artikel |
2 |
A secure searchable encryption scheme for cloud using hash-based indexing
|
Andola, Nitish |
|
|
126 |
C |
p. 119-137 |
artikel |
3 |
Complexity of fixed point counting problems in Boolean networks
|
Bridoux, Florian |
|
|
126 |
C |
p. 138-164 |
artikel |
4 |
Editorial Board
|
|
|
|
126 |
C |
p. ii |
artikel |
5 |
Latency, capacity, and distributed minimum spanning trees
|
Augustine, John |
|
|
126 |
C |
p. 1-20 |
artikel |
6 |
Length-bounded cuts: Proper interval graphs and structural parameters
|
Bentert, Matthias |
|
|
126 |
C |
p. 21-43 |
artikel |
7 |
Medians in median graphs and their cube complexes in linear time
|
Bénéteau, Laurine |
|
|
126 |
C |
p. 80-105 |
artikel |
8 |
Multistage knapsack
|
Bampis, Evripidis |
|
|
126 |
C |
p. 106-118 |
artikel |
9 |
Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies
|
Jansen, Bart M.P. |
|
|
126 |
C |
p. 59-79 |
artikel |