| 2025 | Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three. | Kanstantsin Pashkovich, Thomas Snow |
| 2025 | Improved Online Sorting. | Jubayer Nirjhor, Nicole Wein |
| 2025 | Buy-at-Bulk Facility Location on Trees. | Shamisa Nematollahi, Daniel Vaz |
| 2025 | On the FirstFit Algorithm for Online Unit-Interval Coloring. | Bob Krekelberg, Alison Hsiang-Hsuan Liu |
| 2025 | Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem. | Hiroshi Fujiwara, Rina Atsumi, Hiroaki Yamamoto |
| 2025 | Approximation Algorithms for Graph Search Problems with Imperfect Detection. | Martijn van Ee, Ren Sitters |
| 2025 | Incremental-Decremental Maximization. | Yann Disser, Max Klimm, Annette Lutz, Lea Strubberg |
| 2025 | Low Recourse Arborescence Forests Under Uniformly Random Arcs. | J. Niklas Dahlmeier, D. Ellis Hershkowitz |
| 2025 | Controlling Tail Risk in Two-Slope Ski Rental. | Qiming Cui, Michael Dinitz |
| 2025 | Hardness of Dynamic Core and Truss Decompositions. | Y. S. Couto, Cristina G. Fernandes |
| 2025 | Online General Knapsack with Reservation Costs. | Elisabet Burjons, Matthias Gehnen |
| 2025 | Robust Scheduling on Uniform Machines - New Results Using a Relaxed Approximation Guarantee. | Hauke Brinkop, David Fischer, Klaus Jansen |
| 2025 | Simple Approximations for General Spanner Problems. | Fritz Bkler, Markus Chimani, Henning Jasper |
| 2025 | The Online Piercing Set Problem with Recourse. | Riju Bindua, Minati De, Naveen Garg, Kanav Singla |
| 2025 | Interval-Constrained Bipartite Matching over Time. | Andreas Abels, Mariia Anapolska, Christina Bsing |
| 2024 | Online String Attractors - And Their Relation to the Lempel-Ziv Factorization. | Philip Whittington |
| 2024 | Approximate Min-Sum Subset Convolution. | Mihail Stoian |
| 2024 | Small Additive Error for Unsplittable Multicommodity Flow in Outerplanar Graphs. | Richard Shapley, David B. Shmoys |
| 2024 | Improved Approximation Algorithms for Covering Pliable Set Families and Flexible Graph Connectivity. | Zeev Nutov |
| 2024 | Complexity of Fixed Order Routing. | Steven Miltenburg, Tim Oosterwijk, Ren Sitters |
| 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 | Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching. | Stefan Hougardy, Karolina Tammemaa |
| 2024 | Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees. | Svein Hgemo |
| 2024 | Approximating δ-Covering. | Tim A. Hartmann, Tom Janen |