Efficient identifications of structural similarities for graphs Zheng FangJie Wang OriginalPaper 23 May 2012 Pages: 209 - 220
An improved distributed data aggregation scheduling in wireless sensor networks Deying LiQinghua ZhuJianzhong Li OriginalPaper 26 May 2012 Pages: 221 - 240
Signed Roman domination in graphs H. Abdollahzadeh AhangarMichael A. HenningVladimir Samodivkin OriginalPaper 22 June 2012 Pages: 241 - 255
A study of search algorithms’ optimization speed Andrea ValsecchiLeonardo VanneschiGiancarlo Mauri OriginalPaper 23 June 2012 Pages: 256 - 270
Sharp bounds of the Zagreb indices of k-trees John EstesBing Wei OriginalPaper 23 June 2012 Pages: 271 - 291
Generalized perfect domination in graphs B. ChaluvarajuK. A. Vidya OriginalPaper 26 June 2012 Pages: 292 - 301
An efficient FPRAS type group testing procedure to approximate the number of defectives Yongxi ChengYinfeng Xu OriginalPaper 26 June 2012 Pages: 302 - 314
Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems Zi XuDonglei DuDachuan Xu OriginalPaper 29 June 2012 Pages: 315 - 327
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube Tzu-Liang KungCheng-Kuan LinLih-Hsing Hsu OriginalPaper 29 June 2012 Pages: 328 - 344
Boundary graph classes for some maximum induced subgraph problems Dmitriy S. Malyshev OriginalPaper 29 June 2012 Pages: 345 - 354
Circular L(j,k)-labeling number of direct product of path and cycle Qiong WuWai Chee ShiuPak Kiu Sun OriginalPaper 03 July 2012 Pages: 355 - 368
Total and paired domination numbers of toroidal meshes Fu-Tao HuJun-Ming Xu OriginalPaper 06 July 2012 Pages: 369 - 378
The adjacent vertex distinguishing total coloring of planar graphs Weifan WangDanjun Huang OriginalPaper 06 July 2012 Pages: 379 - 396
Improvements to MCS algorithm for the maximum clique problem Mikhail BatsynBoris GoldengorinPanos M. Pardalos OriginalPaper 09 January 2013 Pages: 397 - 416