Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 260
Volume 260, May 2019
- Kimmo Berg
, Mitri Kitti:
Equilibrium paths in discounted supergames. 1-27
- Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The query complexity of a permutation-based variant of Mastermind. 28-50 - Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter:
The expanding search ratio of a graph. 51-65 - Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev:
Dense subgraphs in random graphs. 66-74 - Robert A. Beeler, Teresa W. Haynes, Rodney Keaton:
Domination cover rubbling. 75-85 - Wenqin Cao, Emma Yu Jin, Zhicong Lin:
Enumeration of inversion sequences avoiding triples of relations. 86-97 - Jin Chen, Zhi-Xiong Wen, Wen Wu:
On the additive complexity of a Thue-Morse-like sequence. 98-108 - Yongxi Cheng, Yunyue Yang, Ding-Zhu Du:
A class of asymptotically optimal group testing strategies to identify good items. 109-116 - Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp:
Optimal pebbling number of graphs with given minimum degree. 117-130 - Janosch Döcker, Leo van Iersel, Steven Kelk, Simone Linz:
Deciding the existence of a cherry-picking sequence is hard on two trees. 131-143 - Michel Grabisch, Tomás Kroupa:
The cone of supermodular games on finite distributive lattices. 144-154 - Miaomiao Han, Hong-Jian Lai, Jianping Liu:
Modulo 5-orientations and degree sequences. 155-163 - Teresa W. Haynes, Michael A. Henning:
Perfect Italian domination in trees. 164-177 - Marko Jakovac:
Relating the annihilation number and the 2-domination number of block graphs. 178-187 - Iman Keshtkar, Mehdi Ghiyasvand:
Inverse quickest center location problem on a tree. 188-202 - Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki:
On shortening u-cycles and u-words for permutations. 203-213 - Farshad Safaei, F. Kashkooei Jahromi, S. Fathi:
A method for computing local contributions to graph energy based on Estrada-Benzi approach. 214-226 - Warut Suksompong:
Fairly allocating contiguous blocks of indivisible items. 227-236 - Payam Valadkhan:
List matrix partitions of graphs representing geometric configurations. 237-243 - Dijian Wang, Yaoping Hou:
Bicyclic signed graphs with at most one odd cycle and maximal energy. 244-255
- Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Dynamic monopolies for interval graphs with bounded thresholds. 256-261 - Jihoon Choi, Soogang Eoh, Suh-Ryung Kim:
A graph with the partial order competition dimension greater than five. 262-266 - Guillaume Ducoffe:
Easy computation of eccentricity approximating trees. 267-271 - Ran Gu, Hong-Jian Lai, Yanting Liang, Zhengke Miao, Meng Zhang:
Collapsible subgraphs of a 4-edge-connected graph. 272-277 - Hui Lei, Suil O, Yongtang Shi, Douglas B. West, Xuding Zhu:
Extremal problems on saturation for the family of k-edge-connected graphs. 278-283 - Chin-Lin Shiue:
Capacity restricted optimal pebbling in graphs. 284-288 - Yun-Hao Zou, Jia Jie Liu, Chiun-Chieh Hsu, Yue-Li Wang:
A simple algorithm for secure domination in proper interval graphs. 289-293
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-08-17 23:42 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:
