Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 244
Volume 244, July 2018
- Hikoe Enomoto, Masahiro Hachimori
, Shun Nakamura, Maiko Shigeno, Yuya Tanaka, Masaaki Tsugami:
Pure-strategy Nash equilibria on competitive diffusion games. 1-19
- Messaouda Ahmane, Isma Bouchemakh, Éric Sopena:
On the broadcast independence number of caterpillars. 20-35 - Daniel Birmajer, Juan B. Gil, Michael D. Weiner:
On rational Dyck paths and the enumeration of factor-free Dyck words. 36-43 - W. H. Chan, Richard M. Low, Stephen C. Locke, Irene O. L. Wong:
A map of the P-positions in 'Nim With a Pass' played on heap sizes of at most four. 44-55 - Manoj Changat, Shilpa Mohandas, Henry Martyn Mulder, Prasanth G. Narasimha-Shenoi, Robert C. Powers, D. Jacob Wildstrom:
Axiomatic characterization of the center function. The case of non-universal axioms. 56-69 - Zhongyuan Che, Zhibo Chen:
Forcing and anti-forcing edges in bipartite graphs. 70-77 - Alexis Cornet, Christian Laforest:
Domination problems with no conflicts. 78-88 - Marc Glen, Sergey Kitaev, Artem V. Pyatkin:
On the representation number of a crown graph. 89-93 - Mei-Mei Gu, Rong-Xia Hao:
Reliability analysis of Cayley graphs generated by transpositions. 94-102 - Michael A. Henning:
Essential upper bounds on the total domination number. 103-115 - Daiqiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu:
Planar graphs without chordal 6-cycles are 4-choosable. 116-123 - Imke Joormann, Marc E. Pfetsch:
Complexity of minimum irreducible infeasible subsystem covers for flow networks. 124-142 - Stefko Miklavic, Primoz Sparl:
ℓ-distance-balanced graphs. 143-154 - Parthe Pandit, Ankur A. Kulkarni:
A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs. 155-169 - Adityanarayanan Radhakrishnan, Liam Solus, Caroline Uhler:
Counting Markov equivalence classes for DAG models on trees. 170-185 - Andrea Scozzari, Fabio Tardella:
Complexity of some graph-based bounds on the probability of a union of events. 186-197 - Anu V., S. Aparna Lakshmanan:
Double Roman domination number. 198-204 - Adam Woryna:
On the ratio of prefix codes to all uniquely decodable codes with a given length distribution. 205-213
- Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo:
A note on 2-bisections of claw-free cubic graphs. 214-217 - Robert Lukotka, Ján Mazák:
Simple cubic graphs with no short traveling salesman tour. 218-222 - Robert Lukot'ka, Ján Mazák:
Weak oddness as an approximation of oddness and resistance in cubic graphs. 223-226
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-05-13 21:16 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:
