| Publication | Date of Publication | Type |
|---|
Trading prophets
Operations Research | 2026-02-18 | Paper |
Replication and sequencing of unreliable jobs on m parallel machines: new results
Computers & Operations Research | 2025-12-02 | Paper |
| Quickly determining who won an election | 2025-11-04 | Paper |
| Scheduling on a stochastic number of machines | 2025-10-06 | Paper |
| Improved approximation algorithms for the expanding search problem | 2025-01-06 | Paper |
| Threshold testing and semi-online prophet inequalities | 2025-01-06 | Paper |
| Incremental maximization via continuization | 2024-11-14 | Paper |
Simple algorithms for stochastic score classification with small approximation ratios
SIAM Journal on Discrete Mathematics | 2024-07-16 | Paper |
Stochastic Probing with Increasing Precision
SIAM Journal on Discrete Mathematics | 2024-01-10 | Paper |
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Knapsack secretary through boosting
Approximation and Online Algorithms | 2023-07-25 | Paper |
Improved bounds for open online dial-a-ride on the line
Algorithmica | 2023-04-28 | Paper |
Speed-robust scheduling: sand, bricks, and rocks
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
| Optimally Handling Commitment Issues in Online Throughput Maximization | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650088 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Prophet inequalities for independent and identically distributed random variables from an unknown distribution
Mathematics of Operations Research | 2022-06-27 | Paper |
Online search for a hyperplane in high-dimensional Euclidean space
Information Processing Letters | 2022-06-03 | Paper |
| scientific article; zbMATH DE number 7525448 (Why is no real title available?) | 2022-05-11 | Paper |
Tight Bounds for Online TSP on the Line
ACM Transactions on Algorithms | 2022-02-08 | Paper |
Speed-robust scheduling. Sand, bricks, and rocks
(available as arXiv preprint) | 2021-12-21 | Paper |
A stronger impossibility for fully online matching
Operations Research Letters | 2021-12-13 | Paper |
Online multistage subset maximization problems
Algorithmica | 2021-07-26 | Paper |
Online multistage subset maximization problems
Algorithmica | 2021-07-26 | Paper |
A PTAS for Euclidean TSP with hyperplane neighborhoods
ACM Transactions on Algorithms | 2021-05-03 | Paper |
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
SIAM Journal on Discrete Mathematics | 2021-04-28 | Paper |
A general framework for handling commitment in online throughput maximization
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
| \textsc{Superset}: A (super)natural variant of the card game \textsc{Set} | 2020-08-11 | Paper |
A general framework for handling commitment in online throughput maximization
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
A PTAS for Euclidean TSP with hyperplane neighborhoods
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Improved Bounds for Open Online Dial-a-Ride on the Line
(available as arXiv preprint) | 2019-07-03 | Paper |
| The itinerant list update problem | 2019-01-15 | Paper |
An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization
SIAM Journal on Computing | 2018-12-05 | Paper |
Handling critical jobs online: deadline scheduling and convex-body chasing
Operations Research Proceedings | 2018-10-09 | Paper |
Tight bounds for online TSP on the line
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
An \(\mathcal{O}(\log m)\)-competitive algorithm for online machine minimization
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| A tight lower bound for online convex optimization with switching costs | 2018-06-22 | Paper |
| A 2-competitive algorithm for online convex optimization with switching costs | 2017-08-31 | Paper |
Chasing convex bodies and functions
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
