| Robust monotone submodular function maximization JB Orlin, AS Schulz, R Udwani Mathematical Programming 172, 505-537, 2018 | 97 | 2018 |
| Online assortment optimization with reusable resources XY Gong, V Goyal, GN Iyengar, D Simchi-Levi, R Udwani, S Wang Management Science 68 (7), 4772-4785, 2022 | 65 | 2022 |
| Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources V Goyal, G Iyengar, R Udwani Web and Internet Economics - 17th International Conference, WINE 2021, 543, 2021 | 43* | 2021 |
| Online matching with stochastic rewards: Optimal competitive ratio via path based formulation V Goyal, R Udwani Operations Research, 2022 | 35 | 2022 |
| Multi-objective maximization of monotone submodular functions with cardinality constraint R Udwani Informs Journal on Optimization, 2021 | 33 | 2021 |
| Brief announcement: Distributed single-source reachability M Ghaffari, R Udwani Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 16 | 2015 |
| Online allocation of reusable resources via algorithms guided by fluid approximations V Goyal, G Iyengar, R Udwani arXiv preprint arXiv:2010.03983, 2020 | 13 | 2020 |
| Online Bipartite Matching with Reusable Resources S Delong, A Farhadi, R Niazadeh, B Sivan, R Udwani Available at SSRN 4256240, 2022 | 12 | 2022 |
| Submodular order functions and assortment optimization R Udwani International Conference on Machine Learning, 34584-34614, 2023 | 11 | 2023 |
| Adwords with unknown budgets and beyond R Udwani arXiv preprint arXiv:2110.00504, 2021 | 8 | 2021 |
| Periodic Reranking for Online Matching of Reusable Resources R Udwani EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation, 966, 2022 | 4 | 2022 |
| Call admission control for real-time applications in wireless network S Agrawal, P Chaporkar, R Udwani 2013 Proceedings IEEE INFOCOM, 330-334, 2013 | 3 | 2013 |
| Robust Appointment Scheduling with Heterogeneous Costs AS Schulz, R Udwani Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2019 | 2 | 2019 |
| Almost Tight Bounds for Online Hypergraph Matching T Tröbst, R Udwani arXiv preprint arXiv:2402.08775, 2024 | 1 | 2024 |
| Cascading Contextual Assortment Bandits H Choi, R Udwani, M Oh Advances in Neural Information Processing Systems 36, 2024 | 1 | 2024 |
| When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching R Udwani 2024 Symposium on Simplicity in Algorithms (SOSA), 321-330, 2024 | 1 | 2024 |
| The non-Markovian nature of nested logit choice S Li, R Udwani Operations Research Letters 51 (4), 461-467, 2023 | 1 | 2023 |
| Dynamic Pricing for a Large Inventory of Substitutable Goods V Goyal, G Iyengar, R Udwani Available at SSRN 4055722, 2022 | 1 | 2022 |
| A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice S Sun, R Udwani arXiv preprint arXiv:2404.03604, 2024 | | 2024 |
| Online Submodular Welfare Maximization Meets Post-Allocation Stochasticity and Reusability R Udwani arXiv preprint arXiv:2403.18059, 2024 | | 2024 |
