| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A parallel algorithm for constructing independent spanning trees in twisted cubes
|
Chang, Jou-Ming
|
|
2017
|
219 |
C |
p. 74-82
9 p.
|
artikel
|
| 2 |
Approximate association via dissociation
|
You, Jie
|
|
2017
|
219 |
C |
p. 202-209
8 p.
|
artikel
|
| 3 |
Branch-and-cut approaches for p -Cluster Editing
|
Bulhões, Teobaldo
|
|
2017
|
219 |
C |
p. 51-64
14 p.
|
artikel
|
| 4 |
Cacti with maximum eccentricity resistance-distance sum
|
He, Fangguo
|
|
2017
|
219 |
C |
p. 117-125
9 p.
|
artikel
|
| 5 |
Complete weight enumerators of some irreducible cyclic codes
|
Shi, Zexia
|
|
2017
|
219 |
C |
p. 182-192
11 p.
|
artikel
|
| 6 |
Complexity of rainbow vertex connectivity problems for restricted graph classes
|
Lauri, Juho
|
|
2017
|
219 |
C |
p. 132-146
15 p.
|
artikel
|
| 7 |
Constructing completely independent spanning trees in crossed cubes
|
Cheng, Baolei
|
|
2017
|
219 |
C |
p. 100-109
10 p.
|
artikel
|
| 8 |
Contents
|
|
|
2017
|
219 |
C |
p. v-vi
nvt p.
|
artikel
|
| 9 |
Corrigendum to “Characterization of polynomially complete quasigroups based on latin squares for cryptographic transformations” [Discrete Appl. Math. 200 (2016) 5–17]
|
Artamonov, V.A.
|
|
2017
|
219 |
C |
p. 222-
1 p.
|
artikel
|
| 10 |
Discounted tree solutions
|
Béal, Sylvain
|
|
2017
|
219 |
C |
p. 1-17
17 p.
|
artikel
|
| 11 |
Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events
|
Lee, Jinwook
|
|
2017
|
219 |
C |
p. 210-218
9 p.
|
artikel
|
| 12 |
Finding a non-minority ball with majority answers
|
Gerbner, Dániel
|
|
2017
|
219 |
C |
p. 18-31
14 p.
|
artikel
|
| 13 |
Implicit degree condition for hamiltonicity of 2-heavy graphs
|
Huang, Xing
|
|
2017
|
219 |
C |
p. 126-131
6 p.
|
artikel
|
| 14 |
Majority dynamics with one nonconformist
|
Haslegrave, John
|
|
2017
|
219 |
C |
p. 32-39
8 p.
|
artikel
|
| 15 |
Misère Nim with multi-player
|
Liu, Wen An
|
|
2017
|
219 |
C |
p. 40-50
11 p.
|
artikel
|
| 16 |
New transience bounds for max-plus linear systems
|
Charron-Bost, Bernadette
|
|
2017
|
219 |
C |
p. 83-99
17 p.
|
artikel
|
| 17 |
Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes
|
Mollard, Michel
|
|
2017
|
219 |
C |
p. 219-221
3 p.
|
artikel
|
| 18 |
Nordhaus–Gaddum-type results for the Steiner Wiener index of graphs
|
Mao, Yaping
|
|
2017
|
219 |
C |
p. 167-175
9 p.
|
artikel
|
| 19 |
On the independence transversal total domination number of graphs
|
Cabrera Martínez, Abel
|
|
2017
|
219 |
C |
p. 65-73
9 p.
|
artikel
|
| 20 |
Optimal binary codes from trace codes over a non-chain ring
|
Shi, Minjia
|
|
2017
|
219 |
C |
p. 176-181
6 p.
|
artikel
|
| 21 |
Sequence mixed graphs
|
Dalfó, C.
|
|
2017
|
219 |
C |
p. 110-116
7 p.
|
artikel
|
| 22 |
The changes in distance Laplacian spectral radius of graphs resulting from graft transformations
|
Lin, Hongying
|
|
2017
|
219 |
C |
p. 147-157
11 p.
|
artikel
|
| 23 |
The wide-diameter of Z n , k
|
Qi, Hao
|
|
2017
|
219 |
C |
p. 193-201
9 p.
|
artikel
|
| 24 |
Two complexity results for the vertex coloring problem
|
Malyshev, D.S.
|
|
2017
|
219 |
C |
p. 158-166
9 p.
|
artikel
|
Tijdschrift beschrijving