| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A new class of zero-difference balanced functions
|
Shen, Lin-Zhi
|
|
2018
|
136 |
C |
p. 9-11
|
artikel
|
| 2 |
An improved FPT algorithm for Almost Forest Deletion problem
|
Lin, Mugang
|
|
2018
|
136 |
C |
p. 30-36
|
artikel
|
| 3 |
Background feature clustering and its application to social text
|
Zhu, Chuangying
|
|
2018
|
136 |
C |
p. 44-48
|
artikel
|
| 4 |
Deep learning algorithm with visual impression
|
Yang, Mengduo
|
|
2018
|
136 |
C |
p. 1-4
|
artikel
|
| 5 |
Differential-linear and related key cryptanalysis of round-reduced scream
|
Dwivedi, Ashutosh Dhar
|
|
2018
|
136 |
C |
p. 5-8
|
artikel
|
| 6 |
Editorial Board
|
|
|
2018
|
136 |
C |
p. ii
|
artikel
|
| 7 |
Geometric medians in reconciliation spaces of phylogenetic trees
|
Huber, Katharina T.
|
|
2018
|
136 |
C |
p. 96-101
|
artikel
|
| 8 |
Lie group impression for deep learning
|
Yang, Mengduo
|
|
2018
|
136 |
C |
p. 12-16
|
artikel
|
| 9 |
Light paths and edges in families of outer-1-planar graphs
|
Zhang, Xin
|
|
2018
|
136 |
C |
p. 83-89
|
artikel
|
| 10 |
Maximum matching and kernelization of edge dominating set
|
Gao, Hang
|
|
2018
|
136 |
C |
p. 21-24
|
artikel
|
| 11 |
Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements
|
Hoffmann, Stefan
|
|
2018
|
136 |
C |
p. 25-29
|
artikel
|
| 12 |
On semantic cutting planes with very small coefficients
|
Lauria, Massimo
|
|
2018
|
136 |
C |
p. 70-75
|
artikel
|
| 13 |
On the largest matching roots of graphs with cut edges
|
Zhang, Hailiang
|
|
2018
|
136 |
C |
p. 41-43
|
artikel
|
| 14 |
Prediction from partial information and hindsight, an alternative proof
|
Smal, Alexander V.
|
|
2018
|
136 |
C |
p. 102-104
|
artikel
|
| 15 |
Shape diameter for object analysis
|
Žunić, Anastazia
|
|
2018
|
136 |
C |
p. 76-79
|
artikel
|
| 16 |
The connectivity of generalized graph products
|
Li, Xiaomin
|
|
2018
|
136 |
C |
p. 37-40
|
artikel
|
| 17 |
The direct sum of universal relations
|
Meir, Or
|
|
2018
|
136 |
C |
p. 105-111
|
artikel
|
| 18 |
The language preservation problem is undecidable for parametric event-recording automata
|
André, Étienne
|
|
2018
|
136 |
C |
p. 17-20
|
artikel
|
| 19 |
The number of spanning trees of a class of self-similar fractal models
|
Ma, Fei
|
|
2018
|
136 |
C |
p. 64-69
|
artikel
|
| 20 |
The optimal routing of augmented cubes
|
Chen, Meirun
|
|
2018
|
136 |
C |
p. 59-63
|
artikel
|
| 21 |
The pessimistic diagnosability of Split-Star Networks under the PMC model
|
Chen, Jing
|
|
2018
|
136 |
C |
p. 80-82
|
artikel
|
| 22 |
Use of logical models for proving infeasibility in term rewriting
|
Lucas, Salvador
|
|
2018
|
136 |
C |
p. 90-95
|
artikel
|
| 23 |
Why locality sensitive hashing works: A practical perspective
|
Lu, Kejing
|
|
2018
|
136 |
C |
p. 49-58
|
artikel
|
Tijdschrift beschrijving