| 2020 | 2-Node-Connectivity Network Design. | Zeev Nutov |
| 2020 | A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks. | Raghunath Reddy Madireddy, Apurva Mudgal |
| 2020 | Online Coloring and a New Type of Adversary for Online Graph Problems. | Yaqiao Li, Vishnu V. Narayan, Denis Pankratov |
| 2020 | A Faster FPTAS for Knapsack Problem with Cardinality Constraint. | Wenxin Li, Joohyun Lee, Ness B. Shroff |
| 2020 | An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem. | Ardalan Khazraei, Stephan Held |
| 2020 | Distributed Algorithms for Matching in Hypergraphs. | Oussama Hanguir, Clifford Stein |
| 2020 | Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. | Magns M. Halldrsson, Guy Kortsarz, Marek Cygan |
| 2020 | Lasserre Integrality Gaps for Graph Spanners and Related Problems. | Michael Dinitz, Yasamin Nazari, Zeyu Zhang |
| 2020 | Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics. | Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos |
| 2020 | Concave Connection Cost Facility Location and the Star Inventory Routing Problem. | Jaroslaw Byrka, Mateusz Lewandowski |
| 2020 | To Close Is Easier Than To Open: Dual Parameterization To k-Median. | Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk |
| 2020 | LP-Based Algorithms for Multistage Minimization Problems. | Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov |
| 2020 | A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. | Stav Ashur, Omrit Filtser, Matthew J. Katz |
| 2020 | Explorable Uncertainty in Scheduling with Non-uniform Testing Times. | Susanne Albers, Alexander Eckl |
| 2019 | Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. | Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong |
| 2019 | Improved (In-)Approximability Bounds for d-Scattered Set. | Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
| 2019 | Fault Tolerant Clustering with Outliers. | Tanmay Inamdar, Kasturi R. Varadarajan |
| 2019 | Precedence-Constrained Scheduling and Min-Sum Set Cover. | Felix Happach, Andreas S. Schulz |
| 2019 | Approximate Strong Edge-Colouring of Unit Disk Graphs. | Nicolas Grelier, Rmi de Joannis de Verclos, Ross J. Kang, Franois Pirot |
| 2019 | On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. | Waldo Glvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat |
| 2019 | Managing Multiple Mobile Resources. | Bjrn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide |
| 2019 | Parallel Online Algorithms for the Bin Packing Problem. | Sndor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt |
| 2019 | An Improved Upper Bound for the Ring Loading Problem. | Karl Dubel |
| 2019 | Streaming Algorithms for Bin Packing and Vector Scheduling. | Graham Cormode, Pavel Vesel |
| 2019 | Approximation Results for Makespan Minimization with Budgeted Uncertainty. | Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder |