| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
|
Ye, Mengdie
|
|
|
346 |
C |
p. 95-114
|
artikel
|
| 2 |
An embedding technique in the study of word-representability of graphs
|
Huang, Sumin
|
|
|
346 |
C |
p. 170-182
|
artikel
|
| 3 |
A notion of vertex equitability for proper labellings
|
Bensmail, Julien
|
|
|
346 |
C |
p. 228-247
|
artikel
|
| 4 |
Complete bipartite graphs without small rainbow subgraphs
|
Ma, Zhiqiang
|
|
|
346 |
C |
p. 248-262
|
artikel
|
| 5 |
Editorial Board
|
|
|
|
346 |
C |
p. ii
|
artikel
|
| 6 |
Formulations for the maximum common edge subgraph problem
|
de Gastines, Etienne
|
|
|
346 |
C |
p. 115-130
|
artikel
|
| 7 |
FPT algorithms for packing k -safe spanning rooted sub(di)graphs
|
Bessy, Stéphane
|
|
|
346 |
C |
p. 80-94
|
artikel
|
| 8 |
Incomplete cooperative games with player-centered information
|
Černý, Martin
|
|
|
346 |
C |
p. 62-79
|
artikel
|
| 9 |
Induced forests in some distance-regular graphs
|
Gunderson, Karen
|
|
|
346 |
C |
p. 290-300
|
artikel
|
| 10 |
Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
|
Gauthier, Jean Bertrand
|
|
|
346 |
C |
p. 131-153
|
artikel
|
| 11 |
Kernelization for feedback vertex set via elimination distance to a forest
|
Dekker, David J.C.
|
|
|
346 |
C |
p. 192-214
|
artikel
|
| 12 |
Minimum number of maximal dissociation sets in trees
|
Zhang, Junxia
|
|
|
346 |
C |
p. 272-278
|
artikel
|
| 13 |
Non-crossing shortest paths lengths in planar graphs in linear time
|
Balzotti, Lorenzo
|
|
|
346 |
C |
p. 183-191
|
artikel
|
| 14 |
On the AVDTC of Sierpiński-type graphs
|
Palma, Miguel A.D.R.
|
|
|
346 |
C |
p. 10-29
|
artikel
|
| 15 |
On unimodular graphs with a unique perfect matching
|
Basumatary, Parameswar
|
|
|
346 |
C |
p. 49-61
|
artikel
|
| 16 |
Paintability of complete bipartite graphs
|
Kashima, Masaki
|
|
|
346 |
C |
p. 279-289
|
artikel
|
| 17 |
Partition line graphs of multigraphs into two subgraphs with large chromatic numbers
|
Lv, Jian-Bo
|
|
|
346 |
C |
p. 44-48
|
artikel
|
| 18 |
Relations of three classes of disconnected coloring
|
Li, Ping
|
|
|
346 |
C |
p. 263-271
|
artikel
|
| 19 |
Safe sets and in-dominating sets in digraphs
|
Bai, Yandong
|
|
|
346 |
C |
p. 215-227
|
artikel
|
| 20 |
Sprague–Grundy values and complexity for LCTR
|
Gottlieb, Eric
|
|
|
346 |
C |
p. 154-169
|
artikel
|
| 21 |
The structure of minimally t -tough, 2 K 2 -free graphs
|
Ma, Hui
|
|
|
346 |
C |
p. 1-9
|
artikel
|
| 22 |
Two-machine job-shop scheduling with one joint job
|
Numaguchi, Hiroki
|
|
|
346 |
C |
p. 30-43
|
artikel
|
Tijdschrift beschrijving