1. Special Issue for FAW 2014

   • Jianer Chen
   • John E. Hopcroft

   Preface 15 June 2016 Pages: 1 - 2

2. Algorithms for the workflow satisfiability problem engineered for counting constraints

   • D. Cohen
   • J. Crampton
   • M. Jones

   OriginalPaper 19 April 2015 Pages: 3 - 24

   

3. Dynamic matchings in left vertex weighted convex bipartite graphs

   • Quan Zu
   • Miaomiao Zhang
   • Bin Yu

   OriginalPaper 05 May 2015 Pages: 25 - 50

   

4. Performances of pure random walk algorithms on constraint satisfaction problems with growing domains

   • Wei Xu
   • Fuzhou Gong

   OriginalPaper 07 May 2015 Pages: 51 - 66

   

5. Kernelization and randomized Parameterized algorithms for Co-path Set problem

   • Qilong Feng
   • Qian Zhou
   • Jianxin Wang

   OriginalPaper 28 May 2015 Pages: 67 - 78

   

6. Constrained pairwise and center-star sequences alignment problems

   • Yong Zhang
   • Joseph Wun-Tat Chan
   • Jianyu Shi

   OriginalPaper 06 June 2015 Pages: 79 - 94

7. Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs

   • Hao Chen
   • Zihan Lei
   • Ke Xu

   OriginalPaper 10 June 2015 Pages: 95 - 110

   

8. Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees

   • Feng Shi
   • Qilong Feng
   • Jianxin Wang

   OriginalPaper 12 June 2015 Pages: 111 - 143

   

9. Efficient approximation algorithms for computing k disjoint constrained shortest paths

   • Longkun Guo

   OriginalPaper 23 July 2015 Pages: 144 - 158

   

10. Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs

    • Pawan Aurora
    • Sumit Singh
    • Shashank K. Mehta

    OriginalPaper 07 April 2015 Pages: 159 - 173

    

11. Strong minimum energy hierarchical topology in wireless sensor networks

    • B. S. Panda
    • D. Pushparaj Shetty

    OriginalPaper 02 April 2015 Pages: 174 - 187

    

12. List edge and list total coloring of planar graphs with maximum degree 8

    • Huijuan Wang
    • Bin Liu
    • Hongwei Gao

    OriginalPaper 02 April 2015 Pages: 188 - 197

    

13. New analysis and computational study for the planar connected dominating set problem

    • Marjan Marzban
    • Qian-Ping Gu
    • Xiaohua Jia

    OriginalPaper 02 April 2015 Pages: 198 - 225

    

14. A complexity dichotomy and a new boundary class for the dominating set problem

    • D. S. Malyshev

    OriginalPaper 03 April 2015 Pages: 226 - 243

15. 2-Distance coloring of a planar graph without 3, 4, 7-cycles

    • Yuehua Bu
    • Xia Lv

    OriginalPaper 03 April 2015 Pages: 244 - 259

    

16. Upper bounds for the total rainbow connection of graphs

    • Hui Jiang
    • Xueliang Li
    • Yingying Zhang

    OriginalPaper 08 April 2015 Pages: 260 - 266

    

17. Computing unique maximum matchings in \(O(m)\) time for König–Egerváry graphs and unicyclic graphs

    • Vadim E. Levit
    • Eugen Mandrescu

    OriginalPaper 17 April 2015 Pages: 267 - 277

    

18. Distributed wireless link scheduling in the SINR model

    • Dongxiao Yu
    • Yuexuan Wang
    • Francis C. M. Lau

    OriginalPaper 18 April 2015 Pages: 278 - 292

    

19. On strongly planar 3SAT

    • Lidong Wu

    OriginalPaper 11 April 2015 Pages: 293 - 298

    

20. Signed mixed Roman domination numbers in graphs

    • H. Abdollahzadeh Ahangar
    • L. Asgharsharghi
    • L. Volkmann

    OriginalPaper 28 April 2015 Pages: 299 - 317

21. Complete forcing numbers of primitive coronoids

    • Shou-Jun Xu
    • Xiu-Song Liu
    • Heping Zhang

    OriginalPaper 30 April 2015 Pages: 318 - 330