Sayan Bhattacharya

Citirano

	Sve	Od 2020.
Citati	1496	937
H-indeks	20	17
i10-indeks	35	28

280

140

210

200920102011201220132014201520162017201820192020202120222023202420255 10 21 29 36 27 64 38 86 112 124 134 121 130 199 265 86

Javni pristup

Prikaži sve

25 članaka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Potvrđena adresa e-pošte na ist.ac.at
Danupon NanongkaiDirector, Max Planck Institute for InformaticsPotvrđena adresa e-pošte na mpi-inf.mpg.de
Janardhan KulkarniMicrosoft Research, RedmondPotvrđena adresa e-pošte na cs.washington.edu
Kamesh MunagalaProfessor of Computer Science, Duke UniversityPotvrđena adresa e-pošte na cs.duke.edu
Thatchaphol SaranurakUniversity of MichiganPotvrđena adresa e-pošte na umich.edu
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, ItalyPotvrđena adresa e-pošte na luiss.it
Deeparnab ChakrabartyDartmouth CollegePotvrđena adresa e-pošte na dartmouth.edu
Vincent ConitzerProfessor of CS, Carnegie Mellon University; Professor of CS and Philosophy, University of OxfordPotvrđena adresa e-pošte na cs.cmu.edu
Sreenivas GollapudiGooglePotvrđena adresa e-pošte na google.com
Gagan GoelResearch Scientist, GooglePotvrđena adresa e-pošte na google.com
Charalampos E. TsourakakisBoston UniversityPotvrđena adresa e-pošte na bu.edu
Lirong XiaProfessor of Computer Science, Rutgers University - New Brunswick; Deputy Director of DIMACSPotvrđena adresa e-pošte na rutgers.edu
Tim RoughgardenColumbia UniversityPotvrđena adresa e-pošte na cs.columbia.edu
Stefano LeonardiProfessor of Computer Science, Sapienza University of RomePotvrđena adresa e-pošte na dis.uniroma1.it
Elias KoutsoupiasUniversity of OxfordPotvrđena adresa e-pošte na cs.ox.ac.uk
Sungjin ImUniversity of California, MercedPotvrđena adresa e-pošte na ucmerced.edu
Goutam PaulAssociate Professor, Cryptology & Security Research Unit (CSRU), Indian Statistical InstitutePotvrđena adresa e-pošte na ieee.org
Martin HoeferProfessor of Computer Science, RWTH Aachen UniversityPotvrđena adresa e-pošte na cs.rwth-aachen.de
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusPotvrđena adresa e-pošte na mpi-inf.mpg.de
Parinya ChalermsookThe University of SheffieldPotvrđena adresa e-pošte na sheffield.ac.uk

Prati

Sayan Bhattacharya

University of Warwick

Potvrđena adresa e-pošte na warwick.ac.uk - Početna stranica

Graph Algorithms Dynamic Data Structures Algorithmic Game Theory


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
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	171	2015
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	126	2018
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	122	2010
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	113	2016
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	94	2018
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log³ n) Worst Case Update Time S Bhattacharya, M Henzinger, D Nanongkai Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	90	2017
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	72	2010
Deterministic dynamic matching in O (1) update time S Bhattacharya, D Chakrabarty, M Henzinger Algorithmica 82 (4), 1057-1080, 2020	65*	2020
Deterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊²) Amortized Update Time S Bhattacharya, J Kulkarni Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	48	2019
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	41	2021
Dynamic algorithms via the primal-dual method S Bhattacharya, M Henzinger, G Italiano Information and Computation 261, 219-239, 2018	41*	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	35*	2023
Dynamic matching with better-than-2 approximation in polylogarithmic update time S Bhattacharya, P Kiss, T Saranurak, D Wajc Journal of the ACM 71 (5), 1-32, 2024	31	2024
Deterministic rounding of dynamic fractional matchings S Bhattacharya, P Kiss arXiv preprint arXiv:2105.01615, 2021	31	2021
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	30	2014
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	27*	2022
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	25	2011
Dynamic (1+ ϵ)-approximate matching size in truly sublinear update time S Bhattacharya, P Kiss, T Saranurak 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023	24	2023
A cops and robber game in multidimensional grids S Bhattacharya, G Paul, S Sanyal Discrete Applied Mathematics 158 (16), 1745-1751, 2010	23	2010
Dynamic algorithms for packing-covering lps via multiplicative weight updates S Bhattacharya, P Kiss, T Saranurak Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023	22	2023

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori