Seuraa
Sayan Bhattacharya
Sayan Bhattacharya
Vahvistettu sähköpostiosoite verkkotunnuksessa warwick.ac.uk - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
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
1162015
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
1142010
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
972018
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
822016
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
672010
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
662017
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
512018
Deterministic dynamic matching in O (1) update time
S Bhattacharya, D Chakrabarty, M Henzinger
Algorithmica 82 (4), 1057-1080, 2020
43*2020
Dynamic algorithms via the primal-dual method
S Bhattacharya, M Henzinger, G Italiano
Information and Computation 261, 219-239, 2018
31*2018
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
272019
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
222014
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
222011
A cops and robber game in multidimensional grids
S Bhattacharya, G Paul, S Sanyal
Discrete Applied Mathematics 158 (16), 1745-1751, 2010
182010
On allocations with negative externalities
S Bhattacharya, J Kulkarni, K Munagala, X Xu
International Workshop on Internet and Network Economics, 25-36, 2011
172011
A new deterministic algorithm for dynamic set cover
S Bhattacharya, M Henzinger, D Nanongkai
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
132019
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
12*2022
Fulfilling queries using specified and unspecified attributes
S Gollapudi, S Bhattacharya
US Patent 9,053,208, 2015
122015
Approximation algorithm for security games with costly resources
S Bhattacharya, V Conitzer, K Munagala
International Workshop on Internet and Network Economics, 13-24, 2011
122011
Coordination mechanisms for selfish routing over time on a tree
S Bhattacharya, J Kulkarni, V Mirrokni
International Colloquium on Automata, Languages, and Programming, 186-197, 2014
112014
New approximability results for the robust k-median problem
S Bhattacharya, P Chalermsook, K Mehlhorn, A Neumann
Scandinavian Workshop on Algorithm Theory, 50-61, 2014
102014
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20