| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A new construction of rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity
|
Zhang, Hui
|
|
2019
|
262 |
C |
p. 13-28
|
article
|
| 2 |
Characterizing interval graphs which are probe unit interval graphs
|
Grippo, Luciano N.
|
|
2019
|
262 |
C |
p. 83-95
|
article
|
| 3 |
Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks
|
Chen, Yindong
|
|
2019
|
262 |
C |
p. 1-12
|
article
|
| 4 |
Domination ratio of integer distance digraphs
|
Huang, Jia
|
|
2019
|
262 |
C |
p. 104-115
|
article
|
| 5 |
Dynamic monopolies in two-way bootstrap percolation
|
Jeger, Clemens
|
|
2019
|
262 |
C |
p. 116-126
|
article
|
| 6 |
Editorial Board
|
|
|
2019
|
262 |
C |
p. ii
|
article
|
| 7 |
Equal relation between g -good-neighbor diagnosability under the PMC model and g -good-neighbor diagnosability under the MM ∗ model of a graph
|
Hu, Xiaomin
|
|
2019
|
262 |
C |
p. 96-103
|
article
|
| 8 |
Equivalence between pathbreadth and strong pathbreadth
|
Ducoffe, Guillaume
|
|
2019
|
262 |
C |
p. 185-188
|
article
|
| 9 |
Extremal k -forcing sets in oriented graphs
|
Caro, Yair
|
|
2019
|
262 |
C |
p. 42-55
|
article
|
| 10 |
Graph pebbling algorithms and Lemke graphs
|
Cusack, Charles A.
|
|
2019
|
262 |
C |
p. 72-82
|
article
|
| 11 |
Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
|
Cheng, Dongqin
|
|
2019
|
262 |
C |
p. 56-71
|
article
|
| 12 |
Identifying codes on directed de Bruijn graphs
|
Boutin, Debra
|
|
2019
|
262 |
C |
p. 29-41
|
article
|
| 13 |
Online sum-paintability: Slow-coloring of trees
|
Puleo, Gregory J.
|
|
2019
|
262 |
C |
p. 158-168
|
article
|
| 14 |
Optimal constraints aggregation method for ILP
|
Poirion, Pierre-Louis
|
|
2019
|
262 |
C |
p. 148-157
|
article
|
| 15 |
Partition dimension of rooted product graphs
|
Monica, Mohan Chris
|
|
2019
|
262 |
C |
p. 138-147
|
article
|
| 16 |
Power domination on permutation graphs
|
Wilson, S.
|
|
2019
|
262 |
C |
p. 169-178
|
article
|
| 17 |
Proper circular arc graphs as intersection graphs of pathson a grid
|
Galby, Esther
|
|
2019
|
262 |
C |
p. 195-202
|
article
|
| 18 |
Secure domination in cographs
|
Araki, Toru
|
|
2019
|
262 |
C |
p. 179-184
|
article
|
| 19 |
Some optimal combinatorial batch codes with k = 5
|
Jia, Dongdong
|
|
2019
|
262 |
C |
p. 127-137
|
article
|
| 20 |
Uniquely restricted matchings in subcubic graphs
|
Fürst, Maximilian
|
|
2019
|
262 |
C |
p. 189-194
|
article
|
Journal description