


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
Exact matches
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 124 matches
- 2024
- David Alemán Espinosa, Chaitanya Swamy:
Approximation Algorithms for Correlated Knapsack Orienteering. APPROX/RANDOM 2024: 29:1-29:24 - Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy:
Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints. ITCS 2024: 84:1-84:22 - David Alemán Espinosa, Chaitanya Swamy:
Approximation Algorithms for Correlated Knapsack Orienteering. CoRR abs/2408.16566 (2024) - 2022
- Zachary Friggstad
, Chaitanya Swamy
:
A constant-factor approximation for directed latency in quasi-polynomial time. J. Comput. Syst. Sci. 126: 44-58 (2022) - Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy:
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. IPCO 2022: 195-209 - Sharat Ibrahimpur
, Chaitanya Swamy:
A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. SOSA 2022: 247-256 - Amit Chakrabarti
, Chaitanya Swamy
:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference). LIPIcs 245, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-249-5 [contents] - 2021
- Zachary Friggstad, Chaitanya Swamy:
Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime. ICALP 2021: 67:1-67:21 - Sharat Ibrahimpur
, Chaitanya Swamy:
Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan. ICALP 2021: 81:1-81:20 - Sharat Ibrahimpur, Chaitanya Swamy:
A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. CoRR abs/2111.07244 (2021) - Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy:
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. CoRR abs/2111.07414 (2021) - Haripriya Pulyassary, Chaitanya Swamy:
On the Randomized Metric Distortion Conjecture. CoRR abs/2111.08698 (2021) - 2020
- André Linhares, Neil Olver, Chaitanya Swamy
, Rico Zenklusen:
Approximate multi-matroid intersection via iterative refinement. Math. Program. 183(1): 397-418 (2020) - Valentine Kabanets, Sofya Raskhodnikova, Chaitanya Swamy:
Special Section on the Fifty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017). SIAM J. Comput. 49(4) (2020) - Zachary Friggstad, Chaitanya Swamy:
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. ESA 2020: 52:1-52:20 - Sharat Ibrahimpur, Chaitanya Swamy:
Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization. FOCS 2020: 966-977 - Sharat Ibrahimpur
, Chaitanya Swamy:
Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization. CoRR abs/2010.05127 (2020) - 2019
- Umang Bhaskar, Katrina Ligett
, Leonard J. Schulman
, Chaitanya Swamy:
Achieving target equilibria in network routing games without knowing the latency functions. Games Econ. Behav. 118: 533-569 (2019) - Konstantinos Georgiou, Chaitanya Swamy:
Black-box reductions for cost-sharing mechanism design. Games Econ. Behav. 113: 17-37 (2019) - Deeparnab Chakrabarty, Chaitanya Swamy:
Simpler and Better Algorithms for Minimum-Norm Load Balancing. ESA 2019: 27:1-27:12 - André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
Approximate Multi-matroid Intersection via Iterative Refinement. IPCO 2019: 299-312 - Deeparnab Chakrabarty, Chaitanya Swamy:
Approximation algorithms for minimum norm and ordered optimization problems. STOC 2019: 126-137 - André Linhares, Chaitanya Swamy:
Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions. STOC 2019: 768-779 - André Linhares, Chaitanya Swamy:
Approximation Algorithms for Distributionally Robust Stochastic Optimization with Black-Box Distributions. CoRR abs/1904.07381 (2019) - Deeparnab Chakrabarty, Chaitanya Swamy:
Simpler and Better Algorithms for Minimum-Norm Load Balancing. CoRR abs/1905.00044 (2019) - Zachary Friggstad, Chaitanya Swamy:
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. CoRR abs/1912.06198 (2019) - 2018
- André Linhares, Chaitanya Swamy:
Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems. Math. Program. 172(1-2): 17-34 (2018) - Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy:
Approximation Algorithms for Minimum-Load k-Facility Location. ACM Trans. Algorithms 14(2): 16:1-16:29 (2018) - Sara Ahmadian, Umang Bhaskar, Laura Sanità, Chaitanya Swamy:
Algorithms for Inverse Optimization Problems. ESA 2018: 1:1-1:14 - Deeparnab Chakrabarty, Chaitanya Swamy:
Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. ICALP 2018: 29:1-29:14
skipping 94 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 23:05 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