nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algorithm for constraint partial inverse matroid problem with weight increase forbidden
|
Li, Shuangshuang |
|
2016 |
640 |
C |
p. 119-124 6 p. |
artikel |
2 |
Analysis of Gong et al.'s CCA2-secure homomorphic encryption
|
Lee, Hyung Tae |
|
2016 |
640 |
C |
p. 104-114 11 p. |
artikel |
3 |
A note on the neighbor sum distinguishing total coloring of planar graphs
|
Song, Hong Jie |
|
2016 |
640 |
C |
p. 125-129 5 p. |
artikel |
4 |
Approximation algorithms on consistent dynamic map labeling
|
Liao, Chung-Shou |
|
2016 |
640 |
C |
p. 84-93 10 p. |
artikel |
5 |
Component connectivity of hypercubes
|
Zhao, Shuli |
|
2016 |
640 |
C |
p. 115-118 4 p. |
artikel |
6 |
Computing abelian complexity of binary uniform morphic words
|
Blanchet-Sadri, F. |
|
2016 |
640 |
C |
p. 41-51 11 p. |
artikel |
7 |
Edge-disjoint packing of stars and cycles
|
Jiang, Minghui |
|
2016 |
640 |
C |
p. 61-69 9 p. |
artikel |
8 |
Editorial Board
|
|
|
2016 |
640 |
C |
p. iii-ix nvt p. |
artikel |
9 |
Faster merging networks with a small constant period
|
Piotrów, Marek |
|
2016 |
640 |
C |
p. 20-40 21 p. |
artikel |
10 |
Finding good 2-partitions of digraphs II. Enumerable properties
|
Bang-Jensen, J. |
|
2016 |
640 |
C |
p. 1-19 19 p. |
artikel |
11 |
Induced disjoint paths in circular-arc graphs in linear time
|
Golovach, Petr A. |
|
2016 |
640 |
C |
p. 70-83 14 p. |
artikel |
12 |
New models of graph-bin packing
|
Bujtás, Cs. |
|
2016 |
640 |
C |
p. 94-103 10 p. |
artikel |
13 |
On the geodetic hull number of P k -free graphs
|
Dourado, Mitre C. |
|
2016 |
640 |
C |
p. 52-60 9 p. |
artikel |