| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A faster strongly polynomial time algorithm to solve the minimum cost tension problem
|
Ghiyasvand, Mehdi
|
|
2016
|
34 |
1 |
p. 203-217
|
artikel
|
| 2 |
An exact semidefinite programming approach for the max-mean dispersion problem
|
Garraffa, Michele
|
|
2016
|
34 |
1 |
p. 71-93
|
artikel
|
| 3 |
Approximation algorithms for k-level stochastic facility location problems
|
Melo, Lucas P.
|
|
2016
|
34 |
1 |
p. 266-278
|
artikel
|
| 4 |
Centralized and decentralized rumor blocking problems
|
Chen, Xin
|
|
2016
|
34 |
1 |
p. 314-329
|
artikel
|
| 5 |
Characterizations of k-cutwidth critical trees
|
Zhang, Zhen-Kun
|
|
2016
|
34 |
1 |
p. 233-244
|
artikel
|
| 6 |
Lawler’s minmax cost problem under uncertainty
|
Brauner, Nadia
|
|
2016
|
34 |
1 |
p. 31-46
|
artikel
|
| 7 |
Local ratio method on partial set multi-cover
|
Ran, Yingli
|
|
2016
|
34 |
1 |
p. 302-313
|
artikel
|
| 8 |
Maximizing target-temporal coverage of mission-driven camera sensor networks
|
Hong, Yi
|
|
2016
|
34 |
1 |
p. 279-301
|
artikel
|
| 9 |
Minimizing the number of tardy jobs in two-machine settings with common due date
|
Della Croce, Federico
|
|
2016
|
34 |
1 |
p. 133-140
|
artikel
|
| 10 |
Modified linear programming and class 0 bounds for graph pebbling
|
Cranston, Daniel W.
|
|
2016
|
34 |
1 |
p. 114-132
|
artikel
|
| 11 |
Neighbor sum distinguishing total coloring of 2-degenerate graphs
|
Yao, Jingjing
|
|
2016
|
34 |
1 |
p. 64-70
|
artikel
|
| 12 |
Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
|
Jie, Yingmo
|
|
2016
|
34 |
1 |
p. 245-256
|
artikel
|
| 13 |
Note on incidence chromatic number of subquartic graphs
|
Gregor, Petr
|
|
2016
|
34 |
1 |
p. 174-181
|
artikel
|
| 14 |
On minimally 2-connected graphs with generalized connectivity $$\kappa _{3}=2$$κ3=2
|
Li, Shasha
|
|
2016
|
34 |
1 |
p. 141-164
|
artikel
|
| 15 |
On zero-sum $$\mathbb {Z}_{2j}^k$$Z2jk-magic graphs
|
Georges, J. P.
|
|
2016
|
34 |
1 |
p. 94-113
|
artikel
|
| 16 |
Parameterized algorithms for min–max 2-cluster editing
|
Chen, Li-Hsuan
|
|
2016
|
34 |
1 |
p. 47-63
|
artikel
|
| 17 |
Rainbow connection numbers of Cayley graphs
|
Ma, Yingbin
|
|
2016
|
34 |
1 |
p. 182-193
|
artikel
|
| 18 |
The k-metric dimension
|
Adar, Ron
|
|
2016
|
34 |
1 |
p. 1-30
|
artikel
|
| 19 |
The minimum value of geometric-arithmetic index of graphs with minimum degree 2
|
Sohrabi-Haghighat, Mahdi
|
|
2016
|
34 |
1 |
p. 218-232
|
artikel
|
| 20 |
The thickness of the complete multipartite graphs and the join of graphs
|
Chen, Yichao
|
|
2016
|
34 |
1 |
p. 194-202
|
artikel
|
| 21 |
Total coloring of planar graphs without adjacent chordal 6-cycles
|
Wang, Huijuan
|
|
2016
|
34 |
1 |
p. 257-265
|
artikel
|
| 22 |
Upper bounds of proper connection number of graphs
|
Huang, Fei
|
|
2016
|
34 |
1 |
p. 165-173
|
artikel
|
Tijdschrift beschrijving