


default search action
Discrete Applied Mathematics, Volume 262
Volume 262, June 2019
- Yindong Chen, Fei Guo, Jie Ruan:

Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks. 1-12 - Hui Zhang, Sihong Su

:
A new construction of rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity. 13-28
- Debra L. Boutin, Victoria Horan Goliber

, Mikko Pelto:
Identifying codes on directed de Bruijn graphs. 29-41 - Yair Caro, Randy Davila, Ryan Pepper:

Extremal k-forcing sets in oriented graphs. 42-55 - Dongqin Cheng

:
Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes. 56-71 - Charles A. Cusack, Aaron Green, Airat Bekmetjev, Mark Powers

:
Graph pebbling algorithms and Lemke graphs. 72-82 - Luciano N. Grippo

:
Characterizing interval graphs which are probe unit interval graphs. 83-95 - Xiaomin Hu, Weihua Yang, Yingzhi Tian

, Jixiang Meng:
Equal relation between g-good-neighbor diagnosability under the PMC model and g-good-neighbor diagnosability under the MM∗ model of a graph. 96-103 - Jia Huang

:
Domination ratio of integer distance digraphs. 104-115 - Clemens Jeger, Ahad N. Zehmakan

:
Dynamic monopolies in two-way bootstrap percolation. 116-126 - Dongdong Jia, Gengsheng Zhang:

Some optimal combinatorial batch codes with k=5. 127-137 - Mohan Chris Monica, Samivel Santhakumar:

Partition dimension of rooted product graphs. 138-147 - Pierre-Louis Poirion

:
Optimal constraints aggregation method for ILP. 148-157 - Gregory J. Puleo

, Douglas B. West:
Online sum-paintability: Slow-coloring of trees. 158-168 - Samuel Wilson

:
Power domination on permutation graphs. 169-178
- Toru Araki

, Ryo Yamanaka:
Secure domination in cographs. 179-184 - Guillaume Ducoffe, Arne Leitert:

Equivalence between pathbreadth and strong pathbreadth. 185-188 - Maximilian Fürst, Michael A. Henning

, Dieter Rautenbach:
Uniquely restricted matchings in subcubic graphs. 189-194 - Esther Galby

, María Pía Mazzoleni, Bernard Ries
:
Proper circular arc graphs as intersection graphs of pathson a grid. 195-202

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














