default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 215
Volume 215, December 2016
- Igor Chikalov, Shahid Hussain
, Mikhail Moshkov:
Totally optimal decision trees for Boolean functions. 1-13 - Thomas W. Cusick:
Hamming weights of symmetric Boolean functions. 14-19 - Lei Sun, Fang-Wei Fu:
Balanced 2p-variable rotation symmetric Boolean functions with optimal algebraic immunity. 20-30
- Yuki Sukenari, Kunihito Hoki, Satoshi Takahashi, Masakazu Muramatsu:
Pure Nash equilibria of competitive diffusion process on toroidal grid graphs. 31-40
- Ali Alatabbi, Jacqueline W. Daykin, Juha Kärkkäinen, M. Sohel Rahman, W. F. Smyth:
V-Order: New combinatorial properties & a simple comparison algorithm. 41-46 - Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I. 47-60 - Andrzej Dudek, Dieter Mitsche, Pawel Pralat:
The set chromatic number of random graphs. 61-70 - Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer:
Well-covered triangulations: Part IV. 71-94 - Mathew C. Francis, Abhiruk Lahiri:
VPG and EPG bend-numbers of Halin graphs. 95-105 - Shinya Fujita, Gary MacGillivray, Tadashi Sakuma:
Safe set problem on graphs. 106-111 - Jack E. Graver, Elizabeth J. Hartung:
The Clar and Fries structures of a fullerene I. 112-125 - Emmanuel Hebrard, Marie-José Huguet, Nicolas Jozefowiez, Adrien Maillard, Cédric Pralet, Gérard Verfaillie:
Approximation of the parallel machine scheduling problem with additional unit resources. 126-135 - Ruben Hoeksma, Bodo Manthey, Marc Uetz:
Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope. 136-145 - Batmend Horoldagva, Kinkar Chandra Das, Tsend-Ayush Selenge:
Complete characterization of graphs for direct comparing Zagreb indices. 146-154 - Michiko Kasai, Naoki Matsumoto, Atsuhiro Nakamoto:
Grünbaum colorings of triangulations on the projective plane. 155-163 - Hongwei Li, Wenjie Ning, Yubao Guo, Mei Lu:
On pancyclic arcs in hypertournaments. 164-170 - Xiaobin Ma, Dein Wong, Fenglei Tian:
Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices. 171-176 - Enes Pasalic, Nastja Cepak, Yongzhuang Wei:
Infinite classes of vectorial plateaued functions, permutations and complete permutations. 177-184 - Liyuan Shi, Haiyan Chen:
Resistance distances and Kirchhoff index of graphs with an involution. 185-196 - Qichun Wang, Chik How Tan:
On the second-order nonlinearity of the hidden weighted bit function. 197-202 - Yezhou Wu, Dong Ye, Cun-Quan Zhang:
Uniquely forced perfect matching and unique 3-edge-coloring. 203-207 - Xiu-Mei Zhang, Yu Yang, Hua Wang, Xiao-Dong Zhang:
Maximum atom-bond connectivity index with given graph parameters. 208-217
- Huiqiu Lin, Kinkar Chandra Das, Baoyindureng Wu:
Remoteness and distance eigenvalues of a graph. 218-224 - Mengmeng Liu, Lily Chen:
Bicyclic graphs with maximal edge revised Szeged index. 225-230 - Elif Saygi, Ömer Egecioglu:
Counting disjoint hypercubes in Fibonacci cubes. 231-237
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.
last updated on 2024-10-01 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
