| 2025 | Approximation and Online Algorithms - 22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024, Proceedings Marcin Bienkowski, Matthias Englert |
| 2024 | Approximate Min-Sum Subset Convolution. Mihail Stoian |
| 2024 | Approximating δ-Covering. Tim A. Hartmann, Tom Janßen |
| 2024 | Approximation Algorithms for k-Scenario Matching. Danny Blom, Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Bart Smeulders |
| 2024 | Bounding the Price-of-Fair-Sharing Using Knapsack-Cover Constraints to Guide Near-Optimal Cost-Recovery Algorithms. Sander Aarts, Jacob Dentes, Manxi Wu, David B. Shmoys |
| 2024 | Complexity of Fixed Order Routing. Steven Miltenburg, Tim Oosterwijk, René Sitters |
| 2024 | Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching. Stefan Hougardy, Karolina Tammemaa |
| 2024 | Improved Approximation Algorithms for Covering Pliable Set Families and Flexible Graph Connectivity. Zeev Nutov |
| 2024 | Improved Online Scheduling with Restarts on a Single Machine. Aflatoun Amouzandeh, Rob van Stee |
| 2024 | Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths. Rajesh Chitnis, Samuel Thomas, Anthony Wirth |
| 2024 | Maximizing Throughput for Parallel Jobs with Speed-Up Curves. Kefu Lu, Mason Marchetti |
| 2024 | Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line. Tung-Wei Kuo |
| 2024 | Online String Attractors - And Their Relation to the Lempel-Ziv Factorization. Philip Whittington |
| 2024 | Searching in Euclidean Spaces with Predictions. Sergio Cabello, Panos Giannopoulos |
| 2024 | Small Additive Error for Unsplittable Multicommodity Flow in Outerplanar Graphs. Richard Shapley, David B. Shmoys |
| 2024 | Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees. Svein Høgemo |