Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 219
Volume 219, March 2017
- Sylvain Béal, Eric Rémila, Philippe Solal:
Discounted tree solutions. 1-17 - Dániel Gerbner
, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Finding a non-minority ball with majority answers. 18-31 - John Haslegrave, Chris Cannings:
Majority dynamics with one nonconformist. 32-39 - Wen An Liu, Jia Wei Duan:
Misère Nim with multi-player. 40-50
- Teobaldo L. Bulhões Júnior, Gilberto Farias de Sousa Filho, Anand Subramanian, Lucídio dos Anjos F. Cabral:
Branch-and-cut approaches for p-Cluster Editing. 51-64 - Abel Cabrera Martínez, José M. Sigarreta Almira, Ismael González Yero:
On the independence transversal total domination number of graphs. 65-73 - Jou-Ming Chang, Ting-Jyun Yang, Jinn-Shyong Yang:
A parallel algorithm for constructing independent spanning trees in twisted cubes. 74-82 - Bernadette Charron-Bost, Matthias Függer, Thomas Nowak:
New transience bounds for max-plus linear systems. 83-99 - Baolei Cheng, Dajin Wang, Jianxi Fan:
Constructing completely independent spanning trees in crossed cubes. 100-109 - Cristina Dalfó, Miguel Angel Fiol, Nacho López:
Sequence mixed graphs. 110-116 - Fangguo He, Zhongxun Zhu:
Cacti with maximum eccentricity resistance-distance sum. 117-125 - Xing Huang:
Implicit degree condition for hamiltonicity of 2-heavy graphs. 126-131 - Juho Lauri:
Complexity of rainbow vertex connectivity problems for restricted graph classes. 132-146 - Hongying Lin, Bo Zhou:
The changes in distance Laplacian spectral radius of graphs resulting from graft transformations. 147-157 - Dmitriy S. Malyshev, O. O. Lobanova:
Two complexity results for the vertex coloring problem. 158-166 - Yaping Mao, Zhao Wang, Ivan Gutman, He Li:
Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs. 167-175 - Minjia Shi, Yan Liu, Patrick Solé:
Optimal binary codes from trace codes over a non-chain ring. 176-181 - Zexia Shi, Fang-Wei Fu:
Complete weight enumerators of some irreducible cyclic codes. 182-192 - Hao Qi, Xuding Zhu:
The wide-diameter of Zn, k. 193-201 - Jie You, Jianxin Wang, Yixin Cao:
Approximate association via dissociation. 202-209
- Jinwook Lee, Jongpil Kim, András Prékopa:
Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events. 210-218 - Michel Mollard:
Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes. 219-221
- Vyacheslav A. Artamonov, Sucheta Chakrabarti, Saibal K. Pal:
Corrigendum to "Characterization of polynomially complete quasigroups based on latin squares for cryptographic transformations" [Discrete Appl. Math. 200(2016) 5-17]. 211
a service of 
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-07-01 21:39 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:
