( en | de | ru )

 

Disambiguation of "Bhattacharya, Sayan"

Author of the publication

copydeleteadd this publication to your clipboard
New Approximability Results for the Robust k-Median Problem.

, , , and . SWAT, volume 8503 of Lecture Notes in Computer Science, page 50-61. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sayan Chakrabarty

Sayan Ghosh

Sayan Mitra

Subhamoy Bhattacharya

Chhaya Bhattacharya

 

Other publications of authors with the same name

On Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids, , and . CoRR, (2009)An Improved Algorithm for Dynamic Set Cover., , , and . CoRR, (2020)Fully Dynamic k-Clustering in Õ(k) Update Time., , , and . CoRR, (2023)Sublinear Algorithms for (1.5+ε)-Approximate Matching., , and . CoRR, (2022)Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time., , and . SODA, page 470-489. SIAM, (2017)Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time., , , and . SODA, page 100-128. SIAM, (2023)An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs., and . SODA, page 2509-2521. SIAM, (2020)Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary., , and . ESA, volume 244 of LIPIcs, page 17:1-17:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time., , and . FOCS, page 1563-1588. IEEE, (2023)Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching., , and . CoRR, (2014)