| Publication | Date of Publication | Type |
|---|
| Bayesian probing on graphs | 2026-09-16 | Paper |
| Online algorithm design beyond the worst case (invited talk) | 2026-09-10 | Paper |
| Bounded geometries, fractals, and low-distortion embeddings | 2026-05-29 | Paper |
| An edge in time saves nine: LP rounding approximation algorithms for stochastic network design | 2026-05-29 | Paper |
| Structural iterative rounding for generalized \(k\)-median problems | 2026-05-12 | Paper |
Pairwise-independent contention resolution
Mathematical Programming. Series A. Series B | 2026-05-08 | Paper |
| Traveling with a Pez dispenser (or, routing issues in MPLS) | 2026-05-08 | Paper |
| Sorting and selection with structured costs | 2026-05-08 | Paper |
| Cuts, trees and _1-embeddings of graphs | 2026-05-06 | Paper |
| Online carpooling using expander decompositions | 2026-03-23 | Paper |
Nonadaptive stochastic score classification and explainable half-space evaluation
Operations Research | 2025-11-10 | Paper |
| The average-value allocation problem | 2025-10-06 | Paper |
| The price of explainability for clustering | 2025-08-15 | Paper |
| Random order online set cover is as easy as offline | 2025-08-13 | Paper |
| A hitting set relaxation for k-server and an extension to time-windows | 2025-08-13 | Paper |
| Fully-dynamic submodular cover with bounded recourse | 2025-08-12 | Paper |
| Faster exact and approximate algorithms for k-cut | 2025-08-12 | Paper |
| Online algorithms for covering and packing problems with convex objectives | 2025-08-06 | Paper |
Structural iterative rounding for generalized k-median problems
Mathematical Programming. Series A. Series B | 2025-07-08 | Paper |
Configuration balancing for stochastic requests
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
| Pairwise-independent contention resolution | 2025-02-07 | Paper |
| Efficient algorithms and hardness results for the weighted \(k\)-server problem | 2025-01-14 | Paper |
| Poly-logarithmic competitiveness for the \(k\)-taxi problem | 2024-11-28 | Paper |
| Maintaining matroid intersections online | 2024-11-28 | Paper |
| Set covering with our eyes wide shut | 2024-11-28 | Paper |
| Graph searching with predictions | 2024-09-25 | Paper |
| Algorithms for uncertain environments: going beyond the worst-case (invited talk) | 2024-09-12 | Paper |
Matroid-based TSP rounding for half-integral solutions
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
The power of adaptivity for stochastic submodular cover
Operations Research | 2024-07-29 | Paper |
| Robust secretary and prophet algorithms for packing integer programs | 2024-07-19 | Paper |
| Online discrepancy with recourse for vectors and graphs | 2024-07-19 | Paper |
| An improved local search algorithm for k-median | 2024-07-19 | Paper |
| Minimizing completion times for stochastic jobs via batched free times | 2024-05-14 | Paper |
| A local search-based approach for set covering | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7788345 (Why is no real title available?) | 2024-01-15 | Paper |
Bag-Of-Tasks Scheduling on Related Machines
(available as arXiv preprint) | 2023-11-20 | Paper |
A quasipolynomial (2 + <i>ε</i> )-approximation for planar sparsest cut
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Corrigendum: Metric Embedding via Shortest Path Decompositions
SIAM Journal on Computing | 2023-11-14 | Paper |
Chasing convex bodies with linear competitive ratio (invited paper)
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Configuration balancing for stochastic requests
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Lipschitz selectors may not yield competitive algorithms for convex body chasing
Discrete & Computational Geometry | 2023-10-12 | Paper |
Robust Algorithms for the Secretary Problem
(available as arXiv preprint) | 2023-02-03 | Paper |
Chasing Convex Bodies with Linear Competitive Ratio
Journal of the ACM | 2022-12-08 | Paper |
Stochastic makespan minimization in structured set systems (extended abstract)
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Non-adaptive stochastic score classification and explainable halfspace evaluation
(available as arXiv preprint) | 2022-08-16 | Paper |
Matroid-based TSP rounding for half-integral solutions
(available as arXiv preprint) | 2022-08-16 | Paper |
Caching with time windows and delays
SIAM Journal on Computing | 2022-07-22 | Paper |
scientific article; zbMATH DE number 7561535 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Non-Clairvoyant Precedence Constrained Scheduling.
(available as arXiv preprint) | 2022-07-21 | Paper |
Stochastic online metric matching
(available as arXiv preprint) | 2022-07-21 | Paper |
Metric Embedding via Shortest Path Decompositions
SIAM Journal on Computing | 2022-04-20 | Paper |
Optimal Bounds for the <i>k</i> -cut Problem
Journal of the ACM | 2022-03-31 | Paper |
Stochastic makespan minimization in structured set systems
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Random-Order Models
(available as arXiv preprint) | 2022-02-04 | Paper |
| Random-Order Models | 2022-02-04 | Paper |
| Online Discrepancy with Recourse for Vectors and Graphs | 2021-11-11 | Paper |
| Fully-dynamic bin packing with little repacking | 2021-07-28 | Paper |
Non-preemptive flow-time minimization via rejections
(available as arXiv preprint) | 2021-07-28 | Paper |
Maximizing profit with convex costs in the random-order model
(available as arXiv preprint) | 2021-07-28 | Paper |
A local-search algorithm for Steiner forest
(available as arXiv preprint) | 2021-06-15 | Paper |
Stochastic load balancing on unrelated machines
Mathematics of Operations Research | 2021-06-03 | Paper |
Chasing Convex Bodies with Linear Competitive Ratio
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
The Karger-Stein algorithm is optimal for k-cut
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Caching with time windows
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
The Markovian price of information
(available as arXiv preprint) | 2020-02-06 | Paper |
The number of minimum k-cuts: improving the Karger-Stein bound
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Potential-function proofs for gradient methods
Theory of Computing | 2019-12-05 | Paper |
\(k\)-servers with a smile: online algorithms via projections
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A Nearly-Linear Bound for Chasing Nested Convex Bodies
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Elastic Caching
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Losing Treewidth by Separating Subsets
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
SIAM Journal on Computing | 2019-09-02 | Paper |
Metric embedding via shortest path decompositions
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Towards \((1 + \varepsilon)\)-approximate flow sparsifiers
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Online Steiner tree with deletions
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Maintaining assignments online: matching, scheduling, and flows
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Minimum \(d\)-dimensional arrangement with fixed points
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| Scheduling heterogeneous processors isn't as easy as you think | 2019-05-10 | Paper |
| scientific article; zbMATH DE number 7053373 (Why is no real title available?) | 2019-05-10 | Paper |
| Approximate clustering without the approximation | 2019-05-06 | Paper |
| Secretary problems: weights and discounts | 2019-05-06 | Paper |
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
SIAM Journal on Discrete Mathematics | 2019-03-12 | Paper |
On hierarchical routing in doubling metrics
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Algorithms for hub label optimization
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On the approximability of some network design problems
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Algorithms and adaptivity gaps for stochastic probing
Proceedings of the Twenty-Seventh 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 |
Adaptivity gaps for stochastic probing: submodular and XOS functions
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the Lovász Theta Function for Independent Sets in Sparse Graphs
SIAM Journal on Computing | 2018-07-04 | Paper |
Stochastic load balancing on unrelated machines
(available as arXiv preprint) | 2018-03-15 | Paper |
| Stochastic load balancing on unrelated machines | 2018-03-15 | Paper |
An FPT algorithm beating 2-approximation for \(k\)-cut
(available as arXiv preprint) | 2018-03-15 | Paper |
| An FPT algorithm beating 2-approximation for \(k\)-cut | 2018-03-15 | Paper |
| Approximation Algorithms for Aversion k-Clustering via Local k-Median | 2017-12-19 | Paper |
Approximation algorithms for optimal decision trees and adaptive TSP problems
Mathematics of Operations Research | 2017-09-22 | Paper |
| A 2-competitive algorithm for online convex optimization with switching costs | 2017-08-31 | Paper |
Simultaneous Optimization of Sensor Placements and Balanced Schedules
IEEE Transactions on Automatic Control | 2017-08-25 | Paper |
Online and dynamic algorithms for set cover
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Catch them if you can
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
How the experts algorithm can help solve LPs online
Mathematics of Operations Research | 2016-11-16 | Paper |
Embedding tree metrics into low dimensional Euclidean spaces
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
