| 2024 | Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths. | Rajesh Chitnis, Samuel Thomas, Anthony Wirth |
| 2024 | Searching in Euclidean Spaces with Predictions. | Sergio Cabello, Panos Giannopoulos |
| 2024 | Approximation Algorithms for k-Scenario Matching. | Danny Blom, Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Bart Smeulders |
| 2024 | Improved Online Scheduling with Restarts on a Single Machine. | Aflatoun Amouzandeh, Rob van Stee |
| 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 |
| 2023 | Approximating Maximum Edge 2-Coloring by Normalizing Graphs. | Tobias Mmke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze |
| 2023 | Approximation Ineffectiveness of a Tour-Untangling Heuristic. | Bodo Manthey, Jesse van Rhijn |
| 2023 | The Power of Amortization on Scheduling with Explorable Uncertainty. | Alison Hsiang-Hsuan Liu, Fu-Hong Liu, Prudence W. H. Wong, Xiao-Ou Zhang |
| 2023 | A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities. | William S. Evans, David G. Kirkpatrick |
| 2023 | Approximating Fair k-Min-Sum-Radii in Euclidean Space. | Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt, Julian Wargalla |
| 2023 | Improved Approximations for Relative Survivable Network Design. | Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov |
| 2023 | Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations. | Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase |
| 2023 | Approximation Schemes Under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes. | Vtor Gomes Chagas, Elisa Dell'Arriva, Flvio Keidi Miyazawa |
| 2023 | Fast Parallel Algorithms for Submodular p-Superseparable Maximization. | Philip Cervenjak, Junhao Gan, Anthony Wirth |
| 2023 | Total Completion Time Scheduling Under Scenarios. | Thomas Bosman, Martijn van Ee, Ekin Ergen, Csand Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie |
| 2023 | Any-Order Online Interval Selection. | Allan Borodin, Christodoulos Karavasilis |
| 2023 | Greedy Minimum-Energy Scheduling. | Gunther Bidlingmaier |
| 2023 | An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem. | Mateusz Basiak, Marcin Bienkowski, Agnieszka Tatarczuk |
| 2023 | Scheduling with Speed Predictions. | Eric Balkanski, Tingting Ou, Clifford Stein, Hao-Ting Wei |
| 2023 | Online Hitting Set of d-Dimensional Fat Objects. | Shanli Alefkhani, Nima Khodaveisi, Mathieu Mari |
| 2023 | Hitting Sets when the Shallow Cell Complexity is Small. | Sander Aarts, David B. Shmoys |
| 2022 | Scheduling Appointments Online: The Power of Deferred Decision-Making. | Devin Smedira, David B. Shmoys |
| 2022 | The Power of Amortized Recourse for Online Graph Problems. | Alison Hsiang-Hsuan Liu, Jonathan Toole-Charignon |
| 2022 | Graph Burning and Non-uniform k-centers for Small Treewidth. | Matej Lieskovsk, Jir Sgall |
| 2022 | Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem. | Lisa Hellerstein, Devorah Kletenik, Naifeng Liu, R. Teal Witter |