| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A $$(3,1)^{*}$$(3,1)∗-choosable theorem on planar graphs
|
Chen, Min
|
|
2015
|
32 |
3 |
p. 927-940
|
artikel
|
| 2 |
A combinatorial proof for the circular chromatic number of Kneser graphs
|
Liu, Daphne Der-Fen
|
|
2015
|
32 |
3 |
p. 765-774
|
artikel
|
| 3 |
A diagnosis algorithm by using graph-coloring under the PMC model
|
Zhu, Qiang
|
|
2015
|
32 |
3 |
p. 960-969
|
artikel
|
| 4 |
A minimized-rule based approach for improving data currency
|
Li, Mohan
|
|
2015
|
32 |
3 |
p. 812-841
|
artikel
|
| 5 |
Characterisation of forests with trivial game domination numbers
|
Nadjafi-Arani, M. J.
|
|
2015
|
32 |
3 |
p. 800-811
|
artikel
|
| 6 |
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
|
Kacem, Imed
|
|
2015
|
32 |
3 |
p. 970-981
|
artikel
|
| 7 |
Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
|
Ma, Shasha
|
|
2015
|
32 |
3 |
p. 725-740
|
artikel
|
| 8 |
Finding a contra-risk path between two nodes in undirected graphs
|
Ghiyasvand, Mehdi
|
|
2015
|
32 |
3 |
p. 917-926
|
artikel
|
| 9 |
First-Fit colorings of graphs with no cycles of a prescribed even length
|
Zaker, Manouchehr
|
|
2015
|
32 |
3 |
p. 775-783
|
artikel
|
| 10 |
Improved algorithmic results for unsplittable stable allocation problems
|
Cseh, Ágnes
|
|
2015
|
32 |
3 |
p. 657-671
|
artikel
|
| 11 |
Maximum size of digraphs with some parameters
|
Lin, Huiqiu
|
|
2015
|
32 |
3 |
p. 941-950
|
artikel
|
| 12 |
Neighbor sum distinguishing total choosability of planar graphs
|
Qu, Cunquan
|
|
2015
|
32 |
3 |
p. 906-916
|
artikel
|
| 13 |
On strongly planar not-all-equal 3SAT
|
Dehghan, Ali
|
|
2015
|
32 |
3 |
p. 721-724
|
artikel
|
| 14 |
Packing feedback arc sets in reducible flow graphs
|
Xiao, Han
|
|
2015
|
32 |
3 |
p. 951-959
|
artikel
|
| 15 |
Robustness of power-law networks: its assessment and optimization
|
Zhang, Huiling
|
|
2015
|
32 |
3 |
p. 696-720
|
artikel
|
| 16 |
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
|
Boland, Natashia
|
|
2015
|
32 |
3 |
p. 885-905
|
artikel
|
| 17 |
Scheduling two job families on a single machine with two competitive agents
|
Li, Shi-Sheng
|
|
2015
|
32 |
3 |
p. 784-799
|
artikel
|
| 18 |
Signed total Roman domination in graphs
|
Volkmann, Lutz
|
|
2015
|
32 |
3 |
p. 855-871
|
artikel
|
| 19 |
Solving constrained optimization problems by solution-based decomposition search
|
Lamine, Amine
|
|
2015
|
32 |
3 |
p. 672-695
|
artikel
|
| 20 |
The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation
|
Büttner, Sabine
|
|
2015
|
32 |
3 |
p. 842-854
|
artikel
|
| 21 |
The extremal spectral radii of $$k$$k-uniform supertrees
|
Li, Honghai
|
|
2015
|
32 |
3 |
p. 741-764
|
artikel
|
| 22 |
The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
|
Nguyen, Kien Trung
|
|
2015
|
32 |
3 |
p. 872-884
|
artikel
|
Tijdschrift beschrijving