The longest commonly positioned increasing subsequences problem Xiaozhou HeYinfeng Xu OriginalPaper 09 September 2017 Pages: 331 - 340
Arcs in \(\mathbb Z^2_{2p}\) Zofia StȩpieńLucjan Szymaszkiewicz OriginalPaper Open access 12 September 2017 Pages: 341 - 349
Tight bounds for NF-based bounded-space online bin packing algorithms József BékésiGábor Galambos OriginalPaper 14 September 2017 Pages: 350 - 364
Vertex arboricity of planar graphs without intersecting 5-cycles Hua CaiJianliang WuLin Sun OriginalPaper 25 September 2017 Pages: 365 - 372
On vertex-parity edge-colorings Borut LužarMirko PetruševskiRiste Škrekovski OriginalPaper 27 September 2017 Pages: 373 - 388
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints K. SubramaniPiotr Wojciechowski OriginalPaper 27 September 2017 Pages: 389 - 408
A local search approximation algorithm for the uniform capacitated k-facility location problem Lu HanDachuan XuDongmei Zhang OriginalPaper 30 September 2017 Pages: 409 - 423
Algorithm complexity of neighborhood total domination and \((\rho ,\gamma _{nt})\)-graphs Changhong LuBing WangKan Wang OriginalPaper 10 October 2017 Pages: 424 - 435
A characterization of linearizable instances of the quadratic minimum spanning tree problem Ante ĆustićAbraham P. Punnen OriginalPaper 11 October 2017 Pages: 436 - 453
Upper bounds for adjacent vertex-distinguishing edge coloring Junlei ZhuYuehua BuYun Dai OriginalPaper 14 October 2017 Pages: 454 - 462
Properly colored trails, paths, and bridges Wayne GoddardRobert Melville OriginalPaper 20 October 2017 Pages: 463 - 472
A low complexity semidefinite relaxation for large-scale MIMO detection Rupaj Kumar NayakMahendra Prasad Biswal OriginalPaper 22 October 2017 Pages: 473 - 492
An approximation algorithm for soft capacitated k-facility location problem Yanjun JiangDachuan XuDongmei Zhang OriginalPaper 23 October 2017 Pages: 493 - 511
From theory to practice: maximizing revenues for on-line dial-a-ride Ananya ChristmanWilliam ForcierAayam Poudel OriginalPaper 25 October 2017 Pages: 512 - 529
Online lazy bureaucrat scheduling with a machine deadline Ling GaiGuochuan Zhang OriginalPaper 26 October 2017 Pages: 530 - 537
The connected disk covering problem Yi XuJigen PengBinhai Zhu OriginalPaper 27 October 2017 Pages: 538 - 554
List-edge-coloring of planar graphs without 6-cycles with three chords Haiying WangJianliang Wu OriginalPaper 31 October 2017 Pages: 555 - 562
Two-step values for games with two-level communication structure Sylvain BéalAnna KhmelnitskayaPhilippe Solal OriginalPaper Open access 01 November 2017 Pages: 563 - 587
Two extremal problems related to orders Biao WuYuejian Peng OriginalPaper 02 November 2017 Pages: 588 - 612
On computing a minimum secure dominating set in block graphs D. PradhanAnupriya Jha OriginalPaper 08 November 2017 Pages: 613 - 631
Bin packing game with a price of anarchy of \(\frac{3}{2}\) Q. Q. NongT. SunQ. Z. Fang OriginalPaper 09 November 2017 Pages: 632 - 640
Computational aspects of greedy partitioning of graphs Piotr Borowiecki OriginalPaper Open access 11 November 2017 Pages: 641 - 665
