| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A coordination mechanism for a scheduling game with parallel-batching machines
|
Nong, Q. Q.
|
|
2015
|
33 |
2 |
p. 567-579
|
artikel
|
| 2 |
A heuristic for the time constrained asymmetric linear sum assignment problem
|
Brown, Peter
|
|
2015
|
33 |
2 |
p. 551-566
|
artikel
|
| 3 |
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis
|
Johnsen, Aleck
|
|
2015
|
33 |
2 |
p. 496-529
|
artikel
|
| 4 |
An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
|
Gu, Manzhan
|
|
2015
|
33 |
2 |
p. 473-495
|
artikel
|
| 5 |
An improved parameterized algorithm for the p-cluster vertex deletion problem
|
Wu, Bang Ye
|
|
2015
|
33 |
2 |
p. 373-388
|
artikel
|
| 6 |
Anti-forcing spectra of perfect matchings of graphs
|
Deng, Kai
|
|
2015
|
33 |
2 |
p. 660-680
|
artikel
|
| 7 |
Approximation algorithm for partial positive influence problem in social network
|
Ran, Yingli
|
|
2016
|
33 |
2 |
p. 791-802
|
artikel
|
| 8 |
Approximation algorithms for pricing with negative network externalities
|
Cao, Zhigang
|
|
2016
|
33 |
2 |
p. 681-712
|
artikel
|
| 9 |
Complexity properties of complementary prisms
|
Duarte, Marcio Antônio
|
|
2015
|
33 |
2 |
p. 365-372
|
artikel
|
| 10 |
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
|
Salmerón, J. M. G.
|
|
2015
|
33 |
2 |
p. 389-402
|
artikel
|
| 11 |
Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks
|
Zakouni, Amiyne
|
|
2016
|
33 |
2 |
p. 726-741
|
artikel
|
| 12 |
Handling precedence constraints in scheduling problems by the sequence pair representation
|
Kozik, Andrzej
|
|
2015
|
33 |
2 |
p. 445-472
|
artikel
|
| 13 |
Matching colored points with rectangles
|
Caraballo, L. E.
|
|
2015
|
33 |
2 |
p. 403-421
|
artikel
|
| 14 |
Maximum cardinality neighbourly sets in quadrilateral free graphs
|
Neethi, K. S.
|
|
2015
|
33 |
2 |
p. 422-444
|
artikel
|
| 15 |
More bounds for the Grundy number of graphs
|
Tang, Zixing
|
|
2015
|
33 |
2 |
p. 580-589
|
artikel
|
| 16 |
Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
|
Santos, Rafael F.
|
|
2016
|
33 |
2 |
p. 742-778
|
artikel
|
| 17 |
Online bin packing problem with buffer and bounded size revisited
|
Zhang, Minghui
|
|
2015
|
33 |
2 |
p. 530-542
|
artikel
|
| 18 |
Online MapReduce scheduling problem of minimizing the makespan
|
Chen, Cong
|
|
2015
|
33 |
2 |
p. 590-608
|
artikel
|
| 19 |
On nonlinear multi-covering problems
|
Cohen, Reuven
|
|
2015
|
33 |
2 |
p. 645-659
|
artikel
|
| 20 |
On (s, t)-relaxed strong edge-coloring of graphs
|
He, Dan
|
|
2015
|
33 |
2 |
p. 609-625
|
artikel
|
| 21 |
Resource constrained scheduling with general truncated job-dependent learning effect
|
He, Hongyu
|
|
2015
|
33 |
2 |
p. 626-644
|
artikel
|
| 22 |
Roman game domination number of a graph
|
Bahremandpour, A.
|
|
2016
|
33 |
2 |
p. 713-725
|
artikel
|
| 23 |
Solution of Bharathi–Kempe–Salek conjecture for influence maximization on arborescence
|
Lu, Zaixin
|
|
2016
|
33 |
2 |
p. 803-808
|
artikel
|
| 24 |
The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
|
Sun, Lin
|
|
2016
|
33 |
2 |
p. 779-790
|
artikel
|
| 25 |
Trinque problem: covering complete graphs by plane degree-bounded hypergraphs
|
Charpentier, Clément
|
|
2015
|
33 |
2 |
p. 543-550
|
artikel
|
Tijdschrift beschrijving