nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A fast algorithm for the gas station problem
|
Papadopoulos, Kleitos |
|
2018 |
131 |
C |
p. 55-59 |
artikel |
2 |
An improved algorithm for computing a shortest watchman route for lines
|
Tan, Xuehou |
|
2018 |
131 |
C |
p. 51-54 |
artikel |
3 |
A note on monotone real circuits
|
Hrubeš, Pavel |
|
2018 |
131 |
C |
p. 15-19 |
artikel |
4 |
Balanced allocation through random walk
|
Frieze, Alan |
|
2018 |
131 |
C |
p. 39-43 |
artikel |
5 |
Editorial Board
|
|
|
2018 |
131 |
C |
p. ii |
artikel |
6 |
Efficient multiplier based on hybrid approach for Toeplitz matrix–vector product
|
Chang, Ku-Young |
|
2018 |
131 |
C |
p. 33-38 |
artikel |
7 |
Fast intra prediction method by adaptive number of candidate modes for RDO in HEVC
|
Chung, Byungjin |
|
2018 |
131 |
C |
p. 20-25 |
artikel |
8 |
Independent feedback vertex sets for graphs of bounded diameter
|
Bonamy, Marthe |
|
2018 |
131 |
C |
p. 26-32 |
artikel |
9 |
Inefficiencies in network models: A graph-theoretic perspective
|
Cenciarelli, Pietro |
|
2018 |
131 |
C |
p. 44-50 |
artikel |
10 |
On minimal connectivity requirements for secure message transmission in directed networks
|
Kishore, Ravi |
|
2018 |
131 |
C |
p. 1-6 |
artikel |
11 |
Recognizing Union-Find trees is NP-complete
|
Gelle, Kitti |
|
2018 |
131 |
C |
p. 7-14 |
artikel |