Linked e-resources
Details
Table of Contents
Locating Service and Charging stations
Graph burning and non-uniform $k$-centers for small treewidth
Scheduling with Machine Conflicts
Knapsack Secretary Through Boosting
Scheduling Appointments Online: The Power of Deferred Decision-Making
Canadian Traveller Problem with Predictions
The Power of Amortized Recourse for Online Graph Problems- An Improved Algorithm for Open Online Dial-a-Ride
Stochastic graph exploration with limited resources
Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem
On Streaming Algorithms for Geometric Independent Set and Clique
Approximating Length-Restricted Means under Dynamic Time Warping.
Graph burning and non-uniform $k$-centers for small treewidth
Scheduling with Machine Conflicts
Knapsack Secretary Through Boosting
Scheduling Appointments Online: The Power of Deferred Decision-Making
Canadian Traveller Problem with Predictions
The Power of Amortized Recourse for Online Graph Problems- An Improved Algorithm for Open Online Dial-a-Ride
Stochastic graph exploration with limited resources
Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem
On Streaming Algorithms for Geometric Independent Set and Clique
Approximating Length-Restricted Means under Dynamic Time Warping.