On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank. - Gérard Cornuéjols; Dabeen Lee (Math. Program., 2018)

Paved and Unpaved Road Segmentation Using Deep Neural Network. - Dabeen Lee; Seung-Hyun Kim; Hongjun Lee; Chung Choo Chung; Whoi-Yul Kim (ACPR Workshops, 2019)

Identically Self-blocking Clutters. - Ahmad Abdi; Gérard Cornuéjols; Dabeen Lee (IPCO, 2019)

On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0, 1 hypercube. - Dabeen Lee (Discret. Optim., 2019)

Deltas, extended odd holes and their blockers. - Ahmad Abdi; Dabeen Lee (J. Comb. Theory B, 2019)

Intersecting Restrictions in Clutters. - Ahmad Abdi; Gérard Cornuéjols; Dabeen Lee (Comb., 2020)

Cuboids, a class of clutters. - Ahmad Abdi; Gérard Cornuéjols; Natália Guricanová; Dabeen Lee (J. Comb. Theory B, 2020)

On the Rational Polytopes with Chvátal Rank 1. - Gérard Cornuéjols; Dabeen Lee; Yanjun Li (Math. Program., 2020)

Scheduling jobs with stochastic holding costs. - Dabeen Lee; Milan Vojnovic (NeurIPS, 2021)

Learning to Schedule. - Dabeen Lee; Milan Vojnovic (CoRR, 2021)

Resistant Sets in the Unit Hypercube. - Ahmad Abdi; Gérard Cornuéjols; Dabeen Lee (Math. Oper. Res., 2021)

Generalized Chvátal-Gomory closures for integer programs with bounds on variables. - Sanjeeb Dash; Oktay Günlük; Dabeen Lee (Math. Program., 2021)

Non-smooth and Hölder-smooth Submodular Maximization. - Duksang Lee; Nam Ho-Nguyen; Dabeen Lee (CoRR, 2022)

Idealness of k-wise intersecting families. - Ahmad Abdi; Gérard Cornuéjols; Tony Huynh; Dabeen Lee (Math. Program., 2022)

Correction to: Idealness of k-wise intersecting families. - Ahmad Abdi; Gérard Cornuéjols; Tony Huynh; Dabeen Lee (Math. Program., 2022)

On a generalization of the Chvátal-Gomory closure. - Sanjeeb Dash; Oktay Günlük; Dabeen Lee (Math. Program., 2022)

Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity. - Nam Ho-Nguyen; Fatma Kilinç-Karzan; Simge Küçükyavuz; Dabeen Lee (Math. Program., 2022)

Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens. - Fatma Kilinç-Karzan; Simge Küçükyavuz; Dabeen Lee (Math. Program., 2022)

Projection-Free Online Convex Optimization with Stochastic Constraints. - Duksang Lee; Nam Ho-Nguyen; Dabeen Lee (CoRR, 2023)

Online Resource Allocation in Episodic Markov Decision Processes. - Duksang Lee; Dabeen Lee (CoRR, 2023)

Stochastic-Constrained Stochastic Optimization with Markovian Data. - Yeongjong Kim; Dabeen Lee (CoRR, 2023)

Test Score Algorithms for Budgeted Stochastic Utility Maximization. - Dabeen Lee; Milan Vojnovic; Se-Young Yun (INFORMS J. Optim., 2023)

Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty Under Wasserstein Ambiguity. - Nam Ho-Nguyen; Fatma Kilinç-Karzan; Simge Küçükyavuz; Dabeen Lee (INFORMS J. Optim., 2023)

Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions. - Sungwoo Park; Junyeop Kwon; Byeongnoh Kim; Suhyun Chae; Jeeyong Lee; Dabeen Lee (CoRR, 2024)

Reinforcement Learning for Infinite-Horizon Average-Reward MDPs with Multinomial Logistic Function Approximation. - Jaehyun Park; Dabeen Lee (CoRR, 2024)

Improved Regret Bound for Safe Reinforcement Learning via Tighter Cost Pessimism and Reward Optimism. - Kihyun Yu; Duksang Lee; William Overman; Dabeen Lee (CoRR, 2024)

Learning Infinite-Horizon Average-Reward Linear Mixture MDPs of Bounded Span. - Woojin Chae; Kihyuk Hong; Yufan Zhang; Ambuj Tewari; Dabeen Lee (AISTATS, 2025)

Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPs. - Kihyuk Hong; Woojin Chae; Yufan Zhang; Dabeen Lee; Ambuj Tewari (AISTATS, 2025)

Infinite-Horizon Reinforcement Learning with Multinomial Logit Function Approximation. - Jaehyun Park; Junyeop Kwon; Dabeen Lee (AISTATS, 2025)

Technical Note - Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications. - Fatma Kilinç-Karzan; Simge Küçükyavuz; Dabeen Lee; Soroosh Shafieezadeh-Abadeh (Oper. Res., 2025)

Neural Logistic Bandits. - Seoungbin Bae; Dabeen Lee (CoRR, 2025)

An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints. - Jiahui Zhu; Kihyun Yu; Dabeen Lee; Xin Liu; Honghao Wei (CoRR, 2025)

From coordinate subspaces over finite fields to ideal multipartite uniform clutters. - Ahmad Abdi; Dabeen Lee (Math. Program., 2025)

A projection-free method for solving convex bilevel optimization problems. - Khanh-Hung Giang-Tran; Nam Ho-Nguyen; Dabeen Lee (Math. Program., 2025)