| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Algorithmic aspects of switch cographs
|
Cohen-Addad, Vincent
|
|
2016
|
200 |
C |
p. 23-42
20 p.
|
article
|
| 2 |
A measure for a balanced workload and its extremal values
|
Govorčin, Jelena
|
|
2016
|
200 |
C |
p. 59-66
8 p.
|
article
|
| 3 |
An extension of the Motzkin–Straus theorem to non-uniform hypergraphs and its applications
|
Peng, Yuejian
|
|
2016
|
200 |
C |
p. 170-175
6 p.
|
article
|
| 4 |
An FPT algorithm for the vertex cover P 4 problem
|
Tu, Jianhua
|
|
2016
|
200 |
C |
p. 186-190
5 p.
|
article
|
| 5 |
Bounds on the differentiating-total domination number of a tree
|
Ning, Wenjie
|
|
2016
|
200 |
C |
p. 153-160
8 p.
|
article
|
| 6 |
Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
|
Artamonov, V.A.
|
|
2016
|
200 |
C |
p. 5-17
13 p.
|
article
|
| 7 |
Classifying the clique-width of H -free bipartite graphs
|
Dabrowski, Konrad K.
|
|
2016
|
200 |
C |
p. 43-51
9 p.
|
article
|
| 8 |
Complete characterization of bicyclic graphs with minimal Kirchhoff index
|
Liu, Jia-Bao
|
|
2016
|
200 |
C |
p. 95-107
13 p.
|
article
|
| 9 |
Contents
|
|
|
2016
|
200 |
C |
p. v-vi
nvt p.
|
article
|
| 10 |
Fractional Thue chromatic number of graphs
|
Zhong, Yaling
|
|
2016
|
200 |
C |
p. 191-199
9 p.
|
article
|
| 11 |
Global Roman domination in graphs
|
Roushini Leely Pushpam, P.
|
|
2016
|
200 |
C |
p. 176-185
10 p.
|
article
|
| 12 |
Improvements on some error-tolerance pooling designs
|
Chang, Huilan
|
|
2016
|
200 |
C |
p. 18-22
5 p.
|
article
|
| 13 |
Locating–dominating sets in twin-free graphs
|
Foucaud, Florent
|
|
2016
|
200 |
C |
p. 52-58
7 p.
|
article
|
| 14 |
Mining approximate patterns with frequent locally optimal occurrences
|
Nakamura, Atsuyoshi
|
|
2016
|
200 |
C |
p. 123-152
30 p.
|
article
|
| 15 |
On domination number and distance in graphs
|
Kang, Cong X.
|
|
2016
|
200 |
C |
p. 203-206
4 p.
|
article
|
| 16 |
On the structure and the number of prime implicants of 2- CNF s
|
Talebanfard, Navid
|
|
2016
|
200 |
C |
p. 1-4
4 p.
|
article
|
| 17 |
Reconstructing Markov processes from independent and anonymous experiments
|
Micali, Silvio
|
|
2016
|
200 |
C |
p. 108-122
15 p.
|
article
|
| 18 |
Remarks on planar edge-chromatic critical graphs
|
Jin, Ligang
|
|
2016
|
200 |
C |
p. 200-202
3 p.
|
article
|
| 19 |
Simultaneous selection
|
Olszewski, Wojciech
|
|
2016
|
200 |
C |
p. 161-169
9 p.
|
article
|
| 20 |
Supereulerian graphs with width s and s -collapsible graphs
|
Li, Ping
|
|
2016
|
200 |
C |
p. 79-94
16 p.
|
article
|
| 21 |
Trichotomy for integer linear systems based on their sign patterns
|
Kimura, Kei
|
|
2016
|
200 |
C |
p. 67-78
12 p.
|
article
|
Journal description