| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A degree condition for fractional [a,b]-covered graphs
|
Yuan, Yuan
|
|
2019
|
143 |
C |
p. 20-23
|
artikel
|
| 2 |
A faster algorithm for finding shortest substring matches of a regular expression
|
Yamamoto, Hiroaki
|
|
2019
|
143 |
C |
p. 56-60
|
artikel
|
| 3 |
A note on general epidemic region for infinite regular graphs
|
Yu, Unjong
|
|
2019
|
143 |
C |
p. 41-46
|
artikel
|
| 4 |
A note on the efficiency of position mechanisms with budget constraints
|
Voudouris, Alexandros A.
|
|
2019
|
143 |
C |
p. 28-33
|
artikel
|
| 5 |
Design methods for semi-bent functions
|
Pasalic, E.
|
|
2019
|
143 |
C |
p. 61-70
|
artikel
|
| 6 |
Editorial Board
|
|
|
2019
|
143 |
C |
p. ii
|
artikel
|
| 7 |
Enhanced string factoring from alphabet orderings
|
Clare, Amanda
|
|
2019
|
143 |
C |
p. 4-7
|
artikel
|
| 8 |
Exploiting re-voting in the Helios election system
|
Meyer, Maxime
|
|
2019
|
143 |
C |
p. 14-19
|
artikel
|
| 9 |
Memoryless determinacy of infinite parity games: Another simple proof
|
Le Roux, Stéphane
|
|
2019
|
143 |
C |
p. 8-13
|
artikel
|
| 10 |
Minimizing the solid angle sum of orthogonal polyhedra
|
Aldana-Galván, I.
|
|
2019
|
143 |
C |
p. 47-50
|
artikel
|
| 11 |
New lower bound on the Shannon capacity of C 7 from circular graphs
|
Polak, Sven C.
|
|
2019
|
143 |
C |
p. 37-40
|
artikel
|
| 12 |
On the parameterized complexity of (k,s)-SAT
|
Paulusma, Daniël
|
|
2019
|
143 |
C |
p. 34-36
|
artikel
|
| 13 |
On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
|
Carvalho, Iago A.
|
|
2019
|
143 |
C |
p. 24-27
|
artikel
|
| 14 |
Revisiting explicit adaptive two-probe schemes
|
Nicholson, Patrick K.
|
|
2019
|
143 |
C |
p. 1-3
|
artikel
|
| 15 |
Thin trees in 8-edge-connected planar graphs
|
Mousavi, Ramin
|
|
2019
|
143 |
C |
p. 51-55
|
artikel
|
Tijdschrift beschrijving