| Publication | Date of Publication | Type |
|---|
Submodular norms with applications to online facility location and stochastic probing
| 2025-01-14 | Paper |
Bandit algorithms for Prophet Inequality and Pandora's Box
| 2024-11-28 | Paper |
Prophet secretary for combinatorial auctions and matroids
SIAM Journal on Computing | 2024-11-20 | Paper |
Submodular dominance and applications
| 2024-08-22 | 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 |
Smoothed analysis of the Komlós conjecture
| 2024-06-24 | Paper |
Online and bandit algorithms beyond \(\ell_p\) norms
| 2024-05-14 | Paper |
scientific article; zbMATH DE number 7829245 (Why is no real title available?)
| 2024-04-09 | Paper |
scientific article; zbMATH DE number 7788378 (Why is no real title available?)
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788507 (Why is no real title available?)
| 2024-01-15 | Paper |
Bag-Of-Tasks Scheduling on Related Machines
| 2023-11-20 | Paper |
Maximum Matching in the Online Batch-arrival Model
ACM Transactions on Algorithms | 2023-04-26 | Paper |
scientific article; zbMATH DE number 7650116 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650071 (Why is no real title available?)
| 2023-02-03 | Paper |
Robust Algorithms for the Secretary Problem
| 2023-02-03 | Paper |
Non-Clairvoyant Precedence Constrained Scheduling.
| 2022-07-21 | Paper |
Formal barriers to simple algorithms for the matroid secretary problem
| 2022-07-06 | Paper |
Smoothed Analysis of the Koml\'os Conjecture
| 2022-04-25 | Paper |
Random-Order Models
| 2022-02-04 | Paper |
Online Discrepancy with Recourse for Vectors and Graphs
| 2021-11-11 | Paper |
scientific article; zbMATH DE number 7378727 (Why is no real title available?)
| 2021-08-04 | Paper |
Some results on the spum and the integral spum of graphs
Discrete Mathematics | 2021-03-25 | Paper |
Online vector balancing and geometric discrepancy
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
The Markovian price of information
| 2020-02-06 | Paper |
Morphing planar graph drawings with a polynomial number of steps
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Algorithms and adaptivity gaps for stochastic probing
Proceedings of the Twenty-Seventh 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 |
Combinatorial prophet inequalities
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The price of information in combinatorial optimization
| 2018-03-15 | Paper |
Prophet secretary for combinatorial auctions and matroids
| 2018-03-15 | Paper |
Online matroid intersection: beating half for random arrival
| 2017-08-31 | Paper |
Maximum matching in the online batch-arrival model
| 2017-08-31 | Paper |
How to morph planar graph drawings
SIAM Journal on Computing | 2017-05-30 | Paper |
On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy
Mathematical Programming. Series A. Series B | 2016-09-16 | Paper |
On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy
Automata, Languages, and Programming | 2013-08-06 | Paper |
