| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An improved algorithm for the minmax regret path center problem on trees
|
Wang, Biing-Feng
|
|
|
114 |
C |
p. 36-47
|
artikel
|
| 2 |
Counting and enumerating tree-child networks and their subclasses
|
Cardona, Gabriel
|
|
|
114 |
C |
p. 84-104
|
artikel
|
| 3 |
Editorial Board
|
|
|
|
114 |
C |
p. ii
|
artikel
|
| 4 |
How fast can we reach a target vertex in stochastic temporal graphs?
|
Akrida, Eleni C.
|
|
|
114 |
C |
p. 65-83
|
artikel
|
| 5 |
Secure-channel free searchable encryption with multiple keywords: A generic construction, an instantiation, and its implementation
|
Emura, Keita
|
|
|
114 |
C |
p. 107-125
|
artikel
|
| 6 |
Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017
|
Klasing, Ralf
|
|
|
114 |
C |
p. 105-106
|
artikel
|
| 7 |
Space efficient representations of finite groups
|
Das, Bireswar
|
|
|
114 |
C |
p. 137-146
|
artikel
|
| 8 |
Tight hierarchy of data-independent multi-head automata
|
Ďuriš, Pavol
|
|
|
114 |
C |
p. 126-136
|
artikel
|
| 9 |
Unique end of potential line
|
Fearnley, John
|
|
|
114 |
C |
p. 1-35
|
artikel
|
| 10 |
Universal stability in multi-hop radio networks
|
Chlebus, Bogdan S.
|
|
|
114 |
C |
p. 48-64
|
artikel
|
Tijdschrift beschrijving