In reverse chronological order:
[J]= Journal/Full version of paper, [C]= Conference/Preliminary version
Also on Google Scholar
Online Submodular Welfare Maximization Meets Post-Allocation Stochasticity and Reusability
[J] Major revision in Operations Research
A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice with Shuo Sun and Zuo-Jun (Max) Shen
Almost Tight Bounds for Online Hypergraph Matching with Thorben Tröbst
[J] Operations Research Letters (2024)
Placement Optimization of Substitutable Products with Omar El Housni
[J] Major revision in Management Science
Pricing a Finite Inventory of Substitutable Products with Show-All Constraint with Vineet Goyal and Garud Iyengar
[J] Major revision in Operations Research
When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
[C] SOSA 2024
Cascading Contextual Assortment Bandits with Hyunjun Choi and Min-hwan Oh
[C] NeurIPS 2023
Submodular Order Functions and Assortment Optimization
[J] Management Science (accepted)
[C] ICML 2023
1st place in INFORMS Junior Faculty Interest Group (JFIG) Paper Competition 2021
Adwords with Unknown Budgets and Beyond
[J] Management Science (accepted)
[C] EC 2023
The Non-Markovian Nature of Nested Logit Choice with Selena Li
[J] Operations Research Letters (2023)
Selena received Honorable Mention in the INFORMS Undergraduate Operations Research Prize 2022
Online Bipartite Matching with Reusable Resources with Steven Delong, Alireza Farhadi, Rad Niazadeh and Balasubramanian Sivan
[J] Mathematics of Operations Research (2023)
This paper merges two EC 2022 papers (including my paper below)
Periodic Reranking for Online Matching of Reusable Resources
[C] EC 2022 (video)
Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources with Vineet Goyal and Garud Iyengar
[J] Minor revision in Operations Research
[C] WINE 2021 (video)
This version merges Paper 1 and Paper 2
Online Assortment Optimization with Reusable Resources with Xiao-Yue Gong, Vineet Goyal, Garud Iyengar, David Simchi-Levi and Shuangyu Wang
[J] Management Science (2021)
Featured article (Management Science Review blog)
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path Based Formulation with Vineet Goyal
[J] Operations Research (2022)
[C] EC 2020 (video)
Robust Appointment Scheduling with Heterogeneous Costs with Andreas S. Schulz
[C] APPROX 2019
Multi-Objective Maximization of Monotone Submodular Functions with Cardinality Constraint
[J] INFORMS Journal on Optimization (2021) 3:1, 74-88
[C] NeurIPS 2018 (video)
Robust Monotone Submodular Function Maximization with James B. Orlin and Andreas S. Schulz
[J] Mathematical Programming 172.1-2 (2018): 505-537
[C] IPCO 2016
Finalist in INFORMS George Nicholson Student Paper Competition 2016
Distributed Single Source Reachability with Mohsen Ghaffari
[C] ACM Symposium on Principles of Distributed Computing (PODC) 2015
Call Admission Control for Real-Time Applications in Wireless Networks with Siddhanth Agarwal and Prasanna Chaporkar
[C] International Conference on Computer Communications (INFOCOM) 2013