On the complexity of the minimum outer-connected dominating set problem in graphs D. Pradhan OriginalPaper 10 January 2014 Pages: 1 - 12
The best choice problem for posets; colored complete binary trees Wojciech Kaźmierczak OriginalPaper Open access 22 January 2014 Pages: 13 - 28
Approximation for maximizing monotone non-decreasing set functions with a greedy method Zengfu WangBill MoranQuan Pan OriginalPaper 30 January 2014 Pages: 29 - 43
An inequality that relates the size of a bipartite graph with its order and restrained domination number Ernst J. Joubert OriginalPaper 30 January 2014 Pages: 44 - 51
Lower bounds on the total domination number of a graph Wyatt J. DesormeauxMichael A. Henning OriginalPaper 02 February 2014 Pages: 52 - 66
\(L(p,q)\)-labeling and integer tension of a graph embedded on torus Xiaoling L. ZhangJianguo G. Qian OriginalPaper 18 February 2014 Pages: 67 - 77
Erratum to: \(L(p, q)\)-labeling and integer tension of a graph embedded on torus Xiaoling ZhangJianguo Qian Erratum 09 March 2014 Pages: 78 - 78
Minimax regret vertex 2-sink location problem in dynamic path networks Hongmei LiYinfeng XuGuanqun Ni OriginalPaper 21 February 2014 Pages: 79 - 94
Algorithms for randomized time-varying knapsack problems Yichao HeXinlu ZhangSuogang Gao OriginalPaper 23 February 2014 Pages: 95 - 117
Information exchange with collision detection on multiple channels Yuepeng WangYuexuan WangFrancis C. M. Lau OriginalPaper 23 February 2014 Pages: 118 - 135
A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem Yishuo ShiYaping ZhangWeili Wu OriginalPaper 25 February 2014 Pages: 136 - 151
The blocking job shop with rail-bound transportation Reinhard BürgyHeinz Gröflin OriginalPaper 06 March 2014 Pages: 152 - 181
Maximally edge-connected graphs and Zeroth-order general Randić index for \(\alpha \le -1\) Guifu SuLiming XiongGuojun Li OriginalPaper 11 March 2014 Pages: 182 - 195
Polynomial algorithms for canonical forms of orientations Martin Kochol OriginalPaper 16 April 2014 Pages: 218 - 222
Some Motzkin–Straus type results for non-uniform hypergraphs Ran GuXueliang LiYongtang Shi OriginalPaper 19 April 2014 Pages: 223 - 238
1.61-approximation for min-power strong connectivity with two power levels Gruia Călinescu OriginalPaper 03 May 2014 Pages: 239 - 259
Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan Kejun ZhaoXiwen Lu OriginalPaper 08 May 2014 Pages: 260 - 278
Minimum-latency aggregation scheduling in wireless sensor network Longjiang GuoYingshu LiZhipeng Cai OriginalPaper 08 May 2014 Pages: 279 - 310
A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs Domingos M. CardosoCarlos J. Luz OriginalPaper 09 May 2014 Pages: 311 - 326
Cacti with the smallest, second smallest, and third smallest Gutman index Shubo Chen OriginalPaper 13 May 2014 Pages: 327 - 332
Signed Roman edge domination numbers in graphs H. Abdollahzadeh AhangarJ. AmjadiY. Zhao OriginalPaper 13 May 2014 Pages: 333 - 346
Efficient algorithms for cluster editing Lucas BastosLuiz Satoru OchiRian Gabriel S. Pinheiro OriginalPaper 18 May 2014 Pages: 347 - 371
An efficient algorithm for distance total domination in block graphs Yancai ZhaoErfang Shan OriginalPaper 06 June 2014 Pages: 372 - 381
Atoms of cyclic edge connectivity in regular graphs Jin-Xin Zhou OriginalPaper 06 June 2014 Pages: 382 - 395
L(2,1)-labelings of the edge-multiplicity-paths-replacement of a graph Damei LüJianping Sun OriginalPaper 10 June 2014 Pages: 396 - 404
On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs Wensong Lin OriginalPaper 11 June 2014 Pages: 405 - 426
Further properties on the degree distance of graphs Hongzhuan WangLiying Kang OriginalPaper 12 June 2014 Pages: 427 - 446
