Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Sayan Bhattacharya
@inproceedings{DBLP:conf/soda/BhattacharyaCPS24, author = {Sayan Bhattacharya and Mart{\'{\i}}n Costa and Nadav Panski and Shay Solomon}, editor = {David P. Woodruff}, title = {Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time}, booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2024, Alexandria, VA, USA, January 7-10, 2024}, pages = {3393--3440}, publisher = {{SIAM}}, year = {2024}, url = {https://doi.org/10.1137/1.9781611977912.122}, doi = {10.1137/1.9781611977912.122}, timestamp = {Thu, 04 Apr 2024 19:38:10 +0200}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyaCPS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BhattacharyaHNW23, author = {Sayan Bhattacharya and Monika Henzinger and Danupon Nanongkai and Xiaowei Wu}, title = {Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover}, journal = {{SIAM} J. Comput.}, volume = {52}, number = {5}, pages = {1132--1192}, year = {2023}, url = {https://doi.org/10.1137/21m1428649}, doi = {10.1137/21M1428649}, timestamp = {Thu, 09 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/BhattacharyaHNW23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BhattacharyaKS23, author = {Sayan Bhattacharya and Peter Kiss and Thatchaphol Saranurak}, title = {Dynamic (1+{\unicode{1013}})-Approximate Matching Size in Truly Sublinear Update Time}, booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2023, Santa Cruz, CA, USA, November 6-9, 2023}, pages = {1563--1588}, publisher = {{IEEE}}, year = {2023}, url = {https://doi.org/10.1109/FOCS57990.2023.00095}, doi = {10.1109/FOCS57990.2023.00095}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/BhattacharyaKS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BhattacharyaBLS23, author = {Sayan Bhattacharya and Niv Buchbinder and Roie Levin and Thatchaphol Saranurak}, title = {Chasing Positive Bodies}, booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2023, Santa Cruz, CA, USA, November 6-9, 2023}, pages = {1694--1714}, publisher = {{IEEE}}, year = {2023}, url = {https://doi.org/10.1109/FOCS57990.2023.00103}, doi = {10.1109/FOCS57990.2023.00103}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/BhattacharyaBLS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/BhattacharyaCLP23, author = {Sayan Bhattacharya and Mart{\'{\i}}n Costa and Silvio Lattanzi and Nikos Parotsidis}, editor = {Alice Oh and Tristan Naumann and Amir Globerson and Kate Saenko and Moritz Hardt and Sergey Levine}, title = {Fully Dynamic k-Clustering in {\~{O}}(k) Update Time}, booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023}, year = {2023}, url = {http://papers.nips.cc/paper\_files/paper/2023/hash/3b7ba46201bf15e5c3935272afae50db-Abstract-Conference.html}, timestamp = {Fri, 01 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/BhattacharyaCLP23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhattacharyaKS23, author = {Sayan Bhattacharya and Peter Kiss and Thatchaphol Saranurak}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {1--47}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch1}, doi = {10.1137/1.9781611977554.CH1}, timestamp = {Fri, 17 Feb 2023 09:28:57 +0100}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyaKS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhattacharyaKSW23, author = {Sayan Bhattacharya and Peter Kiss and Thatchaphol Saranurak and David Wajc}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {100--128}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch5}, doi = {10.1137/1.9781611977554.CH5}, timestamp = {Fri, 17 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyaKSW23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BhattacharyaKS23, author = {Sayan Bhattacharya and Peter Kiss and Thatchaphol Saranurak}, editor = {Barna Saha and Rocco A. Servedio}, title = {Sublinear Algorithms for (1.5+{\(\epsilon\)})-Approximate Matching}, booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing, {STOC} 2023, Orlando, FL, USA, June 20-23, 2023}, pages = {254--266}, publisher = {{ACM}}, year = {2023}, url = {https://doi.org/10.1145/3564246.3585252}, doi = {10.1145/3564246.3585252}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BhattacharyaKS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2302-05030, author = {Sayan Bhattacharya and Peter Kiss and Thatchaphol Saranurak}, title = {Dynamic {\textdollar}(1+{\(\epsilon\)}){\textdollar}-Approximate Matching Size in Truly Sublinear Update Time}, journal = {CoRR}, volume = {abs/2302.05030}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2302.05030}, doi = {10.48550/ARXIV.2302.05030}, eprinttype = {arXiv}, eprint = {2302.05030}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2302-05030.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2304-01889, author = {Sayan Bhattacharya and Niv Buchbinder and Roie Levin and Thatchaphol Saranurak}, title = {Chasing Positive Bodies}, journal = {CoRR}, volume = {abs/2304.01889}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2304.01889}, doi = {10.48550/ARXIV.2304.01889}, eprinttype = {arXiv}, eprint = {2304.01889}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2304-01889.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2306-11828, author = {Sayan Bhattacharya and Peter Kiss and Aaron Sidford and David Wajc}, title = {Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs}, journal = {CoRR}, volume = {abs/2306.11828}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2306.11828}, doi = {10.48550/ARXIV.2306.11828}, eprinttype = {arXiv}, eprint = {2306.11828}, timestamp = {Fri, 23 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2306-11828.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2307-02415, author = {Sayan Bhattacharya and Mart{\'{\i}}n Costa and Nadav Panski and Shay Solomon}, title = {Density-Sensitive Algorithms for ({\(\Delta\)}+1)-Edge Coloring}, journal = {CoRR}, volume = {abs/2307.02415}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2307.02415}, doi = {10.48550/ARXIV.2307.02415}, eprinttype = {arXiv}, eprint = {2307.02415}, timestamp = {Mon, 10 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2307-02415.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2310-17420, author = {Sayan Bhattacharya and Mart{\'{\i}}n Costa and Silvio Lattanzi and Nikos Parotsidis}, title = {Fully Dynamic k-Clustering in O{\~}(k) Update Time}, journal = {CoRR}, volume = {abs/2310.17420}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2310.17420}, doi = {10.48550/ARXIV.2310.17420}, eprinttype = {arXiv}, eprint = {2310.17420}, timestamp = {Thu, 02 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2310-17420.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2311-03267, author = {Sayan Bhattacharya and Mart{\'{\i}}n Costa and Nadav Panski and Shay Solomon}, title = {Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time}, journal = {CoRR}, volume = {abs/2311.03267}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2311.03267}, doi = {10.48550/ARXIV.2311.03267}, eprinttype = {arXiv}, eprint = {2311.03267}, timestamp = {Wed, 08 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2311-03267.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2311-08367, author = {Sayan Bhattacharya and Mart{\'{\i}}n Costa and Nadav Panski and Shay Solomon}, title = {Arboricity-Dependent Algorithms for Edge Coloring}, journal = {CoRR}, volume = {abs/2311.08367}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2311.08367}, doi = {10.48550/ARXIV.2311.08367}, eprinttype = {arXiv}, eprint = {2311.08367}, timestamp = {Tue, 21 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2311-08367.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/BhattacharyaGKL22, author = {Sayan Bhattacharya and Fabrizio Grandoni and Janardhan Kulkarni and Quanquan C. Liu and Shay Solomon}, title = {Fully Dynamic ({\(\Delta\)} +1)-Coloring in \emph{O}(1) Update Time}, journal = {{ACM} Trans. Algorithms}, volume = {18}, number = {2}, pages = {10:1--10:25}, year = {2022}, url = {https://doi.org/10.1145/3494539}, doi = {10.1145/3494539}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/BhattacharyaGKL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BhattacharyaSS22, author = {Sayan Bhattacharya and Thatchaphol Saranurak and Pattara Sukprasert}, editor = {Shiri Chechik and Gonzalo Navarro and Eva Rotenberg and Grzegorz Herman}, title = {Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary}, booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, series = {LIPIcs}, volume = {244}, pages = {17:1--17:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ESA.2022.17}, doi = {10.4230/LIPICS.ESA.2022.17}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/esa/BhattacharyaSS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/BhattacharyaLP22, author = {Sayan Bhattacharya and Silvio Lattanzi and Nikos Parotsidis}, editor = {Sanmi Koyejo and S. Mohamed and A. Agarwal and Danielle Belgrave and K. Cho and A. Oh}, title = {Efficient and Stable Fully Dynamic Facility Location}, booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022}, year = {2022}, url = {http://papers.nips.cc/paper\_files/paper/2022/hash/943d6dca1884955e645d8997ae2fa938-Abstract-Conference.html}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/BhattacharyaLP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/www/BeraBCG22, author = {Suman K. Bera and Sayan Bhattacharya and Jayesh Choudhari and Prantar Ghosh}, editor = {Fr{\'{e}}d{\'{e}}rique Laforest and Rapha{\"{e}}l Troncy and Elena Simperl and Deepak Agarwal and Aristides Gionis and Ivan Herman and Lionel M{\'{e}}dini}, title = {A New Dynamic Algorithm for Densest Subhypergraphs}, booktitle = {{WWW} '22: The {ACM} Web Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022}, pages = {1093--1103}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3485447.3512158}, doi = {10.1145/3485447.3512158}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/www/BeraBCG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2204-08106, author = {Suman K. Bera and Sayan Bhattacharya and Jayesh Choudhari and Prantar Ghosh}, title = {A New Dynamic Algorithm for Densest Subhypergraphs}, journal = {CoRR}, volume = {abs/2204.08106}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2204.08106}, doi = {10.48550/ARXIV.2204.08106}, eprinttype = {arXiv}, eprint = {2204.08106}, timestamp = {Thu, 07 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2204-08106.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-04954, author = {Sayan Bhattacharya and Thatchaphol Saranurak and Pattara Sukprasert}, title = {Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary}, journal = {CoRR}, volume = {abs/2207.04954}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.04954}, doi = {10.48550/ARXIV.2207.04954}, eprinttype = {arXiv}, eprint = {2207.04954}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-04954.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-07438, author = {Sayan Bhattacharya and Peter Kiss and Thatchaphol Saranurak and David Wajc}, title = {Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time}, journal = {CoRR}, volume = {abs/2207.07438}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.07438}, doi = {10.48550/ARXIV.2207.07438}, eprinttype = {arXiv}, eprint = {2207.07438}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-07438.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-07519, author = {Sayan Bhattacharya and Peter Kiss and Thatchaphol Saranurak}, title = {Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates}, journal = {CoRR}, volume = {abs/2207.07519}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.07519}, doi = {10.48550/ARXIV.2207.07519}, eprinttype = {arXiv}, eprint = {2207.07519}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-07519.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2210-13880, author = {Sayan Bhattacharya and Silvio Lattanzi and Nikos Parotsidis}, title = {Efficient and Stable Fully Dynamic Facility Location}, journal = {CoRR}, volume = {abs/2210.13880}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2210.13880}, doi = {10.48550/ARXIV.2210.13880}, eprinttype = {arXiv}, eprint = {2210.13880}, timestamp = {Mon, 31 Oct 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2210-13880.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2212-00189, author = {Sayan Bhattacharya and Peter Kiss and Thatchaphol Saranurak}, title = {Sublinear Algorithms for (1.5+{\(\epsilon\)})-Approximate Matching}, journal = {CoRR}, volume = {abs/2212.00189}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2212.00189}, doi = {10.48550/ARXIV.2212.00189}, eprinttype = {arXiv}, eprint = {2212.00189}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2212-00189.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BhattacharyaK21, author = {Sayan Bhattacharya and Peter Kiss}, editor = {Nikhil Bansal and Emanuela Merelli and James Worrell}, title = {Deterministic Rounding of Dynamic Fractional Matchings}, booktitle = {48th International Colloquium on Automata, Languages, and Programming, {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)}, series = {LIPIcs}, volume = {198}, pages = {27:1--27:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.27}, doi = {10.4230/LIPICS.ICALP.2021.27}, timestamp = {Tue, 15 Feb 2022 07:54:27 +0100}, biburl = {https://dblp.org/rec/conf/icalp/BhattacharyaK21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhattacharyaHNW21, author = {Sayan Bhattacharya and Monika Henzinger and Danupon Nanongkai and Xiaowei Wu}, editor = {D{\'{a}}niel Marx}, title = {Dynamic Set Cover: Improved Amortized and Worst-Case Update Time}, booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2021, Virtual Conference, January 10 - 13, 2021}, pages = {2537--2549}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976465.150}, doi = {10.1137/1.9781611976465.150}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyaHNW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhattacharyaGW21, author = {Sayan Bhattacharya and Fabrizio Grandoni and David Wajc}, editor = {D{\'{a}}niel Marx}, title = {Online Edge Coloring Algorithms via the Nibble Method}, booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2021, Virtual Conference, January 10 - 13, 2021}, pages = {2830--2842}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976465.168}, doi = {10.1137/1.9781611976465.168}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyaGW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2105-01615, author = {Sayan Bhattacharya and Peter Kiss}, title = {Deterministic Rounding of Dynamic Fractional Matchings}, journal = {CoRR}, volume = {abs/2105.01615}, year = {2021}, url = {https://arxiv.org/abs/2105.01615}, eprinttype = {arXiv}, eprint = {2105.01615}, timestamp = {Wed, 12 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2105-01615.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BhattacharyaCH20, author = {Sayan Bhattacharya and Deeparnab Chakrabarty and Monika Henzinger}, title = {Deterministic Dynamic Matching in {O(1)} Update Time}, journal = {Algorithmica}, volume = {82}, number = {4}, pages = {1057--1080}, year = {2020}, url = {https://doi.org/10.1007/s00453-019-00630-4}, doi = {10.1007/S00453-019-00630-4}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/BhattacharyaCH20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BhattacharyaKKL20, author = {Sayan Bhattacharya and Elias Koutsoupias and Janardhan Kulkarni and Stefano Leonardi and Tim Roughgarden and Xiaoming Xu}, title = {Prior-free multi-unit auctions with ordered bidders}, journal = {Theor. Comput. Sci.}, volume = {846}, pages = {160--171}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2020.09.030}, doi = {10.1016/J.TCS.2020.09.030}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BhattacharyaKKL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhattacharyaNS20, author = {Sayan Bhattacharya and Danupon Nanongkai and Thatchaphol Saranurak}, editor = {Shuchi Chawla}, title = {Coarse-Grained Complexity for Dynamic Algorithms}, booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020}, pages = {476--494}, publisher = {{SIAM}}, year = {2020}, url = {https://doi.org/10.1137/1.9781611975994.29}, doi = {10.1137/1.9781611975994.29}, timestamp = {Thu, 15 Jul 2021 13:48:53 +0200}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyaNS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhattacharyaK20, author = {Sayan Bhattacharya and Janardhan Kulkarni}, editor = {Shuchi Chawla}, title = {An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs}, booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020}, pages = {2509--2521}, publisher = {{SIAM}}, year = {2020}, url = {https://doi.org/10.1137/1.9781611975994.153}, doi = {10.1137/1.9781611975994.153}, timestamp = {Thu, 15 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyaK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2001-00336, author = {Sayan Bhattacharya and Danupon Nanongkai and Thatchaphol Saranurak}, title = {Coarse-Grained Complexity for Dynamic Algorithms}, journal = {CoRR}, volume = {abs/2001.00336}, year = {2020}, url = {http://arxiv.org/abs/2001.00336}, eprinttype = {arXiv}, eprint = {2001.00336}, timestamp = {Fri, 10 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2001-00336.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-11171, author = {Sayan Bhattacharya and Monika Henzinger and Danupon Nanongkai and Xiaowei Wu}, title = {An Improved Algorithm for Dynamic Set Cover}, journal = {CoRR}, volume = {abs/2002.11171}, year = {2020}, url = {https://arxiv.org/abs/2002.11171}, eprinttype = {arXiv}, eprint = {2002.11171}, timestamp = {Fri, 16 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-11171.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2010-16376, author = {Sayan Bhattacharya and Fabrizio Grandoni and David Wajc}, title = {Online Edge Coloring Algorithms via the Nibble Method}, journal = {CoRR}, volume = {abs/2010.16376}, year = {2020}, url = {https://arxiv.org/abs/2010.16376}, eprinttype = {arXiv}, eprint = {2010.16376}, timestamp = {Tue, 03 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2010-16376.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BhattacharyaHN19, author = {Sayan Bhattacharya and Monika Henzinger and Stefan Neumann}, title = {New amortized cell-probe lower bounds for dynamic problems}, journal = {Theor. Comput. Sci.}, volume = {779}, pages = {72--87}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2019.01.043}, doi = {10.1016/J.TCS.2019.01.043}, timestamp = {Mon, 01 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BhattacharyaHN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BhattacharyaHN19, author = {Sayan Bhattacharya and Monika Henzinger and Danupon Nanongkai}, editor = {David Zuckerman}, title = {A New Deterministic Algorithm for Dynamic Set Cover}, booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2019, Baltimore, Maryland, USA, November 9-12, 2019}, pages = {406--423}, publisher = {{IEEE} Computer Society}, year = {2019}, url = {https://doi.org/10.1109/FOCS.2019.00033}, doi = {10.1109/FOCS.2019.00033}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/BhattacharyaHN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhattacharyaK19, author = {Sayan Bhattacharya and Janardhan Kulkarni}, editor = {Timothy M. Chan}, title = {Deterministically Maintaining a {(2} + {\unicode{8714}})-Approximate Minimum Vertex Cover in O(1/{\unicode{8714}}2) Amortized Update Time}, booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9, 2019}, pages = {1872--1885}, publisher = {{SIAM}}, year = {2019}, url = {https://doi.org/10.1137/1.9781611975482.113}, doi = {10.1137/1.9781611975482.113}, timestamp = {Thu, 15 Jul 2021 13:49:01 +0200}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyaK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-02304, author = {Sayan Bhattacharya and Monika Henzinger and Stefan Neumann}, title = {New Amortized Cell-Probe Lower Bounds for Dynamic Problems}, journal = {CoRR}, volume = {abs/1902.02304}, year = {2019}, url = {http://arxiv.org/abs/1902.02304}, eprinttype = {arXiv}, eprint = {1902.02304}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-02304.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1909-11600, author = {Sayan Bhattacharya and Monika Henzinger and Danupon Nanongkai}, title = {A New Deterministic Algorithm for Dynamic Set Cover}, journal = {CoRR}, volume = {abs/1909.11600}, year = {2019}, url = {http://arxiv.org/abs/1909.11600}, eprinttype = {arXiv}, eprint = {1909.11600}, timestamp = {Fri, 27 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1909-11600.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1910-02063, author = {Sayan Bhattacharya and Fabrizio Grandoni and Janardhan Kulkarni and Quanquan C. Liu and Shay Solomon}, title = {Fully Dynamic ({\(\Delta\)}+1)-Coloring in Constant Update Time}, journal = {CoRR}, volume = {abs/1910.02063}, year = {2019}, url = {http://arxiv.org/abs/1910.02063}, eprinttype = {arXiv}, eprint = {1910.02063}, timestamp = {Wed, 09 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1910-02063.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BhattacharyaHI18, author = {Sayan Bhattacharya and Monika Henzinger and Giuseppe F. Italiano}, title = {Dynamic algorithms via the primal-dual method}, journal = {Inf. Comput.}, volume = {261}, pages = {219--239}, year = {2018}, url = {https://doi.org/10.1016/j.ic.2018.02.005}, doi = {10.1016/J.IC.2018.02.005}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BhattacharyaHI18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BhattacharyaHI18, author = {Sayan Bhattacharya and Monika Henzinger and Giuseppe F. Italiano}, title = {Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching}, journal = {{SIAM} J. Comput.}, volume = {47}, number = {3}, pages = {859--887}, year = {2018}, url = {https://doi.org/10.1137/140998925}, doi = {10.1137/140998925}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/BhattacharyaHI18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhattacharyaCHN18, author = {Sayan Bhattacharya and Deeparnab Chakrabarty and Monika Henzinger and Danupon Nanongkai}, editor = {Artur Czumaj}, title = {Dynamic Algorithms for Graph Coloring}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018}, pages = {1--20}, publisher = {{SIAM}}, year = {2018}, url = {https://doi.org/10.1137/1.9781611975031.1}, doi = {10.1137/1.9781611975031.1}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyaCHN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1805-03498, author = {Sayan Bhattacharya and Janardhan Kulkarni}, title = {Deterministically Maintaining a (2+{\(\epsilon\)})-Approximate Minimum Vertex Cover in O(1/{\(\epsilon\)}\({}^{\mbox{2}}\)) Amortized Update Time}, journal = {CoRR}, volume = {abs/1805.03498}, year = {2018}, url = {http://arxiv.org/abs/1805.03498}, eprinttype = {arXiv}, eprint = {1805.03498}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1805-03498.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1810-03491, author = {Sayan Bhattacharya and Janardhan Kulkarni}, title = {An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs}, journal = {CoRR}, volume = {abs/1810.03491}, year = {2018}, url = {http://arxiv.org/abs/1810.03491}, eprinttype = {arXiv}, eprint = {1810.03491}, timestamp = {Tue, 30 Oct 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1810-03491.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BhattacharyaDHS17, author = {Sayan Bhattacharya and Wolfgang Dvor{\'{a}}k and Monika Henzinger and Martin Starnberger}, title = {Welfare Maximization with Friends-of-Friends Network Externalities}, journal = {Theory Comput. Syst.}, volume = {61}, number = {4}, pages = {948--986}, year = {2017}, url = {https://doi.org/10.1007/s00224-017-9759-8}, doi = {10.1007/S00224-017-9759-8}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/BhattacharyaDHS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BhattacharyaGM17, author = {Sayan Bhattacharya and Manoj Gupta and Divyarthi Mohan}, editor = {Kirk Pruhs and Christian Sohler}, title = {Improved Algorithm for Dynamic b-Matching}, booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September 4-6, 2017, Vienna, Austria}, series = {LIPIcs}, volume = {87}, pages = {15:1--15:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ESA.2017.15}, doi = {10.4230/LIPICS.ESA.2017.15}, timestamp = {Wed, 22 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/BhattacharyaGM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/BhattacharyaCH17, author = {Sayan Bhattacharya and Deeparnab Chakrabarty and Monika Henzinger}, editor = {Friedrich Eisenbrand and Jochen K{\"{o}}nemann}, title = {Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in {O(1)} Amortized Update Time}, booktitle = {Integer Programming and Combinatorial Optimization - 19th International Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10328}, pages = {86--98}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-59250-3\_8}, doi = {10.1007/978-3-319-59250-3\_8}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/ipco/BhattacharyaCH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhattacharyaHN17, author = {Sayan Bhattacharya and Monika Henzinger and Danupon Nanongkai}, editor = {Philip N. Klein}, title = {Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in \emph{O}(log\({}^{\mbox{3}}\) \emph{n}) Worst Case Update Time}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {470--489}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.30}, doi = {10.1137/1.9781611974782.30}, timestamp = {Tue, 02 Feb 2021 17:07:33 +0100}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyaHN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BhattacharyaHN17, author = {Sayan Bhattacharya and Monika Henzinger and Danupon Nanongkai}, title = {Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log\({}^{\mbox{3}}\)n) Worst Case Update Time}, journal = {CoRR}, volume = {abs/1704.02844}, year = {2017}, url = {http://arxiv.org/abs/1704.02844}, eprinttype = {arXiv}, eprint = {1704.02844}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BhattacharyaHN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-04355, author = {Sayan Bhattacharya and Deeparnab Chakrabarty and Monika Henzinger and Danupon Nanongkai}, title = {Dynamic Algorithms for Graph Coloring}, journal = {CoRR}, volume = {abs/1711.04355}, year = {2017}, url = {http://arxiv.org/abs/1711.04355}, eprinttype = {arXiv}, eprint = {1711.04355}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-04355.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BhattacharyaHN16, author = {Sayan Bhattacharya and Monika Henzinger and Danupon Nanongkai}, editor = {Daniel Wichs and Yishay Mansour}, title = {New deterministic approximation algorithms for fully dynamic matching}, booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016}, pages = {398--411}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2897518.2897568}, doi = {10.1145/2897518.2897568}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BhattacharyaHN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BhattacharyaHI16, author = {Sayan Bhattacharya and Monika Henzinger and Giuseppe F. Italiano}, title = {Design of Dynamic Algorithms via Primal-Dual Method}, journal = {CoRR}, volume = {abs/1604.05337}, year = {2016}, url = {http://arxiv.org/abs/1604.05337}, eprinttype = {arXiv}, eprint = {1604.05337}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BhattacharyaHI16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BhattacharyaHN16, author = {Sayan Bhattacharya and Monika Henzinger and Danupon Nanongkai}, title = {New Deterministic Approximation Algorithms for Fully Dynamic Matching}, journal = {CoRR}, volume = {abs/1604.05765}, year = {2016}, url = {http://arxiv.org/abs/1604.05765}, eprinttype = {arXiv}, eprint = {1604.05765}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BhattacharyaHN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BhattacharyaCH16, author = {Sayan Bhattacharya and Deeparnab Chakrabarty and Monika Henzinger}, title = {Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in {\textdollar}O(1){\textdollar} Amortized Update Time}, journal = {CoRR}, volume = {abs/1611.00198}, year = {2016}, url = {http://arxiv.org/abs/1611.00198}, eprinttype = {arXiv}, eprint = {1611.00198}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BhattacharyaCH16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BhattacharyaHI15, author = {Sayan Bhattacharya and Monika Henzinger and Giuseppe F. Italiano}, editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Kazuo Iwama and Naoki Kobayashi and Bettina Speckmann}, title = {Design of Dynamic Algorithms via Primal-Dual Method}, booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {9134}, pages = {206--218}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-47672-7\_17}, doi = {10.1007/978-3-662-47672-7\_17}, timestamp = {Fri, 27 Mar 2020 09:02:59 +0100}, biburl = {https://dblp.org/rec/conf/icalp/BhattacharyaHI15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BhattacharyaHHK15, author = {Sayan Bhattacharya and Martin Hoefer and Chien{-}Chung Huang and Telikepalli Kavitha and Lisa Wagner}, editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Kazuo Iwama and Naoki Kobayashi and Bettina Speckmann}, title = {Maintaining Near-Popular Matchings}, booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {9135}, pages = {504--515}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-47666-6\_40}, doi = {10.1007/978-3-662-47666-6\_40}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/BhattacharyaHHK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhattacharyaHI15, author = {Sayan Bhattacharya and Monika Henzinger and Giuseppe F. Italiano}, editor = {Piotr Indyk}, title = {Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching}, booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015}, pages = {785--804}, publisher = {{SIAM}}, year = {2015}, url = {https://doi.org/10.1137/1.9781611973730.54}, doi = {10.1137/1.9781611973730.54}, timestamp = {Tue, 02 Feb 2021 17:07:30 +0100}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyaHI15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BhattacharyaDHS15, author = {Sayan Bhattacharya and Wolfgang Dvor{\'{a}}k and Monika Henzinger and Martin Starnberger}, editor = {Ernst W. Mayr and Nicolas Ollinger}, title = {Welfare Maximization with Friends-of-Friends Network Externalities}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science, {STACS} 2015, March 4-7, 2015, Garching, Germany}, series = {LIPIcs}, volume = {30}, pages = {90--102}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.STACS.2015.90}, doi = {10.4230/LIPICS.STACS.2015.90}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/BhattacharyaDHS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BhattacharyaHNT15, author = {Sayan Bhattacharya and Monika Henzinger and Danupon Nanongkai and Charalampos E. Tsourakakis}, editor = {Rocco A. Servedio and Ronitt Rubinfeld}, title = {Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams}, booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015}, pages = {173--182}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2746539.2746592}, doi = {10.1145/2746539.2746592}, timestamp = {Mon, 01 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BhattacharyaHNT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BhattacharyaHNT15, author = {Sayan Bhattacharya and Monika Henzinger and Danupon Nanongkai and Charalampos E. Tsourakakis}, title = {Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams}, journal = {CoRR}, volume = {abs/1504.02268}, year = {2015}, url = {http://arxiv.org/abs/1504.02268}, eprinttype = {arXiv}, eprint = {1504.02268}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BhattacharyaHNT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BhattacharyaKM14, author = {Sayan Bhattacharya and Janardhan Kulkarni and Vahab S. Mirrokni}, editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias}, title = {Coordination Mechanisms for Selfish Routing over Time on a Tree}, booktitle = {Automata, Languages, and Programming - 41st International Colloquium, {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {8572}, pages = {186--197}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-43948-7\_16}, doi = {10.1007/978-3-662-43948-7\_16}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BhattacharyaKM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BhattacharyaIKM14, author = {Sayan Bhattacharya and Sungjin Im and Janardhan Kulkarni and Kamesh Munagala}, editor = {Moni Naor}, title = {Coordination mechanisms from (almost) all scheduling policies}, booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ, USA, January 12-14, 2014}, pages = {121--134}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2554797.2554811}, doi = {10.1145/2554797.2554811}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/BhattacharyaIKM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/BhattacharyaCMN14, author = {Sayan Bhattacharya and Parinya Chalermsook and Kurt Mehlhorn and Adrian Neumann}, editor = {R. Ravi and Inge Li G{\o}rtz}, title = {New Approximability Results for the Robust k-Median Problem}, booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8503}, pages = {50--61}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-08404-6\_5}, doi = {10.1007/978-3-319-08404-6\_5}, timestamp = {Sun, 02 Jun 2019 21:15:18 +0200}, biburl = {https://dblp.org/rec/conf/swat/BhattacharyaCMN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BhattacharyaHI14, author = {Sayan Bhattacharya and Monika Henzinger and Giuseppe F. Italiano}, title = {Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching}, journal = {CoRR}, volume = {abs/1412.1318}, year = {2014}, url = {http://arxiv.org/abs/1412.1318}, eprinttype = {arXiv}, eprint = {1412.1318}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BhattacharyaHI14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/BhattacharyaKKLRX13, author = {Sayan Bhattacharya and Elias Koutsoupias and Janardhan Kulkarni and Stefano Leonardi and Tim Roughgarden and Xiaoming Xu}, editor = {Michael J. Kearns and R. Preston McAfee and {\'{E}}va Tardos}, title = {Near-optimal multi-unit auctions with ordered bidders}, booktitle = {Proceedings of the fourteenth {ACM} Conference on Electronic Commerce, {EC} 2013, Philadelphia, PA, USA, June 16-20, 2013}, pages = {91--102}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2492002.2482555}, doi = {10.1145/2492002.2482555}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/BhattacharyaKKLRX13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BhattacharyaCMN13, author = {Sayan Bhattacharya and Parinya Chalermsook and Kurt Mehlhorn and Adrian Neumann}, title = {New Approximability Results for the Robust k-Median Problem}, journal = {CoRR}, volume = {abs/1309.4602}, year = {2013}, url = {http://arxiv.org/abs/1309.4602}, eprinttype = {arXiv}, eprint = {1309.4602}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BhattacharyaCMN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/BhattacharyaGGM12, author = {Sayan Bhattacharya and Gagan Goel and Sreenivas Gollapudi and Kamesh Munagala}, title = {Budget-Constrained Auctions with Heterogeneous Items}, journal = {Theory Comput.}, volume = {8}, number = {1}, pages = {429--460}, year = {2012}, url = {https://doi.org/10.4086/toc.2012.v008a020}, doi = {10.4086/TOC.2012.V008A020}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/BhattacharyaGGM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/BhattacharyaKC12, author = {Sayan Bhattacharya and Dmytro Korzhyk and Vincent Conitzer}, editor = {Paul W. Goldberg}, title = {Computing a Profit-Maximizing Sequence of Offers to Agents in a Social Network}, booktitle = {Internet and Network Economics - 8th International Workshop, {WINE} 2012, Liverpool, UK, December 10-12, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7695}, pages = {482--488}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35311-6\_36}, doi = {10.1007/978-3-642-35311-6\_36}, timestamp = {Tue, 14 May 2019 10:00:36 +0200}, biburl = {https://dblp.org/rec/conf/wine/BhattacharyaKC12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1212-3079, author = {Sayan Bhattacharya and Janardhan Kulkarni and Xiaoming Xu}, title = {Constant-Competitive Prior-Free Auction with Ordered Bidders}, journal = {CoRR}, volume = {abs/1212.3079}, year = {2012}, url = {http://arxiv.org/abs/1212.3079}, eprinttype = {arXiv}, eprint = {1212.3079}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1212-3079.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/BhattacharyaCM11, author = {Sayan Bhattacharya and Vincent Conitzer and Kamesh Munagala}, editor = {Ning Chen and Edith Elkind and Elias Koutsoupias}, title = {Approximation Algorithm for Security Games with Costly Resources}, booktitle = {Internet and Network Economics - 7th International Workshop, {WINE} 2011, Singapore, December 11-14, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7090}, pages = {13--24}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25510-6\_2}, doi = {10.1007/978-3-642-25510-6\_2}, timestamp = {Fri, 24 Apr 2020 14:22:03 +0200}, biburl = {https://dblp.org/rec/conf/wine/BhattacharyaCM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/BhattacharyaKMX11, author = {Sayan Bhattacharya and Janardhan Kulkarni and Kamesh Munagala and Xiaoming Xu}, editor = {Ning Chen and Edith Elkind and Elias Koutsoupias}, title = {On Allocations with Negative Externalities}, booktitle = {Internet and Network Economics - 7th International Workshop, {WINE} 2011, Singapore, December 11-14, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7090}, pages = {25--36}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25510-6\_3}, doi = {10.1007/978-3-642-25510-6\_3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wine/BhattacharyaKMX11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/www/BhattacharyaGM11, author = {Sayan Bhattacharya and Sreenivas Gollapudi and Kamesh Munagala}, editor = {Sadagopan Srinivasan and Krithi Ramamritham and Arun Kumar and M. P. Ravindra and Elisa Bertino and Ravi Kumar}, title = {Consideration set generation in commerce search}, booktitle = {Proceedings of the 20th International Conference on World Wide Web, {WWW} 2011, Hyderabad, India, March 28 - April 1, 2011}, pages = {317--326}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1963405.1963452}, doi = {10.1145/1963405.1963452}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/www/BhattacharyaGM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BhattacharyaPS10, author = {Sayan Bhattacharya and Goutam Paul and Swagato Sanyal}, title = {A cops and robber game in multidimensional grids}, journal = {Discret. Appl. Math.}, volume = {158}, number = {16}, pages = {1745--1751}, year = {2010}, url = {https://doi.org/10.1016/j.dam.2010.06.014}, doi = {10.1016/J.DAM.2010.06.014}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BhattacharyaPS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhattacharyaCMX10, author = {Sayan Bhattacharya and Vincent Conitzer and Kamesh Munagala and Lirong Xia}, editor = {Moses Charikar}, title = {Incentive Compatible Budget Elicitation in Multi-unit Auctions}, booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010}, pages = {554--572}, publisher = {{SIAM}}, year = {2010}, url = {https://doi.org/10.1137/1.9781611973075.47}, doi = {10.1137/1.9781611973075.47}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyaCMX10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BhattacharyaGGM10, author = {Sayan Bhattacharya and Gagan Goel and Sreenivas Gollapudi and Kamesh Munagala}, editor = {Leonard J. Schulman}, title = {Budget constrained auctions with heterogeneous items}, booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC} 2010, Cambridge, Massachusetts, USA, 5-8 June 2010}, pages = {379--388}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1806689.1806743}, doi = {10.1145/1806689.1806743}, timestamp = {Mon, 26 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BhattacharyaGGM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0904-3501, author = {Sayan Bhattacharya and Vincent Conitzer and Kamesh Munagala and Lirong Xia}, title = {Incentive Compatible Budget Elicitation in Multi-unit Auctions}, journal = {CoRR}, volume = {abs/0904.3501}, year = {2009}, url = {http://arxiv.org/abs/0904.3501}, eprinttype = {arXiv}, eprint = {0904.3501}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0904-3501.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0909-1381, author = {Sayan Bhattacharya and Goutam Paul and Swagato Sanyal}, title = {On Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids}, journal = {CoRR}, volume = {abs/0909.1381}, year = {2009}, url = {http://arxiv.org/abs/0909.1381}, eprinttype = {arXiv}, eprint = {0909.1381}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0909-1381.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.