Minimum statuses of connected graphs with fixed maximum degree and order Chiang LinWei-Han TsaiYuan-Jen Zhang OriginalPaper 05 October 2011 Pages: 147 - 161
The total {k}-domatic number of wheels and complete graphs Jing ChenXinmin HouNing Li OriginalPaper 21 December 2010 Pages: 162 - 175
Vertices in all minimum paired-dominating sets of block graphs Lei ChenChanghong LuZhenbing Zeng OriginalPaper 12 January 2011 Pages: 176 - 191
The second largest number of maximal independent sets in connected graphs with at most one cycle Min-Jen Jou OriginalPaper 21 January 2011 Pages: 192 - 201
Min-cost multiflows in node-capacitated undirected networks Maxim A. BabenkoAlexander V. Karzanov OriginalPaper 29 January 2011 Pages: 202 - 228
Approximation schemes for two-machine flow shop scheduling with two agents Wenchang LuoLin ChenGuochuan Zhang OriginalPaper 19 January 2011 Pages: 229 - 239
Long cycles in hypercubes with optimal number of faulty vertices Jiří FinkPetr Gregor OriginalPaper 27 January 2011 Pages: 240 - 265
On L(2,1)-labeling of generalized Petersen graphs Yuan-Zhen HuangChun-Ying ChiangHong-Gwa Yeh OriginalPaper 21 January 2011 Pages: 266 - 279
Random restricted matching and lower bounds for combinatorial optimization Stefan Steinerberger OriginalPaper 27 January 2011 Pages: 280 - 298
Some results on the injective chromatic number of graphs Min ChenGeňa HahnWeifan Wang OriginalPaper 26 January 2011 Pages: 299 - 318
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring Jianping LiWeidong LiLusheng Wang OriginalPaper 25 January 2011 Pages: 319 - 328
A Nordhaus-Gaddum-type result for the induced path number Johannes H. HattinghOsama A. SalehTerry J. Walters OriginalPaper 27 January 2011 Pages: 329 - 338
k-tuple total domination in cross products of graphs Michael A. HenningAdel P. Kazemi OriginalPaper 02 February 2011 Pages: 339 - 346
Exact combinatorial algorithms and experiments for finding maximum k-plexes Hannes MoserRolf NiedermeierManuel Sorge OriginalPaper 09 March 2011 Pages: 347 - 373
The complexity of influence maximization problem in the deterministic linear threshold model Zaixin LuWei ZhangBin Fu OriginalPaper 01 April 2011 Pages: 374 - 378
On cyclic vertex-connectivity of Cartesian product digraphs Da HuangZhao Zhang OriginalPaper 22 April 2011 Pages: 379 - 388
Note on the hardness of generalized connectivity Shasha LiXueliang Li OriginalPaper 14 May 2011 Pages: 389 - 396