default search action
Discrete Applied Mathematics, Volume 174
Volume 174, September 2014
- Qichun Wang, Claude Carlet, Pantelimon Stanica, Chik How Tan:
Cryptographic properties of the hidden weighted bit function. 1-10
- Cuong V. Than, Noah A. Rosenberg:
Mean deep coalescence cost under exchangeable probability distributions. 11-26
- Tanbir Ahmed, Oliver Kullmann, Hunter S. Snevily:
On the van der Waerden numbers w(2; 3, t). 27-51 - Franz Aurenhammer, Bing Su, Yin-Feng Xu, Binhai Zhu:
A note on visibility-constrained Voronoi diagrams. 52-56 - Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey:
Finding clubs in graph classes. 57-65 - Danny Hermelin, Julián Mestre, Dror Rawitz:
Optimization problems in dotted interval graphs. 66-72 - Hong-Jian Lai, Yanting Liang, Juan Liu, Jixiang Meng, Zhengke Miao, Yehong Shao, Zhao Zhang:
On strongly Z2s-1-connected graphs. 73-80 - James K. Lan, Gerard Jennhwa Chang:
On the algorithmic complexity of k-tuple total domination. 81-91 - Henry Liu, Ângela Mestre, Teresa Sousa:
Total rainbow k-connection in graphs. 92-101 - Jean-Luc Marichal, Bruno Teheux:
Pivotal decompositions of functions. 102-112 - Martin Milanic, Alexandru I. Tomescu:
Set graphs. IV. Further connections with claw-freeness. 113-121 - Amit Ophir, Rom Pinchasi:
Nearly equal distances in metric spaces. 122-127
- Simone Dantas, Felix Joos, Christian Löwenstein, Deiwison S. Machado, Dieter Rautenbach:
Domination and total domination in cubic graphs of large girth. 128-132 - Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The k-rainbow bondage number of a graph. 133-139 - Andrzej Grzesik, Hrant Khachatrian:
Interval edge-colorings of K1, m, n. 140-145 - Yusheng Li, Zhen Zhang:
A note on eigenvalue bounds for independence numbers of non-regular graphs. 146-149
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.