| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithms for testing occurrences of length 4 patterns in permutations
|
Han, Yijie
|
|
2017
|
35 |
1 |
p. 189-208
|
artikel
|
| 2 |
A note on domination and total domination in prisms
|
Goddard, Wayne
|
|
2017
|
35 |
1 |
p. 14-20
|
artikel
|
| 3 |
Approximation algorithms for precedence-constrained identical machine scheduling with rejection
|
Zhang, Xianzhao
|
|
2016
|
35 |
1 |
p. 318-330
|
artikel
|
| 4 |
A tight lower bound for the hardness of clutters
|
Mkrtchyan, Vahan
|
|
2017
|
35 |
1 |
p. 21-25
|
artikel
|
| 5 |
Bounds on the domination number of a digraph
|
Hao, Guoliang
|
|
2017
|
35 |
1 |
p. 64-74
|
artikel
|
| 6 |
Closed-loop supply chain inventory management with recovery information of reusable containers
|
Yang, Tianji
|
|
2015
|
35 |
1 |
p. 266-292
|
artikel
|
| 7 |
Competitive intensity and quality maximizing seedings in knock-out tournaments
|
Dagaev, Dmitry
|
|
2017
|
35 |
1 |
p. 170-188
|
artikel
|
| 8 |
Deterministic construction of compressed sensing matrices based on semilattices
|
Guo, Jun
|
|
2017
|
35 |
1 |
p. 148-161
|
artikel
|
| 9 |
GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs
|
Zhao, Yan
|
|
2016
|
35 |
1 |
p. 293-317
|
artikel
|
| 10 |
Harsanyi power solution for games with restricted cooperation
|
Zou, Zhengxing
|
|
2017
|
35 |
1 |
p. 26-47
|
artikel
|
| 11 |
Large even factors of graphs
|
Chen, Jing
|
|
2017
|
35 |
1 |
p. 162-169
|
artikel
|
| 12 |
Nordhaus–Gaddum bounds for total Roman domination
|
Amjadi, J.
|
|
2017
|
35 |
1 |
p. 126-133
|
artikel
|
| 13 |
On general threshold and general cascade models of social influence
|
Wu, Weili
|
|
2017
|
35 |
1 |
p. 209-215
|
artikel
|
| 14 |
Online MapReduce processing on two identical parallel machines
|
Huang, Jidan
|
|
2017
|
35 |
1 |
p. 216-223
|
artikel
|
| 15 |
Partitioning dense uniform hypergraphs
|
Wu, Shufei
|
|
2017
|
35 |
1 |
p. 48-63
|
artikel
|
| 16 |
Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
|
Jovanovic, Raka
|
|
2015
|
35 |
1 |
p. 224-249
|
artikel
|
| 17 |
Rainbow vertex connection of digraphs
|
Lei, Hui
|
|
2017
|
35 |
1 |
p. 86-107
|
artikel
|
| 18 |
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
|
Cheng, Xiaohan
|
|
2017
|
35 |
1 |
p. 1-13
|
artikel
|
| 19 |
The maximum cardinality cut problem in co-bipartite chain graphs
|
Boyacı, Arman
|
|
2015
|
35 |
1 |
p. 250-265
|
artikel
|
| 20 |
Total and forcing total edge-to-vertex monophonic number of a graph
|
John, J.
|
|
2017
|
35 |
1 |
p. 134-147
|
artikel
|
| 21 |
Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
|
Zhong, Weiya
|
|
2017
|
35 |
1 |
p. 108-125
|
artikel
|
| 22 |
Weak {2}-domination number of Cartesian products of cycles
|
Li, Zepeng
|
|
2017
|
35 |
1 |
p. 75-85
|
artikel
|
Tijdschrift beschrijving