| 2026 | ESA | Query Complexity of Hypergraph Connectivity and Learnability Using CUT Oracles. | Deeparnab Chakrabarty, Hang Liao |
| 2026 | SODA | Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries. | Lorenzo Beretta, Deeparnab Chakrabarty, C. Seshadhri |
| 2025 | STOC | Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning. | Deeparnab Chakrabarty, Xi Chen, Simeon Ristic, C. Seshadhri, Erik Waingarten |
| 2024 | ALT | Learning Spanning Forests Optimally in Weighted Undirected Graphs with CUT queries. | Hang Liao, Deeparnab Chakrabarty |
| 2024 | STACS | Fault-tolerant k-Supplier with Outliers. | Deeparnab Chakrabarty, Luc Ct, Ankita Sarkar |
| 2023 | ALT | A Query Algorithm for Learning a Spanning Forest in Weighted Undirected Graphs. | Deeparnab Chakrabarty, Hang Liao |
| 2023 | FOCS | A d | Hadley Black, Deeparnab Chakrabarty, C. Seshadhri |
| 2023 | STOC | Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an (n√d) Monotonicity Tester. | Hadley Black, Deeparnab Chakrabarty, C. Seshadhri |
| 2022 | ESA | Approximation Algorithms for Continuous Clustering and Facility Location Problems. | Deeparnab Chakrabarty, Maryam Negahbani, Ankita Sarkar |
| 2022 | FOCS | Improved Lower Bounds for Submodular Function Minimization. | Deeparnab Chakrabarty, Andrei Graur, Haotian Jiang, Aaron Sidford |
| 2021 | ESA | Graph Connectivity and Single Element Recovery via Linear and OR Queries. | Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna |
| 2021 | FOCS | A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization. | Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna |
| 2021 | ICALP | Revisiting Priority k-Center: Fairness and Outliers. | Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani |
| 2021 | IPCO | Robust k-Center with Two Types of Radii. | Deeparnab Chakrabarty, Maryam Negahbani |
| 2020 | SODA | Domain Reduction for Monotonicity Testing: A | Hadley Black, Deeparnab Chakrabarty, C. Seshadhri |
| 2020 | SODA | On a Decentralized (Δ+1)-Graph Coloring Algorithm. | Deeparnab Chakrabarty, Paul de Supinski |
| 2019 | ESA | Simpler and Better Algorithms for Minimum-Norm Load Balancing. | Deeparnab Chakrabarty, Chaitanya Swamy |
| 2019 | FOCS | Faster Matroid Intersection. | Deeparnab Chakrabarty, Yin Tat Lee, Aaron Sidford, Sahil Singla, Sam Chiu-wai Wong |
| 2019 | STOC | Approximation algorithms for minimum norm and ordered optimization problems. | Deeparnab Chakrabarty, Chaitanya Swamy |
| 2018 | ICALP | Generalized Center Problems with Outliers. | Deeparnab Chakrabarty, Maryam Negahbani |
| 2018 | ICALP | Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. | Deeparnab Chakrabarty, Chaitanya Swamy |
| 2018 | SODA | Dynamic Algorithms for Graph Coloring. | Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai |
| 2018 | SODA | A | Hadley Black, Deeparnab Chakrabarty, C. Seshadhri |
| 2018 | SODA | Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling. | Deeparnab Chakrabarty, Sanjeev Khanna |
| 2017 | ICALP | Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. | Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri |
| 2017 | IPCO | Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. | Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger |
| 2017 | IPCO | The Heterogeneous Capacitated k-Center Problem. | Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar |
| 2017 | STOC | Subquadratic submodular function minimization. | Deeparnab Chakrabarty, Yin Tat Lee, Aaron Sidford, Sam Chiu-wai Wong |
| 2016 | ICALP | The Non-Uniform k-Center Problem. | Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy |
| 2016 | MOBIHOC | IQ-Hopping: distributed oblivious channel selection for wireless networks. | Apurv Bhartia, Deeparnab Chakrabarty, Krishna Chintalapudi, Lili Qiu, Bozidar Radunovic, Ramachandran Ramjee |
| 2015 | FOCS | Online Buy-at-Bulk Network Design. | Alina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi |
| 2015 | SODA | Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. | Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri |
| 2015 | SODA | On (1, | Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li |
| 2013 | STOC | A o(n) monotonicity tester for boolean functions over the hypercube. | Deeparnab Chakrabarty, C. Seshadhri |
| 2013 | STOC | Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids. | Deeparnab Chakrabarty, C. Seshadhri |
| 2012 | ICALP | Testing Coverage Functions. | Deeparnab Chakrabarty, Zhiyi Huang |
| 2011 | IPCO | Approximability of Capacitated Network Design. | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula |
| 2011 | IPCO | Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. | Deeparnab Chakrabarty, Chaitanya Swamy |
| 2010 | IPCO | On Column-Restricted and Priority Covering Integer Programs. | Deeparnab Chakrabarty, Elyot Grant, Jochen Knemann |
| 2010 | IPCO | Hypergraphic LP Relaxations for Steiner Trees. | Deeparnab Chakrabarty, Jochen Knemann, David Pritchard |
| 2009 | FOCS | On Allocating Goods to Maximize Fairness. | Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna |
| 2009 | ISAAC | Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. | Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy |
| 2008 | FOCS | On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. | Deeparnab Chakrabarty, Gagan Goel |
| 2008 | IPCO | New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. | Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani |
| 2008 | WWW | Budget constrained bidding in keyword auctions and online knapsack problems. | Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose |
| 2006 | ICALP | Design Is as Easy as Optimization. | Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani |