default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGrani Adiwena Hanasusanto
Person information
- affiliation: University of Texas at Austin, TX, USA
- affiliation (Ph.D): Imperial College London, Department of Computing
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j17]Wouter van Eekelen, Grani A. Hanasusanto, John J. Hasenbein, Johan S. H. van Leeuwaarden:
Second-order bounds for the M/M/s queue with random arrival rate. Queueing Syst. Theory Appl. 109(1): 3 (2025)- 2024
- [j16]Apurva Patil
, Grani A. Hanasusanto, Takashi Tanaka:
Discrete-Time Stochastic LQR via Path Integral Control and Its Sample Complexity Analysis. IEEE Control. Syst. Lett. 8: 1595-1600 (2024) - [j15]Xiangyi Fan, Grani A. Hanasusanto:
A Decision Rule Approach for Two-Stage Data-Driven Distributionally Robust Optimization Problems with Random Recourse. INFORMS J. Comput. 36(2): 526-542 (2024) - [j14]Yijie Wang, Viet Anh Nguyen, Grani A. Hanasusanto:
Wasserstein Robust Classification with Fairness Constraints. Manuf. Serv. Oper. Manag. 26(4): 1567-1585 (2024) - [c6]Zhuangzhuang Jia, Grani A. Hanasusanto, Phebe Vayanos, Weijun Xie:
Learning Fair Policies for Multi-Stage Selection Problems from Observational Data. AAAI 2024: 21188-21196 - [c5]Hyuk Park, Duo Zhou, Grani A. Hanasusanto, Takashi Tanaka:
Distributionally Robust Path Integral Control. ACC 2024: 1164-1171 - 2023
- [j13]Prateek R. Srivastava, Purnamrita Sarkar, Grani A. Hanasusanto:
A Robust Spectral Clustering Algorithm for Sub-Gaussian Mixture Models with Outliers. Oper. Res. 71(1): 224-244 (2023) - [i4]Hyuk Park, Duo Zhou, Grani A. Hanasusanto, Takashi Tanaka:
Distributionally Robust Path Integral Control. CoRR abs/2310.01633 (2023) - [i3]Zhuangzhuang Jia, Grani A. Hanasusanto, Phebe Vayanos, Weijun Xie:
Learning Fair Policies for Multi-stage Selection Problems from Observational Data. CoRR abs/2312.13173 (2023) - 2022
- [j12]Areesh Mittal, Grani A. Hanasusanto:
Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming. Oper. Res. 70(5): 2867-2882 (2022) - 2021
- [i2]Yijie Wang, Viet Anh Nguyen, Grani A. Hanasusanto:
Wasserstein Robust Support Vector Machines with Fairness Constraints. CoRR abs/2103.06828 (2021) - 2020
- [j11]Areesh Mittal, Can Gokalp, Grani A. Hanasusanto:
Robust Quadratic Programming with Mixed-Integer Uncertainty. INFORMS J. Comput. 32(2): 201-218 (2020) - [j10]Nan Zhang, Benjamin D. Leibowicz, Grani A. Hanasusanto:
Optimal Residential Battery Storage Operations Using Robust Data-Driven Dynamic Programming. IEEE Trans. Smart Grid 11(2): 1771-1780 (2020)
2010 – 2019
- 2019
- [i1]Prateek R. Srivastava, Purnamrita Sarkar, Grani A. Hanasusanto:
A Robust Spectral Clustering Algorithm for Sub-Gaussian Mixture Models with Outliers. CoRR abs/1912.07546 (2019) - 2018
- [j9]Grani Adiwena Hanasusanto, Daniel Kuhn:
Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls. Oper. Res. 66(3): 849-869 (2018) - [j8]Peyman Mohajerin Esfahani, Soroosh Shafieezadeh-Abadeh, Grani Adiwena Hanasusanto, Daniel Kuhn:
Data-driven inverse optimization with imperfect information. Math. Program. 167(1): 191-234 (2018) - [j7]Madhushini Narayana Prasad, Grani Adiwena Hanasusanto:
Improved Conic Reformulations for K-means Clustering. SIAM J. Optim. 28(4): 3105-3126 (2018) - 2017
- [j6]Grani Adiwena Hanasusanto, Vladimir Roitch, Daniel Kuhn, Wolfram Wiesemann:
Ambiguous Joint Chance Constraints Under Mean and Dispersion Information. Oper. Res. 65(3): 751-767 (2017) - 2016
- [j5]Grani Adiwena Hanasusanto, Daniel Kuhn, Wolfram Wiesemann:
A comment on "computational complexity of stochastic programming problems". Math. Program. 159(1-2): 557-569 (2016) - [j4]Grani Adiwena Hanasusanto, Daniel Kuhn, Wolfram Wiesemann:
K-adaptability in two-stage distributionally robust binary programming. Oper. Res. Lett. 44(1): 6-11 (2016) - 2015
- [b1]Grani Adiwena Hanasusanto:
Decision making under uncertainty: robust and data-driven approaches. Imperial College London, UK, 2015 - [j3]Grani Adiwena Hanasusanto, Daniel Kuhn, Wolfram Wiesemann:
K-Adaptability in Two-Stage Robust Binary Programming. Oper. Res. 63(4): 877-891 (2015) - [j2]Grani Adiwena Hanasusanto, Vladimir Roitch, Daniel Kuhn, Wolfram Wiesemann:
A distributionally robust perspective on uncertainty quantification and chance constrained programming. Math. Program. 151(1): 35-62 (2015) - [j1]Grani Adiwena Hanasusanto, Daniel Kuhn, Stein W. Wallace, Steve Zymler:
Distributionally robust multi-item newsvendor problems with multimodal demand distributions. Math. Program. 152(1-2): 1-32 (2015) - 2013
- [c4]Grani Adiwena Hanasusanto, Daniel Kuhn:
Robust Data-Driven Dynamic Programming. NIPS 2013: 827-835 - 2012
- [c3]Christos Gavriel, Grani Adiwena Hanasusanto, Daniel Kuhn:
Risk-averse shortest path problems. CDC 2012: 2533-2538 - 2010
- [c2]Grani Adiwena Hanasusanto, Zheng Wu, Michael S. Brown:
Ink-bleed reduction using functional minimization. CVPR 2010: 825-832
2000 – 2009
- 2006
- [c1]Pak Kwong Chan, Grani Adiwena Hanasusanto, Hendrata B. Tan, Vincent Keng Sian Ong:
A Micropower CMOS Amplifier for Portable Surface EMG Recording. APCCAS 2006: 490-493
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 2025-01-09 13:03 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:
