Improved PTAS for the constrained k-means problem Qilong FengJiaxin HuJianxin Wang OriginalPaper 23 August 2018 Pages: 1091 - 1110
Approximation algorithms for distance constraint sweep coverage with base stations Jian LiangXiaohui HuangZhao Zhang OriginalPaper 23 August 2018 Pages: 1111 - 1125
Improved bounds for the greedy strategy in optimization problems with curvature Yajing LiuEdwin K. P. ChongAli Pezeshki OriginalPaper 29 August 2018 Pages: 1126 - 1149
On the complexity of restoring corrupted colorings Marzio De BiasiJuho Lauri OriginalPaper 30 August 2018 Pages: 1150 - 1169
An approximation algorithm for genome sorting by reversals to recover all adjacencies Shanshan ZhaiPeng ZhangGuohui Lin OriginalPaper 31 August 2018 Pages: 1170 - 1190
Verifying a scheduling protocol of safety-critical systems Meng WangCong TianHongwei Du OriginalPaper 03 September 2018 Pages: 1191 - 1215
A new look at the returning secretary problem J. M. Grau Ribas OriginalPaper 19 September 2018 Pages: 1216 - 1236
Speech corpora subset selection based on time-continuous utterances features Luobing DongQiumin GuoWeili Wu OriginalPaper 21 September 2018 Pages: 1237 - 1248
Balanced tree partition problems with virtual nodes Baoling NingJianzhong LiShouxu Jiang OriginalPaper 29 September 2018 Pages: 1249 - 1265
Speed scaling on parallel processors with migration Eric AngelEvripidis BampisDimitrios Letsios OriginalPaper Open access 12 October 2018 Pages: 1266 - 1282
Positive-instance driven dynamic programming for treewidth Hisao Tamaki OriginalPaper 16 October 2018 Pages: 1283 - 1311
LP-based pivoting algorithm for higher-order correlation clustering Takuro Fukunaga OriginalPaper Open access 22 October 2018 Pages: 1312 - 1326
On the 2-rainbow domination stable graphs Zepeng LiZehui ShaoTaiyin Zhao OriginalPaper 29 October 2018 Pages: 1327 - 1341
Independence and matching number of some graphs Ming ChenYusheng LiYiting Yang OriginalPaper 30 October 2018 Pages: 1342 - 1350
On operations preserving semi-transitive orientability of graphs Ilkyoo ChoiJinha KimMinki Kim OriginalPaper 31 October 2018 Pages: 1351 - 1366
Estimating the number of basins of attraction of multi-objective combinatorial problems Madalina M. Drugan OriginalPaper 01 November 2018 Pages: 1367 - 1407
Efficient algorithms for computing one or two discrete centers hitting a set of line segments Xiaozhou HeZhihui LiuBinhai Zhu OriginalPaper 07 November 2018 Pages: 1408 - 1423
