World's Best Scientists 2026 revealed!
Chaitanya Swamy

Chaitanya Swamy

D-Index & Metrics

Computer Science

D-Index
31
Citations
4815
World Ranking
13554
National Ranking
527

Overview

Chaitanya Swamy is affiliated with the University of Waterloo in Canada and has a research focus spanning multiple areas within computer science and engineering. The scientist's main fields of study include Computer Science and Engineering, contributing 23 and 18 publications respectively.

Their work delves into several subfields including Industrial and Manufacturing Engineering, Computational Theory and Mathematics, Computer Networks and Communications, Automotive Engineering, and Management Science and Operations Research. This diverse subfield involvement reflects a comprehensive approach to complex systems and optimization challenges.

Key research topics that Chaitanya Swamy addresses involve Complexity and Algorithms in Graphs, Optimization and Search Problems, Vehicle Routing Optimization Methods, Transportation and Mobility Innovations, Scheduling and Optimization Algorithms, Transportation Planning and Optimization, and Advanced Bandit Algorithms Research.

Their publication record includes multiple papers appearing in widely recognized venues. These include:

  • Approximate multi-matroid intersection via iterative refinement, 2020, Mathematical Programming
  • Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan, 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime, 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • A constant-factor approximation for directed latency in quasi-polynomial time, 2021, Journal of Computer and System Sciences
  • Special Section on the Fifty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017), 2020, SIAM Journal on Computing

Most frequently, this scientist publishes in the following venues:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Mathematical Programming
  • Journal of Computer and System Sciences
  • SIAM Journal on Computing

Collaborations with other researchers form a notable aspect of their career. Frequent co-authors include Zachary Friggstad (6 papers), Sharat Ibrahimpur (5 papers), Sina Dezfuli (3 papers), Haripriya Pulyassary (3 papers), and Ian Post (2 papers). These co-author relationships suggest ongoing teamwork in related research themes.

Best Publications

  • The effectiveness of lloyd-type methods for the k-means problem

    Rafail Ostrovsky;Yuval Rabani;Leonard J. Schulman;Chaitanya Swamy

  • Truthful and Near-Optimal Mechanism Design via Linear Programming

    Ron Lavi;Chaitanya Swamy

  • Approximation Algorithms for Data Placement Problems

    Ivan Baev;Rajmohan Rajaraman;Chaitanya Swamy

  • Optimal Power-Down Strategies

    John Augustine;Sandy Irani;Chaitanya Swamy

  • Primal–Dual Algorithms for Connected Facility Location Problems

    Chaitanya Swamy;Amit Kumar

  • LP-based approximation algorithms for capacitated facility location

    Retsef Levi;David B. Shmoys;Chaitanya Swamy

  • The effectiveness of stackelberg strategies and tolls for network congestion games

    Chaitanya Swamy

  • An approximation scheme for stochastic linear programming and its application to stochastic integer programs

    David B. Shmoys;Chaitanya Swamy

  • Stochastic optimization is (almost) as easy as deterministic optimization

    D.B. Shmoys;C. Swamy

  • Fault-tolerant facility location

    Chaitanya Swamy;David B. Shmoys

  • Truthful mechanism design for multidimensional scheduling via cycle monotonicity

    Ron Lavi;Chaitanya Swamy

  • Approximation algorithms for 2-stage stochastic optimization problems

    Chaitanya Swamy;David B. Shmoys

  • Network design for information networks

    Ara Hayrapetyan;Chaitanya Swamy;Éva Tardos

  • Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity

    Ron Lavi;Chaitanya Swamy

  • Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization

    Chaitanya Swamy;David B. Shmoys

  • Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply

    M. Cheung;C. Swamy

  • Facility location with Service Installation Costs

    David B. Shmoys;Chaitanya Swamy;Retsef Levi

  • Fault-tolerant facility location: a randomized dependent LP-Rounding algorithm

    Jaroslaw Byrka;Aravind Srinivasan;Chaitanya Swamy

  • Approximation algorithms for prize collecting forest problems with submodular penalty functions

    Yogeshwer Sharma;Chaitanya Swamy;David P. Williamson

  • Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games

    Umang Bhaskar;Yu Cheng;Young Kun Ko;Chaitanya Swamy

  • Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications

    Chaitanya Swamy

Frequent Co-Authors

David B. Shmoys
David B. Shmoys Cornell University
Leonard J. Schulman
Leonard J. Schulman California Institute of Technology
Yuval Rabani
Yuval Rabani Hebrew University of Jerusalem
R. Ravi
R. Ravi Carnegie Mellon University
Aravind Srinivasan
Aravind Srinivasan University of Maryland, College Park
Rafail Ostrovsky
Rafail Ostrovsky University of California, Los Angeles
Michael Langberg
Michael Langberg University at Buffalo, State University of New York
Andrew Tomkins
Andrew Tomkins Google (United States)
David P. Williamson
David P. Williamson Cornell University
Rajmohan Rajaraman
Rajmohan Rajaraman Northeastern University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As technology and science fields continue to evolve, online degree opportunities are making it easier than ever to advance your education and career prospects. For those seeking flexibility and speed, a 1 year computer science degree online can be a fast track into tech careers, allowing motivated students to complete their studies quickly without sacrificing quality.

If your interests extend to the intersection of science and engineering, consider an online environmental engineering degree science and engineering. This path opens doors to impactful roles focused on environmental solutions and sustainability.

For those interested in the practical side of innovation, the cheapest online mechanical engineering degree programs can provide accessible education in designing, building, and analyzing mechanical systems—core skills for a variety of industries.

Science enthusiasts might prefer pursuing a physics degree online, which delivers a rigorous understanding of physical principles through fully remote study options.

No matter your choice, online degrees in these areas offer flexibility, affordability, and diverse career pathways, making advanced education more attainable than ever before.

Best Scientists Citing Chaitanya Swamy

Trending Scientists