Chaitanya Swamy
Orcid: 0000-0003-1108-7941
According to our database1,
Chaitanya Swamy
authored at least 78 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
Proceedings of the Approximation, 2024
2022
J. Comput. Syst. Sci., 2022
A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022
2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
2020
Special Section on the Fifty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017).
SIAM J. Comput., 2020
Math. Program., 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
Achieving target equilibria in network routing games without knowing the latency functions.
Games Econ. Behav., 2019
Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
2018
ACM Trans. Algorithms, 2018
Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems.
Math. Program., 2018
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018
Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
Proceedings of the Integer Programming and Combinatorial Optimization, 2017
Proceedings of the Integer Programming and Combinatorial Optimization, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the Approximation, 2017
2016
Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications.
ACM Trans. Algorithms, 2016
Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems.
Math. Oper. Res., 2016
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players.
ACM Trans. Economics and Comput., 2015
CoRR, 2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract).
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Improved Region-Growing and Combinatorial Algorithms for <i>k</i>-Route Cut Problems (Extended Abstract).
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
2014
Linear-Programming based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems.
CoRR, 2014
CoRR, 2014
Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing.
Proceedings of the Symposium on Theory of Computing, 2014
Proceedings of the Innovations in Theoretical Computer Science, 2014
Proceedings of the Innovations in Theoretical Computer Science, 2014
Proceedings of the Approximation, 2014
2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
2012
ACM Trans. Algorithms, 2012
SIAM J. Comput., 2012
Math. Program., 2012
Algorithmica, 2012
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012
2011
Risk-Averse Stochastic Optimization: Probabilistically-Constrained Models and Algorithms for Black-Box Distributions.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
2010
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
2009
Games Econ. Behav., 2009
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2008
Algorithms for Probabilistically-Constrained Models of Risk-Averse Stochastic Optimization with Black-Box Distributions
CoRR, 2008
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
2007
Approximation algorithms for prize collecting forest problems with submodular penalty functions.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007
Proceedings of the Probabilistic Methods in the Design and Analysis of Algorithms, 23.09., 2007
2006
SIGACT News, 2006
An approximation scheme for stochastic linear programming and its application to stochastic integer programs.
J. ACM, 2006
Proceedings of the Approximation, 2006
2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005
2004
Approximation Algorithms for Clustering Problems.
PhD thesis, 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
1999
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999