| 2022 | Locating Service and Charging Stations. | Rajni Dabas, Naveen Garg, Neelima Gupta, Dilpreet Kaur |
| 2022 | Stochastic Graph Exploration with Limited Resources. | Ilan Reuven Cohen |
| 2022 | Approximating Length-Restricted Means Under Dynamic Time Warping. | Maike Buchin, Anne Driemel, Koen van Greevenbroek, Ioannis Psarros, Dennis Rohde |
| 2022 | Scheduling with Machine Conflicts. | Moritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt |
| 2022 | On Streaming Algorithms for Geometric Independent Set and Clique. | Sujoy Bhore, Fabian Klute, Jelle J. Oostveen |
| 2022 | Canadian Traveller Problem with Predictions. | Evripidis Bampis, Bruno Escoffier, Michalis Xefteris |
| 2022 | An Improved Algorithm for Open Online Dial-a-Ride. | Jlia Baligcs, Yann Disser, Nils Mosis, David Weckbecker |
| 2022 | Knapsack Secretary Through Boosting. | Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendrfer |
| 2021 | FIFO and Randomized Competitive Packet Routing Games. | Bjoern Tauer, Laura Vargas Koch |
| 2021 | An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity. | Hao Sun |
| 2021 | Server Cloud Scheduling. | Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop |
| 2021 | Precedence-Constrained Covering Problems with Multiplicity Constraints. | Stavros G. Kolliopoulos, Antonis Skarlatos |
| 2021 | EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource. | G. Jaykrishnan, Asaf Levin |
| 2021 | The Traveling k-Median Problem: Approximating Optimal Network Coverage. | Dylan Huizing, Guido Schfer |
| 2021 | Improved Online Algorithm for Fractional Knapsack in the Random Order Model. | Jeff Giliberti, Andreas Karrenbauer |
| 2021 | Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle. | Waldo Glvez, Francisco Sanhueza-Matamala, Jos A. Soto |
| 2021 | On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem. | Toshihiro Fujito, Takumi Tatematsu |
| 2021 | Several Methods of Analysis for Cardinality Constrained Bin Packing. | Leah Epstein |
| 2021 | Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems. | Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski |
| 2021 | Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. | Yann Disser, Max Klimm, David Weckbecker |
| 2021 | Weighted Completion Time Minimization for Capacitated Parallel Machines. | Ilan Reuven Cohen, Izack Cohen, Iyar Zaks |
| 2021 | Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. | Vclav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matys Kristan, Ondrej Such, Toms Valla |
| 2021 | Improved Analysis of Online Balanced Clustering. | Marcin Bienkowski, Martin Bhm, Martin Kouteck, Thomas Rothvo, Jir Sgall, Pavel Vesel |
| 2021 | Contention Resolution, Matrix Scaling and Fair Allocation. | Nikhil Bansal, Ilan Reuven Cohen |
| 2020 | Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique. | Guido Schfer, Bernard G. Zweers |