default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDViswanath Nagarajan
- > Home > Persons > Viswanath Nagarajan
Publications
- 2024
[j52]Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
:
The Power of Adaptivity for Stochastic Submodular Cover. Oper. Res. 72(3): 1156-1176 (2024)- [c60]Rayen Tan, Rohan Ghuge, Viswanath Nagarajan:
Informative Path Planning with Limited Adaptivity. AISTATS 2024: 4006-4014 - 2023
- [i43]Rayen Tan, Rohan Ghuge, Viswanath Nagarajan:
Informative Path Planning with Limited Adaptivity. CoRR abs/2311.12698 (2023) - [i41]Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
Semi-Bandit Learning for Monotone Stochastic Optimization. CoRR abs/2312.15427 (2023) - 2022
- [j47]Rohan Ghuge, Joseph Kwon, Viswanath Nagarajan, Adetee Sharma:
Constrained Assortment Optimization Under the Paired Combinatorial Logit Model. Oper. Res. 70(2): 786-804 (2022) - [j46]Rohan Ghuge, Viswanath Nagarajan:
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems. Math. Oper. Res. 47(2): 1612-1630 (2022) - [c58]Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
Batched Dueling Bandits. ICML 2022: 89-110 - [c57]Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan:
Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. IPCO 2022: 277-290 - [c56]Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem. NeurIPS 2022 - [i40]Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
Batched Dueling Bandits. CoRR abs/2202.10660 (2022) - [i38]Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem. CoRR abs/2209.12108 (2022) - 2021
- [c55]Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan:
The Power of Adaptivity for Stochastic Submodular Cover. ICML 2021: 3702-3712 - [i37]Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan:
The Power of Adaptivity for Stochastic Submodular Cover. CoRR abs/2106.16115 (2021) - [i35]Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan:
Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. CoRR abs/2111.05687 (2021) - 2020
- [c52]Rohan Ghuge, Viswanath Nagarajan:
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems. SODA 2020: 1039-1048 - 2018
- [i28]Rohan Ghuge, Viswanath Nagarajan:
A Quasi-Polynomial Algorithm for Submodular Tree Orienteering in Directed Graphs. CoRR abs/1812.01768 (2018)
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-07-05 20:14 CEST 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:
