default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSayan Bhattacharya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j11]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc:
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. J. ACM 71(5): 33:1-33:32 (2024)- [c41]Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring. ESA 2024: 23:1-23:18 - [c40]Sayan Bhattacharya, Gramoz Goranci, Shaofeng H.-C. Jiang, Yi Qian, Yubo Zhang:
Dynamic Facility Location in High Dimensional Euclidean Spaces. ICML 2024 - [c39]Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time. SODA 2024: 3393-3440 - [c38]Sayan Bhattacharya
, Peter Kiss, Aaron Sidford, David Wajc:
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. STOC 2024: 59-70 - [c37]Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Arboricity-Dependent Algorithms for Edge Coloring. SWAT 2024: 12:1-12:15 - [i35]Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang:
Faster (Δ + 1)-Edge Coloring: Breaking the m √n Time Barrier. CoRR abs/2405.15449 (2024) - [i34]Sayan Bhattacharya, Martín Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis:
Fully Dynamic k-Clustering with Fast Update Time and Small Recourse. CoRR abs/2408.01325 (2024) - 2023
- [j10]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover. SIAM J. Comput. 52(5): 1132-1192 (2023) - [c36]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time. FOCS 2023: 1563-1588 - [c35]Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak:
Chasing Positive Bodies. FOCS 2023: 1694-1714 - [c34]Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis:
Fully Dynamic k-Clustering in Õ(k) Update Time. NeurIPS 2023 - [c33]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. SODA 2023: 1-47 - [c32]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc:
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. SODA 2023: 100-128 - [c31]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Sublinear Algorithms for (1.5+ε)-Approximate Matching. STOC 2023: 254-266 - [i33]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time. CoRR abs/2302.05030 (2023) - [i32]Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak:
Chasing Positive Bodies. CoRR abs/2304.01889 (2023) - [i31]Sayan Bhattacharya, Peter Kiss, Aaron Sidford, David Wajc:
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. CoRR abs/2306.11828 (2023) - [i30]Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Density-Sensitive Algorithms for (Δ+1)-Edge Coloring. CoRR abs/2307.02415 (2023) - [i29]Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis:
Fully Dynamic k-Clustering in Õ(k) Update Time. CoRR abs/2310.17420 (2023) - [i28]Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time. CoRR abs/2311.03267 (2023) - [i27]Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Arboricity-Dependent Algorithms for Edge Coloring. CoRR abs/2311.08367 (2023) - 2022
- [j9]Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon:
Fully Dynamic (Δ +1)-Coloring in O(1) Update Time. ACM Trans. Algorithms 18(2): 10:1-10:25 (2022) - [c30]Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert:
Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. ESA 2022: 17:1-17:19 - [c29]Sayan Bhattacharya, Silvio Lattanzi, Nikos Parotsidis:
Efficient and Stable Fully Dynamic Facility Location. NeurIPS 2022 - [c28]Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh:
A New Dynamic Algorithm for Densest Subhypergraphs. WWW 2022: 1093-1103 - [i26]Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh:
A New Dynamic Algorithm for Densest Subhypergraphs. CoRR abs/2204.08106 (2022) - [i25]Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert:
Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary. CoRR abs/2207.04954 (2022) - [i24]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc:
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. CoRR abs/2207.07438 (2022) - [i23]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. CoRR abs/2207.07519 (2022) - [i22]Sayan Bhattacharya, Silvio Lattanzi, Nikos Parotsidis:
Efficient and Stable Fully Dynamic Facility Location. CoRR abs/2210.13880 (2022) - [i21]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Sublinear Algorithms for (1.5+ε)-Approximate Matching. CoRR abs/2212.00189 (2022) - 2021
- [c27]Sayan Bhattacharya, Peter Kiss:
Deterministic Rounding of Dynamic Fractional Matchings. ICALP 2021: 27:1-27:14 - [c26]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. SODA 2021: 2537-2549 - [c25]Sayan Bhattacharya, Fabrizio Grandoni, David Wajc:
Online Edge Coloring Algorithms via the Nibble Method. SODA 2021: 2830-2842 - [i20]Sayan Bhattacharya, Peter Kiss:
Deterministic Rounding of Dynamic Fractional Matchings. CoRR abs/2105.01615 (2021) - 2020
- [j8]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger:
Deterministic Dynamic Matching in O(1) Update Time. Algorithmica 82(4): 1057-1080 (2020) - [j7]Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu:
Prior-free multi-unit auctions with ordered bidders. Theor. Comput. Sci. 846: 160-171 (2020) - [c24]Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak:
Coarse-Grained Complexity for Dynamic Algorithms. SODA 2020: 476-494 - [c23]Sayan Bhattacharya, Janardhan Kulkarni:
An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs. SODA 2020: 2509-2521 - [i19]Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak:
Coarse-Grained Complexity for Dynamic Algorithms. CoRR abs/2001.00336 (2020) - [i18]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
An Improved Algorithm for Dynamic Set Cover. CoRR abs/2002.11171 (2020) - [i17]Sayan Bhattacharya, Fabrizio Grandoni, David Wajc:
Online Edge Coloring Algorithms via the Nibble Method. CoRR abs/2010.16376 (2020)
2010 – 2019
- 2019
- [j6]Sayan Bhattacharya, Monika Henzinger, Stefan Neumann:
New amortized cell-probe lower bounds for dynamic problems. Theor. Comput. Sci. 779: 72-87 (2019) - [c22]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
A New Deterministic Algorithm for Dynamic Set Cover. FOCS 2019: 406-423 - [c21]Sayan Bhattacharya, Janardhan Kulkarni:
Deterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊2) Amortized Update Time. SODA 2019: 1872-1885 - [i16]Sayan Bhattacharya, Monika Henzinger, Stefan Neumann:
New Amortized Cell-Probe Lower Bounds for Dynamic Problems. CoRR abs/1902.02304 (2019) - [i15]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
A New Deterministic Algorithm for Dynamic Set Cover. CoRR abs/1909.11600 (2019) - [i14]Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon:
Fully Dynamic (Δ+1)-Coloring in Constant Update Time. CoRR abs/1910.02063 (2019) - 2018
- [j5]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Dynamic algorithms via the primal-dual method. Inf. Comput. 261: 219-239 (2018) - [j4]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SIAM J. Comput. 47(3): 859-887 (2018) - [c20]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai:
Dynamic Algorithms for Graph Coloring. SODA 2018: 1-20 - [i13]Sayan Bhattacharya, Janardhan Kulkarni:
Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε2) Amortized Update Time. CoRR abs/1805.03498 (2018) - [i12]Sayan Bhattacharya, Janardhan Kulkarni:
An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs. CoRR abs/1810.03491 (2018) - 2017
- [j3]Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger:
Welfare Maximization with Friends-of-Friends Network Externalities. Theory Comput. Syst. 61(4): 948-986 (2017) - [c19]Sayan Bhattacharya, Manoj Gupta, Divyarthi Mohan:
Improved Algorithm for Dynamic b-Matching. ESA 2017: 15:1-15:13 - [c18]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger:
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. IPCO 2017: 86-98 - [c17]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time. SODA 2017: 470-489 - [i11]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3n) Worst Case Update Time. CoRR abs/1704.02844 (2017) - [i10]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai:
Dynamic Algorithms for Graph Coloring. CoRR abs/1711.04355 (2017) - 2016
- [c16]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
New deterministic approximation algorithms for fully dynamic matching. STOC 2016: 398-411 - [i9]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Design of Dynamic Algorithms via Primal-Dual Method. CoRR abs/1604.05337 (2016) - [i8]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
New Deterministic Approximation Algorithms for Fully Dynamic Matching. CoRR abs/1604.05765 (2016) - [i7]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger:
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in $O(1)$ Amortized Update Time. CoRR abs/1611.00198 (2016) - 2015
- [c15]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Design of Dynamic Algorithms via Primal-Dual Method. ICALP (1) 2015: 206-218 - [c14]Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, Lisa Wagner:
Maintaining Near-Popular Matchings. ICALP (2) 2015: 504-515 - [c13]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SODA 2015: 785-804 - [c12]Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger:
Welfare Maximization with Friends-of-Friends Network Externalities. STACS 2015: 90-102 - [c11]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis:
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. STOC 2015: 173-182 - [i6]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis:
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. CoRR abs/1504.02268 (2015) - 2014
- [c10]Sayan Bhattacharya, Janardhan Kulkarni, Vahab S. Mirrokni:
Coordination Mechanisms for Selfish Routing over Time on a Tree. ICALP (1) 2014: 186-197 - [c9]Sayan Bhattacharya, Sungjin Im, Janardhan Kulkarni, Kamesh Munagala:
Coordination mechanisms from (almost) all scheduling policies. ITCS 2014: 121-134 - [c8]Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann:
New Approximability Results for the Robust k-Median Problem. SWAT 2014: 50-61 - [i5]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. CoRR abs/1412.1318 (2014) - 2013
- [c7]Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu:
Near-optimal multi-unit auctions with ordered bidders. EC 2013: 91-102 - [i4]Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann:
New Approximability Results for the Robust k-Median Problem. CoRR abs/1309.4602 (2013) - 2012
- [j2]Sayan Bhattacharya, Gagan Goel, Sreenivas Gollapudi, Kamesh Munagala:
Budget-Constrained Auctions with Heterogeneous Items. Theory Comput. 8(1): 429-460 (2012) - [c6]Sayan Bhattacharya, Dmytro Korzhyk, Vincent Conitzer:
Computing a Profit-Maximizing Sequence of Offers to Agents in a Social Network. WINE 2012: 482-488 - [i3]Sayan Bhattacharya, Janardhan Kulkarni, Xiaoming Xu:
Constant-Competitive Prior-Free Auction with Ordered Bidders. CoRR abs/1212.3079 (2012) - 2011
- [c5]Sayan Bhattacharya, Vincent Conitzer, Kamesh Munagala:
Approximation Algorithm for Security Games with Costly Resources. WINE 2011: 13-24 - [c4]Sayan Bhattacharya, Janardhan Kulkarni, Kamesh Munagala, Xiaoming Xu:
On Allocations with Negative Externalities. WINE 2011: 25-36 - [c3]Sayan Bhattacharya, Sreenivas Gollapudi, Kamesh Munagala:
Consideration set generation in commerce search. WWW 2011: 317-326 - 2010
- [j1]Sayan Bhattacharya, Goutam Paul, Swagato Sanyal:
A cops and robber game in multidimensional grids. Discret. Appl. Math. 158(16): 1745-1751 (2010) - [c2]Sayan Bhattacharya, Vincent Conitzer, Kamesh Munagala, Lirong Xia:
Incentive Compatible Budget Elicitation in Multi-unit Auctions. SODA 2010: 554-572 - [c1]Sayan Bhattacharya, Gagan Goel, Sreenivas Gollapudi, Kamesh Munagala:
Budget constrained auctions with heterogeneous items. STOC 2010: 379-388
2000 – 2009
- 2009
- [i2]Sayan Bhattacharya, Vincent Conitzer, Kamesh Munagala, Lirong Xia:
Incentive Compatible Budget Elicitation in Multi-unit Auctions. CoRR abs/0904.3501 (2009) - [i1]Sayan Bhattacharya, Goutam Paul, Swagato Sanyal:
On Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids. CoRR abs/0909.1381 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
