nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A characterization of partial blocks in weighted graphs
|
Mathew, Sunil |
|
2012 |
|
17-18 |
p. 706-710 5 p. |
artikel |
2 |
A proof of a conjecture on multiset coloring the powers of cycles
|
Feng, Yun |
|
2012 |
|
17-18 |
p. 678-682 5 p. |
artikel |
3 |
Complexity of minimum corridor guarding problems
|
Xu, Ning |
|
2012 |
|
17-18 |
p. 691-696 6 p. |
artikel |
4 |
Editorial Board
|
|
|
2012 |
|
17-18 |
p. IFC- 1 p. |
artikel |
5 |
Linear threshold multisecret sharing schemes
|
Farràs, Oriol |
|
2012 |
|
17-18 |
p. 667-673 7 p. |
artikel |
6 |
Lower bounds for randomized algorithms for online chain partitioning
|
Mathieu, Claire |
|
2012 |
|
17-18 |
p. 663-666 4 p. |
artikel |
7 |
On deriving conditional diagnosability of interconnection networks
|
Cheng, E. |
|
2012 |
|
17-18 |
p. 674-677 4 p. |
artikel |
8 |
On minimal arbitrarily partitionable graphs
|
Baudon, Olivier |
|
2012 |
|
17-18 |
p. 697-700 4 p. |
artikel |
9 |
λ ′ -Optimality of Bipartite Digraphs
|
Chen, Xing |
|
2012 |
|
17-18 |
p. 701-705 5 p. |
artikel |
10 |
Recursive hiding of biometrics-based secret sharing scheme using adversary structure
|
Lai, Hong |
|
2012 |
|
17-18 |
p. 683-687 5 p. |
artikel |
11 |
The minimum spanning tree problem with non-terminal set
|
Zhang, Tongquan |
|
2012 |
|
17-18 |
p. 688-690 3 p. |
artikel |