default search action
Discrete Applied Mathematics, Volume 251
Volume 251, December 2018
- Bernd R. Schuh:
Exact satisfiability of linear CNF formulas. 1-4 - Richard Edwin Stearns, Daniel J. Rosenkrantz, S. S. Ravi, Madhav V. Marathe:
A characterization of nested canalyzing functions with maximum average sensitivity. 5-14 - Qinglan Zhao, Dong Zheng, Weiguo Zhang:
Constructions of rotation symmetric bent functions with high algebraic degree. 15-29
- Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak:
Localization game on geometric and planar graphs. 30-39 - János Flesch, Arkadi Predtetchinski, William D. Sudderth:
Simplifying optimal strategies in limsup and liminf stochastic games. 40-56 - Takuya Iimura, Pierre von Mouche, Takahiro Watanabe:
Binary action games: Deviation properties, semi-strict equilibria and potentials. 57-68
- Júlio Araújo, Fabrício Benevides, Alexandre A. Cezar, Ana Silva:
Circular backbone colorings: On matching and tree backbones of planar graphs. 69-82 - Olivier Baudon, Julien Bensmail, Mohammed Senhaji, Éric Sopena:
Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture. 83-92 - Kristóf Bérczi, Alpár Jüttner, Marco Laumanns, Jácint Szabó:
Arrival time dependent routing policies in public transport. 93-102 - Katherine F. Benson, Daniela Ferrero, Mary Flagg, Veronika Furst, Leslie Hogben, Violeta Vasilevska:
Nordhaus-Gaddum problems for power domination. 103-113 - Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Yi-Zhi Liu, Peter Rossmanith, Somnath Sikdar:
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem. 114-125 - Xiaodan Chen, Kinkar Chandra Das:
Solution to a conjecture on the maximum ABC index of graphs with given chromatic number. 126-134 - Ya-Hong Chen, Hua Wang, Xiao-Dong Zhang:
Peripheral Wiener index of trees and related questions. 135-145 - Celina M. H. de Figueiredo, Sophie Spirkl:
Sandwich and probe problems for excluding paths. 146-154 - Yanxia Dong, Erfang Shan, Liying Kang, Shan Li:
Domination in intersecting hypergraphs. 155-159 - Wei Fang, Yi Wang, Jia-Bao Liu, Guangming Jing:
Maximum Resistance-Harary index of cacti. 160-170 - Ümit Islak, Alperen Y. Özdemir:
Asymptotic results on weakly increasing subsequences in random words. 171-189 - Cong X. Kang, Ismael González Yero, Eunjeong Yi:
The fractional strong metric dimension in three graph products. 190-203 - Aleksander Kelenc, Niko Tratnik, Ismael González Yero:
Uniquely identifying the edges of a graph: The edge metric dimension. 204-220 - Shengjia Li, Xiaohui Wu, Eberhard Triesch:
A ternary search problem on two disjoint sets. 221-235 - Min-Sheng Lin:
Counting independent sets and maximal independent sets in some subclasses of bipartite graphs. 236-244 - Thiago Braga Marcilon, Rudini M. Sampaio:
The maximum infection time of the P3 convexity in graphs with bounded maximum degree. 245-257 - Marjan M. Matejic, Igor Z. Milovanovic, Emina I. Milovanovic:
Upper bounds for the inverse sum indeg index of graphs. 258-267 - Angelo Monti, Blerina Sinaimeri:
On variants of Vertex Geography on undirected graphs. 268-275 - Ghajendran Poovanandran, Wen Chean Teh:
Elementary matrix equivalence and core transformation graphs for Parikh matrices. 276-289 - Damir Vukicevic, Jelena Sedlar:
On indices of Wiener and anti-Wiener type. 290-298 - Jianfeng Wang, Mei Lu, Francesco Belardo, Milan Randic:
The anti-adjacency matrix of a graph: Eccentricity matrix. 299-309 - Shu-Li Zhao, Rong-Xia Hao:
The generalized connectivity of alternating group graphs and (n, k)-star graphs. 310-321 - Qiang Zhu, Jia Zhang, Lili Li:
The h-extra connectivity and h-extra conditional diagnosability of Bubble-sort star graphs. 322-333
- Bernhard Bliem, Stefan Woltran:
Defensive alliances in graphs of bounded treewidth. 334-339 - Emeric Deutsch, Sergi Elizalde:
A bijection between bargraphs and Dyck paths. 340-344 - Yiyuan Hao, Qizhong Lin:
Ramsey number of K3 versus F3, n. 345-348 - Changqing Xu, Shan Ge, Jianguo Li:
Neighbor sum distinguishing total chromatic number of 2-degenerate graphs. 349-352
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.