1. Group irregularity strength of connected graphs

   • Marcin Anholcer
   • Sylwia Cichacz
   • Martin Milanic̆

   OriginalPaper Open access 22 May 2013 Pages: 1 - 17

   

2. PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs

   • Lidong Wu
   • Hongwei Du
   • Wonjun Lee

   OriginalPaper 23 May 2013 Pages: 18 - 26

   

3. An algorithm for the dominator chromatic number of a tree

   • Houcine Boumediene Merouane
   • Mustapha Chellali

   OriginalPaper 24 May 2013 Pages: 27 - 33

   

4. L(\(d\),1)-labelings of the edge-path-replacement by factorization of graphs

   • Nathaniel Karst
   • Jessica Oehrlein
   • Junjie Zhu

   OriginalPaper 26 May 2013 Pages: 34 - 41

   

5. Snakes, coils, and single-track circuit codes with spread \(k\)

   • Simon Hood
   • Daniel Recoskie
   • Dennis Wong

   OriginalPaper 29 May 2013 Pages: 42 - 62

   

6. Handling least privilege problem and role mining in RBAC

   • Hejiao Huang
   • Feng Shang
   • Hongwei Du

   OriginalPaper 02 June 2013 Pages: 63 - 86

   

7. An optimal randomized online algorithm for the \(k\)-Canadian Traveller Problem on node-disjoint paths

   • Marco Bender
   • Stephan Westphal

   OriginalPaper 07 June 2013 Pages: 87 - 96

   

8. Better approximation algorithms for influence maximization in online social networks

   • Yuqing Zhu
   • Weili Wu
   • Wen Xu

   OriginalPaper 09 June 2013 Pages: 97 - 108

   

9. Game domination subdivision number of a graph

   • O. Favaron
   • H. Karami
   • S. M. Sheikholeslami

   OriginalPaper 09 June 2013 Pages: 109 - 119

10. Dual power assignment optimization and fault tolerance in WSNs

    • Nhat X. Lam
    • Trac N. Nguyen
    • Dung T. Huynh

    OriginalPaper 15 June 2013 Pages: 120 - 138

    

11. Radio number for the product of a path and a complete graph

    • Byeong Moon Kim
    • Woonjae Hwang
    • Byung Chul Song

    OriginalPaper 23 June 2013 Pages: 139 - 149

    

12. A new randomized algorithm for group testing with unknown number of defective items

    • Yongxi Cheng
    • Jue Guo
    • Feifeng Zheng

    OriginalPaper 19 June 2013 Pages: 150 - 159

13. On total colorings of 1-planar graphs

    • Xin Zhang
    • Jianfeng Hou
    • Guizhen Liu

    OriginalPaper 19 June 2013 Pages: 160 - 173

    

14. On the complexity of partitioning a graph into a few connected subgraphs

    • Julien Bensmail

    OriginalPaper 23 June 2013 Pages: 174 - 187

    

15. On the constraint length of random \(k\)-CSP

    • Guangyan Zhou
    • Zongsheng Gao
    • Jun Liu

    OriginalPaper 04 April 2014 Pages: 188 - 200