Follow
Sayan Bhattacharya
Title
Cited by
Cited by
Year
Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams
S Bhattacharya, M Henzinger, D Nanongkai, C Tsourakakis
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
1482015
Budget constrained auctions with heterogeneous items
S Bhattacharya, G Goel, S Gollapudi, K Munagala
Proceedings of the forty-second ACM symposium on Theory of computing, 379-388, 2010
1152010
Deterministic fully dynamic data structures for vertex cover and matching
S Bhattacharya, M Henzinger, GF Italiano
SIAM Journal on Computing 47 (3), 859-887, 2018
1132018
New deterministic approximation algorithms for fully dynamic matching
S Bhattacharya, M Henzinger, D Nanongkai
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
1042016
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time
S Bhattacharya, M Henzinger, D Nanongkai
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
812017
Dynamic algorithms for graph coloring
S Bhattacharya, D Chakrabarty, M Henzinger, D Nanongkai
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
702018
Incentive compatible budget elicitation in multi-unit auctions
S Bhattacharya, V Conitzer, K Munagala, L Xia
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
692010
Deterministic dynamic matching in O (1) update time
S Bhattacharya, D Chakrabarty, M Henzinger
Algorithmica 82 (4), 1057-1080, 2020
56*2020
Deterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊2) Amortized Update Time
S Bhattacharya, J Kulkarni
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
452019
Dynamic algorithms via the primal-dual method
S Bhattacharya, M Henzinger, G Italiano
Information and Computation 261, 219-239, 2018
35*2018
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover
S Bhattacharya, M Henzinger, D Nanongkai, X Wu
SIAM Journal on Computing 52 (5), 1132-1192, 2023
28*2023
Deterministic rounding of dynamic fractional matchings
S Bhattacharya, P Kiss
arXiv preprint arXiv:2105.01615, 2021
252021
Coordination mechanisms from (almost) all scheduling policies
S Bhattacharya, S Im, J Kulkarni, K Munagala
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
242014
Consideration set generation in commerce search
S Bhattacharya, S Gollapudi, K Munagala
Proceedings of the 20th international conference on World wide web, 317-326, 2011
242011
Online edge coloring algorithms via the nibble method
S Bhattacharya, F Grandoni, D Wajc
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
192021
On allocations with negative externalities
S Bhattacharya, J Kulkarni, K Munagala, X Xu
Internet and Network Economics: 7th International Workshop, WINE 2011 …, 2011
192011
A cops and robber game in multidimensional grids
S Bhattacharya, G Paul, S Sanyal
Discrete Applied Mathematics 158 (16), 1745-1751, 2010
192010
Fully Dynamic (Δ +1)-Coloring in O(1) Update Time
S Bhattacharya, F Grandoni, J Kulkarni, QC Liu, S Solomon
ACM Transactions on Algorithms (TALG) 18 (2), 1-25, 2022
18*2022
An improved algorithm for incremental cycle detection and topological ordering in sparse graphs
S Bhattacharya, J Kulkarni
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
182020
Dynamic matching with better-than-2 approximation in polylogarithmic update time
S Bhattacharya, P Kiss, T Saranurak, D Wajc
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
152023
The system can't perform the operation now. Try again later.
Articles 1–20