An Improved Approximation Algorithm for Knapsack Median Using Sparsification Jarosław ByrkaThomas PensylKhoa Trinh OriginalPaper Open access 29 January 2018 Pages: 1093 - 1114
On the Efficiency of All-Pay Mechanisms George ChristodoulouAlkmini SgouritsaBo Tang OriginalPaper Open access 17 March 2017 Pages: 1115 - 1145
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques Fedor V. FominMathieu LiedloffIoan Todinca OriginalPaper 27 February 2017 Pages: 1146 - 1169
Approximating the Generalized Minimum Manhattan Network Problem Aparna DasKrzysztof FleszarAlexander Wolff OriginalPaper 02 March 2017 Pages: 1170 - 1190
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions Wiebke HöhnJulián MestreAndreas Wiese OriginalPaper Open access 17 March 2017 Pages: 1191 - 1213
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices Thomas BläsiusAnnette KarrerIgnaz Rutter OriginalPaper 15 March 2017 Pages: 1214 - 1277
From Discrepancy to Majority David EppsteinDaniel S. Hirschberg OriginalPaper 16 March 2017 Pages: 1278 - 1297
Greedy Oriented Flows Ulrich FaigleWalter KernBritta Peis OriginalPaper Open access 30 March 2017 Pages: 1298 - 1314
Semi-Group Range Sum Revisited: Query-Space Lower Bound Tightened Xiaocheng HuYufei TaoShuigeng Zhou OriginalPaper 03 April 2017 Pages: 1315 - 1329
An \(O(\log \mathrm {OPT})\)-Approximation for Covering and Packing Minor Models of \(\theta _r\) Dimitris ChatzidimitriouJean-Florent RaymondDimitrios M. Thilikos OriginalPaper Open access 28 April 2017 Pages: 1330 - 1356
Estimating the Makespan of the Two-Valued Restricted Assignment Problem Klaus JansenKati LandMarten Maack OriginalPaper 27 April 2017 Pages: 1357 - 1382
Optimal Staged Self-Assembly of General Shapes Cameron ChalkEric MartinezTim Wylie OriginalPaper 04 May 2017 Pages: 1383 - 1409