| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Computing partial hypergraphs of bounded width
|
Adrar, Nabil
|
|
|
329 |
C |
p. 1-22
|
artikel
|
| 2 |
Editorial Board
|
|
|
|
329 |
C |
p. ii
|
artikel
|
| 3 |
In-depth analysis of granular local search for capacitated vehicle routing
|
Becker, Christian
|
|
|
329 |
C |
p. 61-86
|
artikel
|
| 4 |
Models and algorithms for the Weighted Safe Set Problem
|
Malaguti, Enrico
|
|
|
329 |
C |
p. 23-34
|
artikel
|
| 5 |
Neighbor-distinguishing indices of planar graphs with maximum degree ten
|
Huang, Danjun
|
|
|
329 |
C |
p. 49-60
|
artikel
|
| 6 |
On distance magic circulants of valency 6
|
Miklavič, Štefko
|
|
|
329 |
C |
p. 35-48
|
artikel
|
| 7 |
On redundant locating-dominating sets
|
Jean, Devin C.
|
|
|
329 |
C |
p. 106-125
|
artikel
|
| 8 |
On the pushable chromatic number of various types of grids
|
Bensmail, Julien
|
|
|
329 |
C |
p. 140-154
|
artikel
|
| 9 |
Reconfiguration graphs of zero forcing sets
|
Geneson, Jesse
|
|
|
329 |
C |
p. 126-139
|
artikel
|
| 10 |
Strict neighbor-distinguishing index of K 4 -minor-free graphs
|
Gu, Jing
|
|
|
329 |
C |
p. 87-95
|
artikel
|
| 11 |
Vizing’s adjacency lemma on edge chromatic critical signed graphs and its applications
|
Cao, Yan
|
|
|
329 |
C |
p. 96-105
|
artikel
|
Tijdschrift beschrijving