default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 309
Volume 309, March 2022
- Sihong Su
, Bingxin Wang, Jingjing Li:
On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions. 1-12 - Stefano Barbero, Emanuele Bellini, Carlo Sanna, Javier A. Verbel:
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems. 13-31 - Michael Haythorpe, Alex Newcombe:
The secure domination number of Cartesian products of small graphs with paths and cycles. 32-45 - Jun Yuan, Huijuan Qiao, Aixia Liu, Xi Wang:
Measurement and algorithm for conditional local diagnosis of regular networks under the MM* model. 46-67 - Alan M. Frieze, Wesley Pegden:
Spanners in randomly weighted graphs: Independent edge lengths. 68-74 - Eranda Dhananjaya, Wei-Tian Li:
Antimagic labeling of forests with sets of consecutive integers. 75-84
- Manfred Besner:
Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations. 85-109
- Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz:
Overlaid species forests. 110-122
- Jesse Geneson, Suchir Kaustav, Antoine Labelle:
Extremal results for graphs of bounded metric dimension. 123-129 - Aubrey Blecher, Arnold Knopfmacher, Toufik Mansour:
Alphabetic points in restricted growth functions. 130-137 - Robert Janczewski, Pawel Obszarski, Krzysztof Turowski, Bartlomiej Wróblewski:
Infinite chromatic games. 138-146 - Changhong Lu, Qingjie Ye:
A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem. 147-159 - Gunjan S. Mahindre, Anura P. Jayasumana:
Link dimension and exact construction of graphs from distance vectors. 160-171 - Michael Harp, Elijah Jackson, David Jensen, Noah Speeter:
A new lower bound on graph gonality. 172-179 - Weiming Weng, Bo Zhou:
On the eccentric connectivity index of uniform hypergraphs. 180-193 - Daniele Bartoli, Massimo Giulietti, Marco Timpanella:
Two-to-one functions from Galois extensions. 194-201 - Andrzej Dudek, Sean English, Alan M. Frieze, Calum MacRury, Pawel Pralat:
Localization game for random graphs. 202-214 - Robert Ferguson, Vincent Vatter:
Letter graphs and modular decomposition. 215-220 - Sascha Kurz:
On the number of minimal codewords in codes generated by the adjacency matrix of a graph. 221-228 - Guy Kortsarz, Zeev Nutov:
The minimum degree Group Steiner problem. 229-239 - Sunil Morapitiye, Tamás Kis:
Strong cuts from compatibility relations for the Dial-a-Ride Problem. 240-257 - Qing Cui, Zhenmeng Han:
List star edge-coloring of claw-free subcubic multigraphs. 258-264
- Zhidan Yan, Wei Wang:
The smallest pair of cospectral cubic graphs with different chromatic indexes. 265-268
- Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik:
The Stochastic Boolean Function Evaluation problem for symmetric Boolean functions. 269-277
- Artem Hak, Sergiy Kozerenko, Bogdana Oliynyk:
A note on the triameter of graphs. 278-284
- Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable vertices and edges in graphs: Existence, characterization, and applications. 285-300 - Wenjuan Wei, Fengxia Liu, Wei Xiong, Hong-Jian Lai:
On r-hued list coloring of K4(7)-minor free graphs. 301-309 - Lili Li, Xing Zhang, Qiang Zhu, Yiguang Bai:
The 3-extra conditional diagnosability of balanced hypercubes under MM∗ model. 310-316
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 2025-08-25 22:51 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:
