default search action
Dabeen Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i12]Sungwoo Park, Junyeop Kwon, Byeongnoh Kim, Suhyun Chae, Jeeyong Lee, Dabeen Lee:
Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions. CoRR abs/2402.15188 (2024) - [i11]Jaehyun Park, Dabeen Lee:
Reinforcement Learning for Infinite-Horizon Average-Reward MDPs with Multinomial Logistic Function Approximation. CoRR abs/2406.13633 (2024) - [i10]Woojin Chae, Dabeen Lee:
Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation. CoRR abs/2409.10772 (2024) - [i9]Kihyun Yu, Duksang Lee, William Overman, Dabeen Lee:
Improved Regret Bound for Safe Reinforcement Learning via Tighter Cost Pessimism and Reward Optimism. CoRR abs/2410.10158 (2024) - [i8]Woojin Chae, Kihyuk Hong, Yufan Zhang, Ambuj Tewari, Dabeen Lee:
Learning Infinite-Horizon Average-Reward Linear Mixture MDPs of Bounded Span. CoRR abs/2410.14992 (2024) - 2023
- [j15]Dabeen Lee
, Milan Vojnovic, Se-Young Yun:
Test Score Algorithms for Budgeted Stochastic Utility Maximization. INFORMS J. Optim. 5(1): 27-67 (2023) - [j14]Nam Ho-Nguyen
Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty Under Wasserstein Ambiguity. INFORMS J. Optim. 5(2): 211-232 (2023) - [i7]Duksang Lee, Nam Ho-Nguyen, Dabeen Lee:
Projection-Free Online Convex Optimization with Stochastic Constraints. CoRR abs/2305.01333 (2023) - [i6]Duksang Lee, Dabeen Lee:
Online Resource Allocation in Episodic Markov Decision Processes. CoRR abs/2305.10744 (2023) - [i5]Yeongjong Kim, Dabeen Lee:
Stochastic-Constrained Stochastic Optimization with Markovian Data. CoRR abs/2312.04312 (2023) - 2022
- [j13]Ahmad Abdi
Idealness of k-wise intersecting families. Math. Program. 192(1): 29-50 (2022) - [j12]Ahmad Abdi
Correction to: Idealness of k-wise intersecting families. Math. Program. 192(1): 51-55 (2022) - [j11]Sanjeeb Dash, Oktay Günlük, Dabeen Lee
On a generalization of the Chvátal-Gomory closure. Math. Program. 192(1): 149-175 (2022) - [j10]Fatma Kilinç-Karzan, Simge Küçükyavuz, Dabeen Lee
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens. Math. Program. 195(1): 283-326 (2022) - [j9]Nam Ho-Nguyen
Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity. Math. Program. 196(1): 641-672 (2022) - [i4]Duksang Lee, Nam Ho-Nguyen, Dabeen Lee:
Non-smooth and Hölder-smooth Submodular Maximization. CoRR abs/2210.06061 (2022) - 2021
- [j8]Ahmad Abdi
Resistant Sets in the Unit Hypercube. Math. Oper. Res. 46(1): 82-114 (2021) - [j7]Sanjeeb Dash, Oktay Günlük, Dabeen Lee
Generalized Chvátal-Gomory closures for integer programs with bounds on variables. Math. Program. 190(1): 393-425 (2021) - [c6]Dabeen Lee, Milan Vojnovic:
Scheduling jobs with stochastic holding costs. NeurIPS 2021: 19375-19384 - [i3]Dabeen Lee, Milan Vojnovic:
Learning to Schedule. CoRR abs/2105.13655 (2021) - 2020
- [j6]Ahmad Abdi
Intersecting Restrictions in Clutters. Comb. 40(5): 605-623 (2020) - [j5]Ahmad Abdi
Cuboids, a class of clutters. J. Comb. Theory B 142: 144-209 (2020) - [j4]Gérard Cornuéjols, Dabeen Lee
On the Rational Polytopes with Chvátal Rank 1. Math. Program. 179(1): 21-46 (2020) - [c5]Ahmad Abdi
Idealness of k-wise Intersecting Families. IPCO 2020: 1-12 - [c4]Sanjeeb Dash, Oktay Günlük, Dabeen Lee:
On a Generalization of the Chvátal-Gomory Closure. IPCO 2020: 117-129 - [i2]Dabeen Lee, Milan Vojnovic, Se-Young Yun:
Test Score Algorithms for Budgeted Stochastic Utility Maximization. CoRR abs/2012.15194 (2020)
2010 – 2019
- 2019
- [j3]Dabeen Lee
On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0, 1 hypercube. Discret. Optim. 32: 11-18 (2019) - [j2]Ahmad Abdi
Deltas, extended odd holes and their blockers. J. Comb. Theory B 136: 193-203 (2019) - [c3]Dabeen Lee, Seung-Hyun Kim, Hongjun Lee, Chung Choo Chung, Whoi-Yul Kim:
Paved and Unpaved Road Segmentation Using Deep Neural Network. ACPR Workshops 2019: 20-28 - [c2]Ahmad Abdi
Identically Self-blocking Clutters. IPCO 2019: 1-12 - [i1]Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
Idealness of k-wise intersecting families. CoRR abs/1912.00614 (2019) - 2018
- [j1]Gérard Cornuéjols, Dabeen Lee:
On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank. Math. Program. 172(1-2): 467-503 (2018) - 2016
- [c1]Gérard Cornuéjols, Dabeen Lee:
On Some Polytopes Contained in the 0, 1 Hypercube that Have a Small Chvátal Rank. IPCO 2016: 300-311
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: