# Sayan Bhattacharya

According to our database

Collaborative distances:

^{1}, Sayan Bhattacharya authored at least 53 papers between 2009 and 2023.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2023

SIAM J. Comput., October, 2023

CoRR, 2023

CoRR, 2023

CoRR, 2023

CoRR, 2023

CoRR, 2023

CoRR, 2023

CoRR, 2023

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

ACM Trans. Algorithms, 2022

Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

NeurIPS, 2022

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Theor. Comput. Sci., 2020

CoRR, 2020

Algorithmica, 2020

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs.

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Theor. Comput. Sci., 2019

CoRR, 2019

Deterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊2) Amortized Update Time.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

SIAM J. Comput., 2018

Inf. Comput., 2018

Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε<sup>2</sup>) Amortized Update Time.

CoRR, 2018

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Theory Comput. Syst., 2017

Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log<sup>3</sup>n) Worst Case Update Time.

CoRR, 2017

Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time.

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

2015

Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams.

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Proceedings of the Algorithm Theory - SWAT 2014, 2014

Proceedings of the Innovations in Theoretical Computer Science, 2014

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

Theory Comput., 2012

CoRR, 2012

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

2011

Proceedings of the 20th International Conference on World Wide Web, 2011

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

2010

Discret. Appl. Math., 2010

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

On Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids

CoRR, 2009