Sayan Bhattacharya

Available identifiers

zbMath Open bhattacharya.sayanMaRDI QIDQ602748

List of research outcomes

Publication	Date of Publication	Type
Nibbling at long cycles: dynamic (and static) edge coloring in optimal time	2024-11-28	Paper
Dynamic algorithms for packing-covering LPs via multiplicative weight updates	2024-05-14	Paper
Dynamic matching with better-than-2 approximation in polylogarithmic update time	2024-05-14	Paper
Sublinear algorithms for \((1.5+\epsilon)\)-approximate matching	2024-05-08	Paper
https://portal.mardi4nfdi.de/entity/Q6147407	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6147426	2024-01-15	Paper
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time	2023-10-31	Paper
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover	2023-10-26	Paper
Coarse-Grained Complexity for Dynamic Algorithms	2021-02-02	Paper
An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs	2021-02-02	Paper
Prior-free multi-unit auctions with ordered bidders	2020-11-06	Paper
Improved algorithm for dynamic b-Matching	2020-05-27	Paper
Deterministic dynamic matching in \(O(1)\) update time	2020-02-28	Paper
Deterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊2) Amortized Update Time	2019-10-15	Paper
New amortized cell-probe lower bounds for dynamic problems	2019-06-06	Paper
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time	2018-07-16	Paper
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching	2018-07-04	Paper
Dynamic algorithms via the primal-dual method	2018-06-14	Paper
https://portal.mardi4nfdi.de/entity/Q4607872	2018-03-15	Paper
Welfare maximization with friends-of-friends network externalities	2018-02-01	Paper
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching	2017-10-05	Paper
New deterministic approximation algorithms for fully dynamic matching	2017-09-29	Paper
Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time	2017-08-31	Paper
Coordination mechanisms from (almost) all scheduling policies	2017-05-19	Paper
Welfare Maximization with Friends-of-Friends Network Externalities	2017-01-24	Paper
Maintaining Near-Popular Matchings	2015-11-04	Paper
Design of Dynamic Algorithms via Primal-Dual Method	2015-10-27	Paper
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams	2015-08-21	Paper
New Approximability Results for the Robust k-Median Problem	2014-09-02	Paper
Budget constrained auctions with heterogeneous items	2014-08-13	Paper
Coordination Mechanisms for Selfish Routing over Time on a Tree	2014-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q5417648	2014-05-22	Paper
Budget-constrained auctions with heterogeneous items	2012-09-27	Paper
A cops and robber game in multidimensional grids	2010-11-05	Paper

Research outcomes over time

This page was built for person: Sayan Bhattacharya