default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 198
Volume 198, January 2016
- Yoav Bar-Sinai, Daniel Berend
:
Reconstruction of domino tilings - Combinatorial and probabilistic questions. 1-19 - Csaba Biró, Paul Horn, D. Jacob Wildstrom:
An upper bound on the extremal version of Hajnal's triangle-free game. 20-28 - Ulrich Faigle, Michel Grabisch, Andrés Jiménez-Losada, Manuel Ordóñez:
Games on concept lattices: Shapley value and core. 29-47 - Wen An Liu, Xiao Zhao:
Nim with one or two dynamic restrictions. 48-64
- David Anick:
Counting graceful labelings of trees: A theoretical and empirical study. 65-81 - Juan Manuel Burgos, Franco Robledo Amoza:
Factorization of network reliability with perfect nodes I: Introduction and statements. 82-90 - Juan Manuel Burgos:
Factorization of network reliability with perfect nodes II: Connectivity matrix. 91-100 - Chien-Pin Chou, Jin-Su Kang, Henryk A. Witek:
Closed-form formulas for the Zhang-Zhang polynomials of benzenoid structures: Prolate rectangles and their generalizations. 101-108 - Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. 109-117 - David Fernández-Duque, Valentin Goranko:
Secure aggregation of distributed information: How a team of agents can safely share secrets in front of a spy. 118-135 - Amir Kafshdar Goharshady, Mohammad Reza Hooshmandasl, M. Alambardar Meybodi:
[1, 2]-sets and [1, 2]-total sets in trees with algorithms. 136-146 - Ramin Kazemi:
Note on the multiplicative Zagreb indices. 147-154 - Mekkia Kouider:
On quasi-monotonous graphs. 155-163 - Zepeng Li, Enqiang Zhu, Zehui Shao, Jin Xu:
On dominating sets of maximal outerplanar and planar graphs. 164-169 - Kitty Meeks:
The challenges of unbounded treewidth in parameterised subgraph counting problems. 170-194 - Marek Niezgoda:
Vector joint majorization and generalization of Csiszár-Körner's inequality for f-divergence. 195-205 - Luiz Fernando Nunes, Lauro Cesar Galvão, Heitor Silvério Lopes, Pablo Moscato, Regina Berretta:
An integer programming model for protein structure prediction using the 3D-HP side chain model. 206-214 - Feng Pan, Aaron Schild:
Interdiction problems on planar graphs. 215-231 - Feng Qiu, Shabbir Ahmed, Santanu S. Dey:
Strengthened bounds for the probability of k-out-of-n events. 232-240 - Yunior Ramírez-Cruz, Ortrud R. Oellermann, Juan A. Rodríguez-Velázquez:
The simultaneous metric dimension of graph families. 241-250 - Huimin Song, Hong-Jian Lai, Jian-Liang Wu:
On r-hued coloring of planar graphs with girth at least 6. 251-263 - Chuan-Long Wang, Xuerong Yong, Mordecai J. Golin:
The channel capacity of read/write isolated memory. 264-273 - Nathan Warnberg:
Positive semidefinite propagation time. 274-290
- Daniele Bartoli, Francesco Pavese:
A note on equidistant subspace codes. 291-296 - Xiaomin Chen, Peihan Miao:
Nordhaus-Gaddum-type problems for lines in hypergraphs. 297-302 - Masashi Kiyomi, Yoshio Okamoto, Yota Otachi:
On the treewidth of toroidal grids. 303-306
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-02-15 00:07 CET 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:
