| Publication | Date of Publication | Type |
|---|
| Maximum unique coverage on streams: improved FPT approximation scheme and tighter space lower bound | 2025-10-06 | Paper |
| Universal optimization for non-clairvoyant subadditive joint replenishment | 2025-10-06 | Paper |
| Online matching with set and concave delays | 2025-01-14 | Paper |
| Nested active-time scheduling | 2024-09-11 | Paper |
| Online weighted cardinality joint replenishment problem with delay | 2024-06-24 | Paper |
| The power of clairvoyance for multi-level aggregation and set cover with delay | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788615 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
The online broadcast range-assignment problem
Algorithmica | 2023-12-13 | Paper |
The Online Broadcast Range-Assignment Problem
(available as arXiv preprint) | 2023-11-14 | Paper |
Tight bounds for online weighted tree augmentation
(available as arXiv preprint) | 2022-07-21 | Paper |
Tight bounds for online weighted tree augmentation
Algorithmica | 2022-03-25 | Paper |
Bounded-degree light approximate shortest-path trees in doubling metrics
Discrete Applied Mathematics | 2021-10-21 | Paper |
Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Timing matters: online dynamics in broadcast games
(available as arXiv preprint) | 2020-06-18 | Paper |
Nested convex bodies are chaseable
Algorithmica | 2020-04-14 | Paper |
Online constrained forest and prize-collecting network design
Algorithmica | 2019-01-11 | Paper |
LP-based robust algorithms for noisy minor-free and bounded treewidth graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
LAST but not least: online spanners for buy-at-bulk
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Nested convex bodies are chaseable | 2018-03-15 | Paper |
Nested convex bodies are chaseable
(available as arXiv preprint) | 2018-03-15 | Paper |
Tight approximation bounds for dominating set on graphs of bounded arboricity
Information Processing Letters | 2017-11-03 | Paper |
Online network design algorithms via hierarchical decompositions
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Network design with coverage costs
(available as arXiv preprint) | 2017-03-22 | Paper |
Secretary problems with convex costs
Automata, Languages, and Programming | 2013-08-12 | Paper |
A bicriteria approximation for the reordering buffer problem
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Threshold rules for online sample selection
Discrete Mathematics, Algorithms and Applications | 2011-03-25 | Paper |
Threshold rules for online sample selection
Lecture Notes in Computer Science | 2010-07-20 | Paper |
