


default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 166 matches
- 2024
- Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
:
The Power of Adaptivity for Stochastic Submodular Cover. Oper. Res. 72(3): 1156-1176 (2024) - Viswanath Nagarajan
, Lily Wang:
Online Generalized Network Design Under (Dis)Economies of Scale. Math. Oper. Res. 49(1): 107-124 (2024) - Ravishankar Krishnaswamy, Viswanath Nagarajan
, Kirk Pruhs, Clifford Stein:
Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing. SIAM J. Comput. 53(3): 588-623 (2024) - Rayen Tan, Rohan Ghuge, Viswanath Nagarajan:
Informative Path Planning with Limited Adaptivity. AISTATS 2024: 4006-4014 - Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
Semi-Bandit Learning for Monotone Stochastic Optimization. FOCS 2024: 1260-1274 - Blake Harris, Viswanath Nagarajan:
Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover. CoRR abs/2405.14995 (2024) - 2023
- Qi Luo
, Viswanath Nagarajan, Alexander Sundt, Yafeng Yin
, John Vincent, Mehrdad Shahabi:
Efficient Algorithms for Stochastic Ride-Pooling Assignment with Mixed Fleets. Transp. Sci. 57(4): 908-936 (2023) - Yubing Cui, Viswanath Nagarajan:
Minimum Cost Adaptive Submodular Cover. SOSA 2023: 12-27 - Nikhil Bansal, Viswanath Nagarajan:
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. SIAM 2023, ISBN 978-1-61197-755-4 [contents] - Rayen Tan, Rohan Ghuge, Viswanath Nagarajan:
Informative Path Planning with Limited Adaptivity. CoRR abs/2311.12698 (2023) - Su Jia, Fatemeh Navidi, Viswanath Nagarajan, R. Ravi:
Optimal Decision Tree with Noisy Outcomes. CoRR abs/2312.15357 (2023) - Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
Semi-Bandit Learning for Monotone Stochastic Optimization. CoRR abs/2312.15427 (2023) - 2022
- Miao Yu
, Viswanath Nagarajan
, Siqian Shen
:
Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization. INFORMS J. Comput. 34(2): 953-973 (2022) - Rohan Ghuge, Joseph Kwon, Viswanath Nagarajan
, Adetee Sharma:
Constrained Assortment Optimization Under the Paired Combinatorial Logit Model. Oper. Res. 70(2): 786-804 (2022) - Rohan Ghuge, Viswanath Nagarajan
:
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems. Math. Oper. Res. 47(2): 1612-1630 (2022) - Anupam Gupta, Amit Kumar
, Viswanath Nagarajan
, Xiangkun Shen:
Stochastic makespan minimization in structured set systems. Math. Program. 192(1): 597-630 (2022) - Euiwoong Lee
, Viswanath Nagarajan, Lily Wang:
On some variants of Euclidean k-supplier. Oper. Res. Lett. 50(2): 115-121 (2022) - Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
Batched Dueling Bandits. ICML 2022: 89-110 - Rohan Ghuge, Anupam Gupta
, Viswanath Nagarajan:
Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. IPCO 2022: 277-290 - Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem. NeurIPS 2022 - Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
Batched Dueling Bandits. CoRR abs/2202.10660 (2022) - Yubing Cui, Viswanath Nagarajan:
Minimum Cost Adaptive Submodular Cover. CoRR abs/2208.08351 (2022) - Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem. CoRR abs/2209.12108 (2022) - 2021
- Anupam Gupta, Amit Kumar
, Viswanath Nagarajan
, Xiangkun Shen:
Stochastic Load Balancing on Unrelated Machines. Math. Oper. Res. 46(1): 115-133 (2021) - Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan:
The Power of Adaptivity for Stochastic Submodular Cover. ICML 2021: 3702-3712 - Viswanath Nagarajan, Lily Wang:
Online Generalized Network Design Under (Dis)Economies of Scale. SODA 2021: 2819-2829 - Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan:
The Power of Adaptivity for Stochastic Submodular Cover. CoRR abs/2106.16115 (2021) - Qi Luo, Viswanath Nagarajan, Alexander Sundt, Yafeng Yin, John Vincent, Mehrdad Shahabi:
Efficient Algorithms for Stochastic Ridepooling Assignment with Mixed Fleets. CoRR abs/2108.08651 (2021) - Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan:
Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. CoRR abs/2111.05687 (2021) - Euiwoong Lee, Viswanath Nagarajan, Lily Wang:
On Some Variants of Euclidean K-Supplier. CoRR abs/2112.01700 (2021)
skipping 136 more matches
loading more results
failed to load more results, please try again later

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.
retrieved on 2025-02-14 22:59 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint