1. Efficient identifications of structural similarities for graphs

   • Zheng Fang
   • Jie Wang

   OriginalPaper 23 May 2012 Pages: 209 - 220

   

2. An improved distributed data aggregation scheduling in wireless sensor networks

   • Deying Li
   • Qinghua Zhu
   • Jianzhong Li

   OriginalPaper 26 May 2012 Pages: 221 - 240

   

3. Signed Roman domination in graphs

   • H. Abdollahzadeh Ahangar
   • Michael A. Henning
   • Vladimir Samodivkin

   OriginalPaper 22 June 2012 Pages: 241 - 255

   

4. A study of search algorithms’ optimization speed

   • Andrea Valsecchi
   • Leonardo Vanneschi
   • Giancarlo Mauri

   OriginalPaper 23 June 2012 Pages: 256 - 270

   

5. Sharp bounds of the Zagreb indices of k-trees

   • John Estes
   • Bing Wei

   OriginalPaper 23 June 2012 Pages: 271 - 291

   

6. Generalized perfect domination in graphs

   • B. Chaluvaraju
   • K. A. Vidya

   OriginalPaper 26 June 2012 Pages: 292 - 301

   

7. An efficient FPRAS type group testing procedure to approximate the number of defectives

   • Yongxi Cheng
   • Yinfeng Xu

   OriginalPaper 26 June 2012 Pages: 302 - 314

8. Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems

   • Zi Xu
   • Donglei Du
   • Dachuan Xu

   OriginalPaper 29 June 2012 Pages: 315 - 327

   

9. On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube

   • Tzu-Liang Kung
   • Cheng-Kuan Lin
   • Lih-Hsing Hsu

   OriginalPaper 29 June 2012 Pages: 328 - 344

   

10. Boundary graph classes for some maximum induced subgraph problems

    • Dmitriy S. Malyshev

    OriginalPaper 29 June 2012 Pages: 345 - 354

    

11. Circular L(j,k)-labeling number of direct product of path and cycle

    • Qiong Wu
    • Wai Chee Shiu
    • Pak Kiu Sun

    OriginalPaper 03 July 2012 Pages: 355 - 368

    

12. Total and paired domination numbers of toroidal meshes

    • Fu-Tao Hu
    • Jun-Ming Xu

    OriginalPaper 06 July 2012 Pages: 369 - 378

    

13. The adjacent vertex distinguishing total coloring of planar graphs

    • Weifan Wang
    • Danjun Huang

    OriginalPaper 06 July 2012 Pages: 379 - 396

14. Improvements to MCS algorithm for the maximum clique problem

    • Mikhail Batsyn
    • Boris Goldengorin
    • Panos M. Pardalos

    OriginalPaper 09 January 2013 Pages: 397 - 416