No. Title Author Year
1 Improved Approximation Algorithms for the Expanding Search Problem Griesbach, Svenja M. et al. 2023
2 Incremental Maximization via Continuization Disser, Yann et al. 2023
3 Threshold Testing and Semi-Online Prophet Inequalities Hoefer, Martin et al. 2023
4 Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract) Correa, José et al. 2021
5 Optimally Handling Commitment Issues in Online Throughput Maximization Eberle, Franziska et al. 2020
6 Improved Bounds for Open Online Dial-a-Ride on the Line Birx, Alexander et al. 2019
7 Online Multistage Subset Maximization Problems Bampis, Evripidis et al. 2019
8 SUPERSET: A (Super)Natural Variant of the Card Game SET Botler, Fábio et al. 2018
9 A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs Bansal, Nikhil et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 9

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI