1. The longest commonly positioned increasing subsequences problem

   • Xiaozhou He
   • Yinfeng Xu

   OriginalPaper 09 September 2017 Pages: 331 - 340

   

2. Arcs in \(\mathbb Z^2_{2p}\)

   • Zofia Stȩpień
   • Lucjan Szymaszkiewicz

   OriginalPaper Open access 12 September 2017 Pages: 341 - 349

   

3. Tight bounds for NF-based bounded-space online bin packing algorithms

   • József Békési
   • Gábor Galambos

   OriginalPaper 14 September 2017 Pages: 350 - 364

   

4. Vertex arboricity of planar graphs without intersecting 5-cycles

   • Hua Cai
   • Jianliang Wu
   • Lin Sun

   OriginalPaper 25 September 2017 Pages: 365 - 372

   

5. On vertex-parity edge-colorings

   • Borut Lužar
   • Mirko Petruševski
   • Riste Škrekovski

   OriginalPaper 27 September 2017 Pages: 373 - 388

   

6. A certifying algorithm for lattice point feasibility in a system of UTVPI constraints

   • K. Subramani
   • Piotr Wojciechowski

   OriginalPaper 27 September 2017 Pages: 389 - 408

   

7. A local search approximation algorithm for the uniform capacitated k-facility location problem

   • Lu Han
   • Dachuan Xu
   • Dongmei Zhang

   OriginalPaper 30 September 2017 Pages: 409 - 423

   

8. Algorithm complexity of neighborhood total domination and \((\rho ,\gamma _{nt})\)-graphs

   • Changhong Lu
   • Bing Wang
   • Kan Wang

   OriginalPaper 10 October 2017 Pages: 424 - 435

   

9. A characterization of linearizable instances of the quadratic minimum spanning tree problem

   • Ante Ćustić
   • Abraham P. Punnen

   OriginalPaper 11 October 2017 Pages: 436 - 453

   

10. Upper bounds for adjacent vertex-distinguishing edge coloring

    • Junlei Zhu
    • Yuehua Bu
    • Yun Dai

    OriginalPaper 14 October 2017 Pages: 454 - 462

11. Properly colored trails, paths, and bridges

    • Wayne Goddard
    • Robert Melville

    OriginalPaper 20 October 2017 Pages: 463 - 472

    

12. A low complexity semidefinite relaxation for large-scale MIMO detection

    • Rupaj Kumar Nayak
    • Mahendra Prasad Biswal

    OriginalPaper 22 October 2017 Pages: 473 - 492

    

13. An approximation algorithm for soft capacitated k-facility location problem

    • Yanjun Jiang
    • Dachuan Xu
    • Dongmei Zhang

    OriginalPaper 23 October 2017 Pages: 493 - 511

    

14. From theory to practice: maximizing revenues for on-line dial-a-ride

    • Ananya Christman
    • William Forcier
    • Aayam Poudel

    OriginalPaper 25 October 2017 Pages: 512 - 529

    

15. Online lazy bureaucrat scheduling with a machine deadline

    • Ling Gai
    • Guochuan Zhang

    OriginalPaper 26 October 2017 Pages: 530 - 537

16. The connected disk covering problem

    • Yi Xu
    • Jigen Peng
    • Binhai Zhu

    OriginalPaper 27 October 2017 Pages: 538 - 554

    

17. List-edge-coloring of planar graphs without 6-cycles with three chords

    • Haiying Wang
    • Jianliang Wu

    OriginalPaper 31 October 2017 Pages: 555 - 562

18. Two-step values for games with two-level communication structure

    • Sylvain Béal
    • Anna Khmelnitskaya
    • Philippe Solal

    OriginalPaper Open access 01 November 2017 Pages: 563 - 587

19. Two extremal problems related to orders

    • Biao Wu
    • Yuejian Peng

    OriginalPaper 02 November 2017 Pages: 588 - 612

    

20. On computing a minimum secure dominating set in block graphs

    • D. Pradhan
    • Anupriya Jha

    OriginalPaper 08 November 2017 Pages: 613 - 631

    

21. Bin packing game with a price of anarchy of \(\frac{3}{2}\)

    • Q. Q. Nong
    • T. Sun
    • Q. Z. Fang

    OriginalPaper 09 November 2017 Pages: 632 - 640

22. Computational aspects of greedy partitioning of graphs

    • Piotr Borowiecki

    OriginalPaper Open access 11 November 2017 Pages: 641 - 665