| 2025 | SODA | Constraint Satisfaction Problems with Advice. | Suprovat Ghoshal, Konstantin Makarychev, Yury Makarychev |
| 2024 | SODA | A PTAS for | Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang |
| 2024 | SODA | New Approximation Bounds for Small-Set Vertex Expansion. | Suprovat Ghoshal, Anand Louis |
| 2023 | FOCS | On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs. | Suprovat Ghoshal, Euiwoong Lee |
| 2022 | AISTATS | Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits. | Aadirupa Saha, Suprovat Ghoshal |
| 2022 | STOC | A characterization of approximability for biased CSPs. | Euiwoong Lee, Suprovat Ghoshal |
| 2021 | SODA | Approximation Algorithms and Hardness for Strong Unique Games. | Suprovat Ghoshal, Anand Louis |
| 2021 | STOC | Hardness of learning DNFs using halfspaces. | Suprovat Ghoshal, Rishi Saket |
| 2020 | IPCO | Tight Approximation Bounds for Maximum Multi-coverage. | Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Grpinar |
| 2018 | COLT | Hardness of Learning Noisy Halfspaces using Polynomial Thresholds. | Arnab Bhattacharyya, Suprovat Ghoshal, Rishi Saket |
| 2018 | ICALP | Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH. | Arnab Bhattacharyya, Suprovat Ghoshal, Karthik C. S., Pasin Manurangsi |
| 2018 | ICML | Testing Sparsity over Known and Unknown Bases. | Siddharth Barman, Arnab Bhattacharyya, Suprovat Ghoshal |
| 2016 | ESA | On the Hardness of Learning Sparse Parities. | Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket |
| 2015 | ICML | Ranking from Stochastic Pairwise Preferences: Recovering Condorcet Winners and Tournament Solution Sets at the Top. | Arun Rajkumar, Suprovat Ghoshal, Lek-Heng Lim, Shivani Agarwal |