1. A sufficient condition for planar graphs to be (3, 1)-choosable

   • Min Chen
   • Yingying Fan
   • Weifan Wang

   OriginalPaper 13 March 2017 Pages: 987 - 1011

   

2. Extremal coloring for the anti-Ramsey problem of matchings in complete graphs

   • Zemin Jin
   • Yuefang Sun
   • Yuping Zang

   OriginalPaper 13 March 2017 Pages: 1012 - 1028

3. Establishing symmetric connectivity in directional wireless sensor networks equipped with \(2\pi /3\) antennas

   • Tien Tran
   • Min Kyung An
   • Dung T. Huynh

   OriginalPaper 21 March 2017 Pages: 1029 - 1051

   

4. Approximation for vertex cover in \(\beta \)-conflict graphs

   • Dongjing Miao
   • Zhipeng Cai
   • Jianzhong Li

   OriginalPaper 21 March 2017 Pages: 1052 - 1059

   

5. The k-hop connected dominating set problem: approximation and hardness

   • Rafael S. Coelho
   • Phablo F. S. Moura
   • Yoshiko Wakabayashi

   OriginalPaper 21 March 2017 Pages: 1060 - 1083

   

6. An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs

   • Wei Ding
   • Ke Qiu

   OriginalPaper 11 April 2017 Pages: 1084 - 1095

   

7. Competitive analysis of bi-directional non-preemptive conversion

   • Günter Schmidt

   OriginalPaper 17 April 2017 Pages: 1096 - 1113

   

8. On the Langberg–Médard multiple unicast conjecture

   • Kai Cai
   • Guangyue Han

   OriginalPaper 28 April 2017 Pages: 1114 - 1132

9. A primal–dual online algorithm for the k-server problem on weighted HSTs

   • Wenbin Chen
   • Fufang Li
   • Xiuni Wang

   OriginalPaper 09 May 2017 Pages: 1133 - 1146

   

10. Neighbor sum distinguishing total coloring of planar graphs without 4-cycles

    • Hongjie Song
    • Changqing Xu

    OriginalPaper 23 May 2017 Pages: 1147 - 1158

    

11. Discrete parallel machine makespan ScheLoc problem

    • Corinna Heßler
    • Kaouthar Deghdak

    OriginalPaper 22 May 2017 Pages: 1159 - 1186

    

12. An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities

    • Ruyan Fu
    • Ji Tian
    • Jinjiang Yuan

    OriginalPaper 16 May 2017 Pages: 1187 - 1197

13. Bin packing under linear constraints

    • Zhenbo Wang
    • Kameng Nip

    OriginalPaper 25 May 2017 Pages: 1198 - 1209

    

14. Hamiltonian numbers in oriented graphs

    • Li-Da Tong
    • Hao-Yu Yang

    OriginalPaper 24 May 2017 Pages: 1210 - 1217

15. Change-making problems revisited: a parameterized point of view

    • Steffen Goebbels
    • Frank Gurski
    • Eda Yilmaz

    OriginalPaper 30 May 2017 Pages: 1218 - 1236

    

16. Online set multicover algorithms for dynamic D2D communications

    • Alan Kuhnle
    • Xiang Li
    • My T. Thai

    OriginalPaper 09 June 2017 Pages: 1237 - 1264

    

17. The computational complexity of QoS measures for orchestrations

    • Joaquim Gabarro
    • Sergio Leon-Gaixas
    • Maria Serna

    OriginalPaper 24 June 2017 Pages: 1265 - 1301

    

18. 2-Distance coloring of planar graphs with girth 5

    • Wei Dong
    • Baogang Xu

    OriginalPaper 30 June 2017 Pages: 1302 - 1322