| 2026 | SODA | Vizing's Theorem in Deterministic Almost-Linear Time. | Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martn Costa, Shay Solomon, Tianyi Zhang |
| 2026 | SODA | Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems. | Aaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss, Thatchaphol Saranurak |
| 2026 | STOC | Fully Dynamic Set Cover: Worst-Case Recourse and Update Time. | Sayan Bhattacharya, Ruoxu Cen, Debmalya Panigrahi |
| 2026 | STOC | Additive One Approximation for Minimum Degree Spanning Tree: Breaking the O(mn) Time Barrier. | Sayan Bhattacharya, Ermiya Farokhnejad, Haoze Wang |
| 2025 | ICML | Almost Optimal Fully Dynamic k-Center Clustering with Recourse. | Sayan Bhattacharya, Martn Costa, Ermiya Farokhnejad, Silvio Lattanzi, Nikos Parotsidis |
| 2025 | SODA | Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains. | Sayan Bhattacharya, Martn Costa, Shay Solomon, Tianyi Zhang |
| 2025 | STOC | Vizing's Theorem in Near-Linear Time. | Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martn Costa, Shay Solomon, Tianyi Zhang |
| 2025 | STOC | Deterministic Dynamic Maximal Matching in Sublinear Update Time. | Aaron Bernstein, Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
| 2025 | STOC | Fully Dynamic k-Median with Near-Optimal Update Time and Recourse. | Sayan Bhattacharya, Martn Costa, Ermiya Farokhnejad |
| 2024 | ESA | Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring. | Sayan Bhattacharya, Martn Costa, Nadav Panski, Shay Solomon |
| 2024 | FOCS | Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier. | Sayan Bhattacharya, Din Carmon, Martn Costa, Shay Solomon, Tianyi Zhang |
| 2024 | FOCS | Fully Dynamic k-Clustering with Fast Update Time and Small Recourse. | Sayan Bhattacharya, Martn Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis |
| 2024 | ICML | Dynamic Facility Location in High Dimensional Euclidean Spaces. | Sayan Bhattacharya, Gramoz Goranci, Shaofeng H.-C. Jiang, Yi Qian, Yubo Zhang |
| 2024 | SODA | Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time. | Sayan Bhattacharya, Martn Costa, Nadav Panski, Shay Solomon |
| 2024 | STOC | Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. | Sayan Bhattacharya, Peter Kiss, Aaron Sidford, David Wajc |
| 2023 | FOCS | Chasing Positive Bodies. | Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak |
| 2023 | FOCS | Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time. | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
| 2023 | SODA | Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
| 2023 | SODA | Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc |
| 2023 | STOC | Sublinear Algorithms for (1.5+ε)-Approximate Matching. | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
| 2022 | ESA | Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. | Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert |
| 2022 | WWW | A New Dynamic Algorithm for Densest Subhypergraphs. | Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh |
| 2021 | ICALP | Deterministic Rounding of Dynamic Fractional Matchings. | Sayan Bhattacharya, Peter Kiss |
| 2021 | SODA | Online Edge Coloring Algorithms via the Nibble Method. | Sayan Bhattacharya, Fabrizio Grandoni, David Wajc |
| 2021 | SODA | Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu |
| 2020 | SODA | An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs. | Sayan Bhattacharya, Janardhan Kulkarni |
| 2020 | SODA | Coarse-Grained Complexity for Dynamic Algorithms. | Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak |
| 2019 | FOCS | A New Deterministic Algorithm for Dynamic Set Cover. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai |
| 2019 | SODA | Deterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊2) Amortized Update Time. | Sayan Bhattacharya, Janardhan Kulkarni |
| 2018 | SODA | Dynamic Algorithms for Graph Coloring. | Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai |
| 2017 | ESA | Improved Algorithm for Dynamic b-Matching. | Sayan Bhattacharya, Manoj Gupta, Divyarthi Mohan |
| 2017 | IPCO | Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. | Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger |
| 2017 | SODA | Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai |
| 2016 | STOC | New deterministic approximation algorithms for fully dynamic matching. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai |
| 2015 | ICALP | Maintaining Near-Popular Matchings. | Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, Lisa Wagner |
| 2015 | ICALP | Design of Dynamic Algorithms via Primal-Dual Method. | Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano |
| 2015 | SODA | Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. | Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano |
| 2015 | STOC | Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis |
| 2015 | STACS | Welfare Maximization with Friends-of-Friends Network Externalities. | Sayan Bhattacharya, Wolfgang Dvork, Monika Henzinger, Martin Starnberger |
| 2014 | ICALP | Coordination Mechanisms for Selfish Routing over Time on a Tree. | Sayan Bhattacharya, Janardhan Kulkarni, Vahab S. Mirrokni |
| 2011 | WWW | Consideration set generation in commerce search. | Sayan Bhattacharya, Sreenivas Gollapudi, Kamesh Munagala |
| 2010 | SODA | Incentive Compatible Budget Elicitation in Multi-unit Auctions. | Sayan Bhattacharya, Vincent Conitzer, Kamesh Munagala, Lirong Xia |
| 2010 | STOC | Budget constrained auctions with heterogeneous items. | Sayan Bhattacharya, Gagan Goel, Sreenivas Gollapudi, Kamesh Munagala |