| 2017 | Complexity and Approximation of the Longest Vector Sum Problem. | Vladimir Shenmaier |
| 2017 | Approximating Domination on Intersection Graphs of Paths on a Grid. | Saeed Mehrabi |
| 2017 | Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. | Alexander Mcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sren Riechers |
| 2017 | Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs. | Itay Laish, Shay Mozes |
| 2017 | Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints. | Naoyuki Kamiyama |
| 2017 | The Asymptotic Price of Anarchy for k-uniform Congestion Games. | Jasper de Jong, Walter Kern, Berend Steenhuisen, Marc Uetz |
| 2017 | Online Packing of Rectangular Items into Square Bins. | Janusz Januszewski, Lukasz Zielonka |
| 2017 | On Approximability of Connected Path Vertex Cover. | Toshihiro Fujito |
| 2017 | Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. | Michele Flammini, Gianpiero Monaco, Qiang Zhang |
| 2017 | The Online Multicommodity Connected Facility Location Problem. | Mrio Csar San Felice, Cristina G. Fernandes, Carla Negri Lintzmayer |
| 2017 | Deadline TSP. | Boaz Farbstein, Asaf Levin |
| 2017 | Online Unit Clustering in Higher Dimensions. | Adrian Dumitrescu, Csaba D. Tth |
| 2017 | On-line Search in Two-Dimensional Environment. | Dariusz Dereniowski, Dorota Urbanska |
| 2017 | Improved PTASs for Convex Barrier Coverage. | Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein |
| 2017 | On Conceptually Simple Algorithms for Variants of Online Bipartite Matching. | Allan Borodin, Denis Pankratov, Amirali Salehi-Abari |
| 2017 | On Packet Scheduling with Adversarial Jamming and Speedup. | Martin Bhm, Lukasz Jez, Jir Sgall, Pavel Vesel |
| 2017 | A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. | Felix Biermeier, Bjrn Feldkord, Manuel Malatyali, Friedhelm Meyer auf der Heide |
| 2017 | A Match in Time Saves Nine: Deterministic Online Matching with Delays. | Marcin Bienkowski, Artur Kraska, Pawel Schmidt |
| 2017 | Capacitated Domination Problems on Planar Graphs. | Amariah Becker |
| 2017 | Lower Bounds for Several Online Variants of Bin Packing. | Jnos Balogh, Jzsef Bksi, Gyrgy Dsa, Leah Epstein, Asaf Levin |
| 2017 | A Tight Lower Bound for Online Convex Optimization with Switching Costs. | Antonios Antoniadis, Kevin Schewior |
| 2017 | A Bicriteria Approximation Algorithm for the k-Center and k-Median Problems. | Soroush Alamdari, David B. Shmoys |
| 2017 | A k-Median Based Online Algorithm for the Stochastic k-Server Problem. | Abhijin Adiga, Alexander D. Friedman, Sharath Raghvendra |
| 2016 | Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. | Felix J. L. Willamowski, Andreas Bley |
| 2016 | Resource Allocation Games with Multiple Resource Classes. | Roy B. Ofer, Tami Tamir |